Author : Amarja Jagtap-Patil 1
Date of Publication :7th April 2016
Abstract: Encryption is well established technology for protecting sensitive data. Multiparty Searchable Encryption is a scheme in which multiple users store and share their data with each other. The scheme consists of two entities: A server and set of users. Achieving multi-party searching is challenging as existing schemes are not achieving the secure searchable encryption due to the key sharing between set of users. Also it is not forming scalable solution for multi-party searching and settings, where users outsource their encrypted data to particular cloud server and selectively authorize each other to search. There can be a possibility that the cloud server may collude with some harmful users, it is a challenge to have a more secure and scalable multiparty searchable encryption (MPSE) scheme. This is shown by analysis on the Popa–Zeldovich scheme, which says that an honest user may leak all search patterns even if user shares only one of the documents with any unknown malicious user. Based on these analysis, system present a new security model for MPSE by considering the scenarios from best case to worst case, which capture different server user collusion possibilities. System then try to propose a MPSE scheme by employing the property linearity of Type-3 pairings and prove its security based on the bilinear Diffie–Hellman variant assumption in the oracle model. Moreover, the evaluations show the speed of proposed scheme compared with the old MPSE scheme with respect to searching and encryption/decryption.
Reference :
-
- R. Curtmola, J. Garay, S. Kamara, and R. Ostrovsky. Searchable symmetric encryption: improved definiti- ons and efficient constructions. In Proceedings of the 13th ACM conference on Computer and Communications Security,pages 7988. ACM, 2006.
- A. Popa and N. Zeldovich. Multi-key encryption. http://eprint.iacr.org/2013/508,2013.
- C. Bsch, Q. Tang, P. Hartel, and W. Jonker, Selective document retrieval from encrypted database, in Proc. 15th Inf. Security Conf. (ISC), vol. 7483. 2012, pp. 224241.
- M. Kuzu, M. S. Islam, and M. Kantarcioglu, Efficient similarity search over en-crypted data, in Proc. IEEE 28th Int. Conf. Data Eng. ,Apr. 2012, pp. 11561167.
- C. Dong, G. Russello, and N. Dulay. Shared and searchable encrypted data for untrusted servers. In V. Atluri, editor, Data and Applications Security XXII, 22nd Annual IFIP WG 11.3 Working Conference on Data and Applications Security, volume 5094 of LNCS, pages 127– 143. Springer, 2008.
- D. X. Song, D. Wagner, and A. Perrig. Practical Techniques for Searches on Encrypted Data. In IEEE Symposium on Security and Privacy, pages 44–55. IEEE Computer Society, 2000.
- Q. Tang. Privacy preserving mapping schemes supporting comparison. In Proceedings of the 2010 ACM 2010.
- Q. Tang. Theory and Practice of Cryptography Solutions for Secure Information Systems, chapter Search in Encrypted Data: Theoretical Models and Practical Applications, pages 84–108. IGI, 2013.