TY - GEN
T1 - Data mapping in intelligent form using random hierarchical bit format enhancing the security in data retrieval
AU - Gupta, Rahul
AU - Garg, Nidhi
AU - Kumar, Preetham
PY - 2013/1/1
Y1 - 2013/1/1
N2 - The paper highlights a unique and secure way of retrieving data, where user can never identify the path followed by the system to reach the goal. The whole collection of data is represented in Boolean form which is stored in a matrix. This matrix can be used for quick retrieval of data as all the functions and properties of mathematical logic can be applied. This also helps a great deal in saving memory as the data is stored in Boolean form. Boolean answers to the auto generated questions asked by computer produces a path. The main advantage of this concept is, the data is highly secured as only the person who has the key matrix can understand the meaning of matrix. The data is normalized so the efficiency in the data retrieving is also increased. The computer puts an auto generated random set of questions each time when the data has to be retrieved, which results in formation of a hierarchical tree. Thus any malicious attempt to use the previously used key won't open the same lock and the attempt maker can be traced.
AB - The paper highlights a unique and secure way of retrieving data, where user can never identify the path followed by the system to reach the goal. The whole collection of data is represented in Boolean form which is stored in a matrix. This matrix can be used for quick retrieval of data as all the functions and properties of mathematical logic can be applied. This also helps a great deal in saving memory as the data is stored in Boolean form. Boolean answers to the auto generated questions asked by computer produces a path. The main advantage of this concept is, the data is highly secured as only the person who has the key matrix can understand the meaning of matrix. The data is normalized so the efficiency in the data retrieving is also increased. The computer puts an auto generated random set of questions each time when the data has to be retrieved, which results in formation of a hierarchical tree. Thus any malicious attempt to use the previously used key won't open the same lock and the attempt maker can be traced.
UR - http://www.scopus.com/inward/record.url?scp=84871348845&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84871348845&partnerID=8YFLogxK
U2 - 10.1007/978-81-322-0740-5_96
DO - 10.1007/978-81-322-0740-5_96
M3 - Conference contribution
AN - SCOPUS:84871348845
SN - 9788132207399
T3 - Advances in Intelligent Systems and Computing
SP - 807
EP - 812
BT - Proceedings of International Conference on Advances in Computing
PB - Springer Verlag
T2 - International Conference on Advances in Computing, ICAdC 2012
Y2 - 4 July 2012 through 6 July 2012
ER -