Advertisement

Designs, Codes and Cryptography

, Volume 87, Issue 1, pp 123–147 | Cite as

Publicly verifiable searchable symmetric encryption based on efficient cryptographic components

  • Azam Soleimanian
  • Shahram Khazaei
Article
  • 195 Downloads

Abstract

Public verifiability is an interesting feature that cryptographic protocols, such as those used in cloud computing applications, may support. By public verifiability, the client can delegate the verification process to a third party auditor without revealing the private key or data. The main contribution of this paper is achieving public verifiability in the symmetric setting of searchable encryption (SE), separately for single and Boolean keyword search. While Public verifiability in SE has already been achieved using complex tools such as indistinguishability obfuscation or pairing, this work employs basic cryptographic components and assumptions, such as pseudo-random functions, one-way functions, digital signatures and the DDH assumption.

Keywords

Cloud computing Data confidentiality Searchable encryption Verifiability Multi party computation Boolean queries 

Mathematics Subject Classification

94A60 68P25 

References

  1. 1.
    Alderman J., Janson C., Martin K.M., Renwick S.L.: Extended functionality in verifiable searchable encryption. In: Cryptography and Information Security in the Balkans—Second International Conference, BalkanCryptSec, pp. 187–205. Koper (2015).Google Scholar
  2. 2.
    Ali M., Khan S.U., Vasilakos A.V.: Security in cloud computing: opportunities and challenges. Inf. Sci 305, 357–383 (2015).MathSciNetCrossRefGoogle Scholar
  3. 3.
    Azraoui M., Elkhiyaoui K., Önen M., Molva R.: Publicly verifiable conjunctive keyword search in outsourced databases. In: 2015 IEEE Conference on Communications and Network Security, CNS, pp. 619–627. Florence, Italy (2015).Google Scholar
  4. 4.
    Ballard L., Green M., de Medeiros B., Monrose F.: Correlation-resistant storage via keyword-searchable encryption. IACR Cryptol. ePrint Arch. 2005, 417 (2005).Google Scholar
  5. 5.
    Bost R., Fouque P., Pointcheval D.: Verifiable dynamic symmetric searchable encryption: optimality and forward security. IACR Cryptol. ePrint Arch. 2016, 62 (2016).Google Scholar
  6. 6.
    Cao N., Wang C., Li M., Ren K., Lou W.: Privacy-preserving multi-keyword ranked search over encrypted cloud data. IEEE Trans. Parallel Distrib. Syst. 25(1), 222–233 (2014).CrossRefGoogle Scholar
  7. 7.
    Cash D., Grubbs P., Perry J., Ristenpart, T.: Leakage-abuse attacks against searchable encryption. In: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, Denver, CO, USA, pp. 668–679 (2015).Google Scholar
  8. 8.
    Cash D., Jarecki S., Jutla C.S., Krawczyk H., Rosu M., Steiner M.: Highly-scalable searchable symmetric encryption with support for boolean queries. In: Advances in Cryptology—CRYPTO 2013—33rd Annual Cryptology Conference, Proceedings, Part I, pp. 353–373. Santa Barbara, CA (2013).Google Scholar
  9. 9.
    Chai Q., Gong G.: Verifiable symmetric searchable encryption for semi-honest-but-curious cloud servers. In: ICC 2012, Proceedings of IEEE International Conference on Communications, pp. 917–922. Ottawa, ON, Canada (2012)Google Scholar
  10. 10.
    Chang Y., Mitzenmacher M.: Privacy preserving keyword searches on remote encrypted data. In: Third International Conference on Applied Cryptography and Network Security, ACNS 2005, pp. 442–455. New York, NY, USA (2005)Google Scholar
  11. 11.
    Chase M., Kamara S.: Structured encryption and controlled disclosure. In: Advances in Cryptology—ASIACRYPT 2010—16th International Conference on the Theory and Application of Cryptology and Information Security, pp. 577–594. Singapore (2010).Google Scholar
  12. 12.
    Cheng R., Yan J., Guan C., Zhang F., Ren K.: Verifiable searchable symmetric encryption from indistinguishability obfuscation. In: ASIA CCS ’15, Proceedings of the 10th ACM Symposium on Information, Computer and Communications Security, pp. 621–626. Singapore (2015).Google Scholar
  13. 13.
    Curtmola R., Garay J.A., Kamara S., Ostrovsky R.: Searchable symmetric encryption: improved definitions and efficient constructions. In: CCS 2006, Proceedings of the 13th ACM Conference on Computer and Communications Security, pp. 79–88. Alexandria, VA, USA (2006).Google Scholar
  14. 14.
    Goh E.: Secure indexes. IACR Cryptol. ePrint Arch. 2003, 216 (2003).Google Scholar
  15. 15.
    Goldreich O., Ostrovsky R.: Software protection and simulation on oblivious rams. J. ACM 43(3), 431–473 (1996).MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Golle P., Staddon J., Waters B.R.: Secure conjunctive keyword search over encrypted data. In: ACNS 2004, Second International Conference on Applied Cryptography and Network Security, pp. 31–45. Yellow Mountain, China (2004).Google Scholar
  17. 17.
    Goyal V., Pandey O., Sahai A., Waters B.: Attribute-based encryption for fine-grained access control of encrypted data. In: CCS 2006, Proceedings of the 13th ACM Conference on Computer and Communications Security, pp. 89–98. Alexandria, VA, USA (2006).Google Scholar
  18. 18.
    Islam M.S., Kuzu M., Kantarcioglu M.: Access pattern disclosure on searchable encryption: Ramification, attack and mitigation. In: NDSS 2012, 19th Annual Network and Distributed System Security Symposium. San Diego, CA (2012)Google Scholar
  19. 19.
    Jiang X., Yu J., Yan J., Hao R.: Enabling efficient and verifiable multi-keyword ranked search over encrypted cloud data. Inf. Sci 403404, 2241 (2017).Google Scholar
  20. 20.
    Katz J., Lindell Y.: Introduction to Modern Cryptography. Chapman and Hall/CRC Press, Boca Raton (2007).CrossRefzbMATHGoogle Scholar
  21. 21.
    Kurosawa K., Ohtaki Y.: How to update documents verifiably in searchable symmetric encryption. In: CANS 2013, Cryptology and Network Security—12th International Conference, pp. 309–328. Paraty, Brazil (2013).Google Scholar
  22. 22.
    Kurosawa K., Ohtaki Y.: How to construct uc-secure searchable symmetric encryption scheme. IACR Cryptol. ePrint Arch. 2015, 251 (2015).Google Scholar
  23. 23.
    Liu C., Zhu L., Wang M., Tan Y.: Search pattern leakage in searchable encryption: attacks and new construction. Inf. Sci. 265, 176–188 (2014).CrossRefGoogle Scholar
  24. 24.
    Liu P., Wang J., Ma H., Nie H.: Efficient verifiable public key encryption with keyword search based on KP-ABE. In: BWCCA 2014, Ninth International Conference on Broadband and Wireless Computing, Communication and Applications, pp. 584–589. Guangdong, China (2014).Google Scholar
  25. 25.
    Manning C.D., Raghavan P., Schütze H.: Introduction to Information Retrieval. Cambridge University Press, Cambridge (2008).CrossRefzbMATHGoogle Scholar
  26. 26.
    Ogata W., Kurosawa K.: Efficient no-dictionary verifiable SSE. IACR Cryptol. ePrint Arch. 2016, 981 (2016).Google Scholar
  27. 27.
    Ostrovsky R.: Efficient computation on oblivious rams. In: Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pp. 514–523. Baltimore, Maryland, USA (1990).Google Scholar
  28. 28.
    Parno B., Raykova M., Vaikuntanathan V.: How to delegate and verify in public: verifiable computation from attribute-based encryption. In: TCC 2012, Theory of Cryptography—9th Theory of Cryptography Conference, pp. 422–439. Taormina, Sicily, Italy (2012).Google Scholar
  29. 29.
    Song D.X., Wagner D., Perrig A.: Practical techniques for searches on encrypted data. In: 2000 IEEE Symposium on Security and Privacy, pp. 44–55. Berkeley, CA, USA (2000).Google Scholar
  30. 30.
    Tang J., Cui Y., Li Q., Ren K., Liu J., Buyya R.: Ensuring security and privacy preservation for cloud data services. ACM Comput. Surv. 49(1), 13:1–13:39 (2016).CrossRefGoogle Scholar
  31. 31.
    Wan Z., Deng R.H.: Achieving verifiability for privacy-preserving multi-keyword search over encrypted cloud data. IEEE Trans. Depend. Sec. Comput. 2016, 1–12 (2016).Google Scholar
  32. 32.
    Wang Q., Wang C., Ren K., Lou W., Li J.: Enabling public auditability and data dynamics for storage security in cloud computing. IEEE Trans. Parallel Distrib. Syst. 22(5), 847–859 (2011).CrossRefGoogle Scholar
  33. 33.
    Waters B.: Ciphertext-policy attribute-based encryption: an expressive, efficient, and provably secure realization. In: Public Key Cryptography—PKC 2011—14th International Conference on Practice and Theory in Public Key Cryptography, pp. 53–70. Taormina, Italy (2011).Google Scholar
  34. 34.
    Xia Z., Wang X., Sun X., Wang Q.: A secure and dynamic multi-keyword ranked search scheme over encrypted cloud data. IEEE Trans. Parallel Distrib. Syst. 27(2), 340–352 (2016).CrossRefGoogle Scholar
  35. 35.
    Zhang R., Xue R., Yu T., Liu L.: PVSAE: A public verifiable searchable encryption service framework for outsourced encrypted data. In: ICWS 2016, IEEE International Conference on Web Services, pp. 428–435. San Francisco, CA, USA (2016).Google Scholar
  36. 36.
    Zhang Y., Katz J., Papamanthou C.: All your queries are belong to us: the power of file-injection attacks on searchable encryption. In: 25th USENIX Security Symposium, USENIX Security 16, pp. 707–720. Austin, TX, USA (2016).Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of Mathematics and Computer ScienceKharazmi UniversityTehranIran
  2. 2.Department of Mathematical SciencesSharif University of TechnologyTehranIran

Personalised recommendations