Open Access Open Access  Restricted Access Subscription Access

Preserving Data Privacy with Record Retrieval using Visual Cryptography and Encryption Techniques


Affiliations
1 Faculty of Computer Science and Engineering, Sathyabama University, Chennai - 600119, Tamil Nadu, India
2 Department of Computer Science and Engineering, Meenakshi College of Engineering, Chennai - 600078, Tamil Nadu, India
 

Objectives: Secure data sharing using visual cryptography with selective retrieval upon key match is introduced in this paper. As an illustration, medical and student database is considered. Methods/Analysis: The original database is stored as relational database model. In shared data applications encryption is used to achieve privacy of sensitive (personal) data from unauthorized users. The work includes encryption, selective retrieval, retrieving records with matching markers, etc. The proposed system search records from queries in the encrypted domain itself. Findings: All application related operations like checking for some threshold value, searching for similar records across different users, etc. is included. Because of proposed system any leakage of information over retrieved set of documents is avoided. Existing searching algorithm requires O (n) comparisons (searching operations) at the server to evaluate if the database contains a chosen keyword. The communication overhead minimized between the user and server. The computation is minimized between server and user. It allows the multi-user to search over the encrypted data. Searching time is minimized by relational database management. From encrypted query server cannot, distinguish between documents, determine document contents, check for search keyword and extend beyond decrypted result. Novelty/Improvement: The algorithm is novel in the sense that uncorrelatedness among the different user's data is preserved, along with complete sharing.

Keywords

Encryption, Data Privacy, Decryption, Record Retrieval, Visual Cryptography.
User

Abstract Views: 155

PDF Views: 0




  • Preserving Data Privacy with Record Retrieval using Visual Cryptography and Encryption Techniques

Abstract Views: 155  |  PDF Views: 0

Authors

Hare Ram Sah
Faculty of Computer Science and Engineering, Sathyabama University, Chennai - 600119, Tamil Nadu, India
G. Gunasekaran
Department of Computer Science and Engineering, Meenakshi College of Engineering, Chennai - 600078, Tamil Nadu, India

Abstract


Objectives: Secure data sharing using visual cryptography with selective retrieval upon key match is introduced in this paper. As an illustration, medical and student database is considered. Methods/Analysis: The original database is stored as relational database model. In shared data applications encryption is used to achieve privacy of sensitive (personal) data from unauthorized users. The work includes encryption, selective retrieval, retrieving records with matching markers, etc. The proposed system search records from queries in the encrypted domain itself. Findings: All application related operations like checking for some threshold value, searching for similar records across different users, etc. is included. Because of proposed system any leakage of information over retrieved set of documents is avoided. Existing searching algorithm requires O (n) comparisons (searching operations) at the server to evaluate if the database contains a chosen keyword. The communication overhead minimized between the user and server. The computation is minimized between server and user. It allows the multi-user to search over the encrypted data. Searching time is minimized by relational database management. From encrypted query server cannot, distinguish between documents, determine document contents, check for search keyword and extend beyond decrypted result. Novelty/Improvement: The algorithm is novel in the sense that uncorrelatedness among the different user's data is preserved, along with complete sharing.

Keywords


Encryption, Data Privacy, Decryption, Record Retrieval, Visual Cryptography.



DOI: https://doi.org/10.17485/ijst%2F2016%2Fv9i32%2F129032