Towards asymmetric searchable encryption with message recovery and flexible search authorization

ASIA CCS 2013 - Proceedings of the 8th ACM SIGSAC Symposium on Information, Computer and Communications Security

Volumn , Issue , 2013, Pages 253-264

  Tang, Qiang ^a   Chen, Xiaofeng ^b  

^a UNIVERSITY OF LUXEMBOURG   (Luxembourg)

^b XIDIAN UNIVERSITY   (China)

Author keywords

cloud computing; data outsourcing; privacy; searchable encryption

Indexed keywords

DATA OUTSOURCING; ENABLING TECHNIQUES; ENCRYPTION TECHNIQUE; INDISTINGUISHABILITY; INFORMATION LEAKAGE; RANDOM ORACLE MODEL; SEARCHABLE ENCRYPTIONS; SECURITY PROPERTIES;

CLOUD COMPUTING; DATA PRIVACY; OUTSOURCING; PUBLIC KEY CRYPTOGRAPHY;

SECURITY OF DATA;

EID: 84877993743     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2484313.2484346     Document Type: Conference Paper

References (16)

1. J. Baek, R. Safavi-Naini, and W. Susilo. On the integration of public key data encryption and public key encryption with keyword search. In S. K. Katsikas et al., editor, Proceedings of the 9th international conference on Information Security, volume 4176 of LNCS, pages 217-232. Springer, 2006.
2. M. Bellare, A. Boldyreva, and A. O'Neill. Deterministic and efficiently searchable encryption. In Advances in cryptology - CRYPTO 2007, pages 535-552. Springer, 2007.
3. D. Boneh, X. Boyen, and H. Shacham. Short group signatures. In M. K. Franklin, editor, Advances in Cryptology - CRYPTO 2004, volume 3152 of LNCS, pages 41-55. Springer, 2004.
4. D. Boneh, G. Di Crescenzo, R. Ostrovsky, and G. Persiano. Public Key Encryption with Keyword Search. In C. Cachin and J. Camenisch, editors, Advances in Cryptology - EUROCRYPT 2004, volume 3027 of LNCS, pages 506-522. Springer, 2004.
5. D. Boneh and M. K. Franklin. Identity-based encryption from the weil pairing. In J. Kilian, editor, Advances in Cryptology - CRYPTO 2001, volume 2139 of LNCS, pages 213-229. Springer, 2001.
6. T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. In G. R. Blakley and D. Chaum, editors, Advances in Cryptology - CRYPTO 1984, volume 196 of LNCS, pages 10-18. Springer, 1985.
7. T. Fuhr and P. Paillier. Decryptable searchable encryption. In Proceedings of the 1st international conference on Provable security, pages 228-236, 2007.
8. D. Hofheinz and E. Weinreb. Correlation-resistant storage via keyword-searchable encryption. Cryptology ePrint Archive: Report 2008/423, 2008.
9. L. Ibraimi, S. Nikova, P. H. Hartel, and W. Jonker. Public-key encryption with delegated search. In J. Lopez and G. Tsudik, editors, Applied Cryptography and Network Security - 9th International Conference, volume 6715 of LNCS, pages 532-549, 2011.
10. K. Karabina, E. Knapp, and A. Menezes. Generalizations of verheul's theorem to asymmetric pairings. Technical Report CACR 2012-03, University of Waterloo, 2012.
11. V. Shoup. Sequences of games: a tool for taming complexity in security proofs. http://shoup.net/papers/, 2006.
12. D. X. Song, D. Wagner, and A. Perrig. Practical Techniques for Searches on Encrypted Data. In Proceedings of the 2000 IEEE Symposium on Security and Privacy, pages 44-55, 2000.
13. Q. Tang. Search in encrypted data: Theoretical models and practical applications. Cryptology ePrint Archive: Report 2012/648, 2012.
14. Q. Tang, Y. Zhao, X. Chen, and H. Ma. Refine the concept of public key encryption with delegated search. Cryptology ePrint Archive: Report 2012/654, 2012.
15. E. R. Verheul. Evidence that xtr is more secure than supersingular elliptic curve cryptosystems. J. Cryptol., 17(4):277-296, 2004.
16. R. Zhang and H. Imai. Generic combination of public key encryption with keyword search and public key encryption. In Proceedings of the 6th international conference on Cryptology and network security, pages 159-174. Springer, 2007.