Skip to main content
Log in

Integrity-verifiable conjunctive keyword searchable encryption in cloud storage

  • Special Issue Paper
  • Published:
International Journal of Information Security Aims and scope Submit manuscript

Abstract

Conjunctive searchable encryption is an efficient way to perform multi-keyword search over encrypted data in cloud storage. However, most existing methods do not take into account the integrity verification of the search result. Moreover, existing integrity verification methods can only verify the integrity of single-keyword search results, which cannot meet the requirements of conjunctive search. To address this problem, we proposed a conjunctive keyword searchable encryption scheme with an authentication mechanism that can efficiently verify the integrity of search results. The proposed scheme is based on the dynamic searchable symmetric encryption and adopts the Merkle tree and bilinear map accumulator to prove the correctness of set operations. It supports conjunctive keyword as input for conjunctive search and gives the server the ability to prove the integrity of the search result to the user. Formal proofs and extensive experiments show that the proposed scheme is efficient, unforgeable and adaptive secure against chosen-keyword attacks.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  1. Cachin, C., Keidar, I., Shraer, A.: Trusting the cloud. ACM Sigact News 40(2), 81–86 (2009)

    Article  Google Scholar 

  2. Kamara, S., Lauter, K.: Cryptographic cloud storage. Financ. Cryptogr. Data Secur. 6054, 136–149 (2010)

    Article  Google Scholar 

  3. Song, D.X., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data, security and privacy. In: Proceedings of 2000 IEEE Symposium on IEEE, pp. 44–55 (2000)

  4. Goh, E.J.: Secure indexes. In: IACR Cryptology ePrint Archive, p. 216 (2003)

  5. Chang, Y.C., Mitzenmacher, M.: Privacy preserving keyword searches on remote encrypted data. In: Ioannidis, J., Keromytis, A., Yung, M. (eds.) Applied Cryptography and Network Security. ACNS 2005. Lecture Notes in Computer Science, vol. 3531, pp. 442–455. Springer, Berlin, Heidelberg (2005). https://doi.org/10.1007/11496137_30

  6. Curtmola, R., Garay, J., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. In: Proceedings of the 13th ACM Conference on Computer and Communications Security, pp. 79–88, ACM (2006)

  7. Kamara, S., Papamanthou, C., Roeder, T.: Dynamic searchable symmetric encryption. In: Proceedings of the 2012 ACM Conference on Computer and Communications Securitypp, pp. 965–976, ACM (2012)

  8. Cash, D. Jaeger, J., Jarecki, S., Jutla, C., Krawczyk, H. Rosu, M.C., Steiner, M.: Dynamic searchable encryption in very large databases: data structures and implementation. In: Proceedings of NDSS (2014)

  9. Stefanov, E., Papamanthou, C., Shi, E.: Practical dynamic searchable encryption with small leakage. In: Proceedings of NDSS (2014)

  10. Golle, P., Staddon, J., Waters, B.: Secure conjunctive keyword search over encrypted data. In: Jakobsson, M., Yung, M., Zhou, J. (eds.) Applied Cryptography and Network Security. ACNS 2004. Lecture Notes in Computer Science, vol. 3089, pp. 31–45. Springer, Berlin, Heidelberg (2004). https://doi.org/10.1007/978-3-540-24852-1_3

  11. Kamara, S., Papamanthou, C., Roeder, T.: CS2: a searchable cryptographic cloud storage system. TechReport MSR-TR-2011-58, Microsoft Research (2011)

  12. Byun, J.W., Lee, D.H., Lim, J.: Efficient conjunctive keyword search on encrypted data storage system. In: Atzen, A.S., Lioy, A. (eds.) Public Key Infrastructure. EuroPKI 2006. Lecture Notes in Computer Science, vol. 4043, pp. 184–196. Springer, Berlin (2006). https://doi.org/10.1007/11774716

  13. 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)

    Article  Google Scholar 

  14. Ballard, L., Kamara, S., Monrose, F.: Achieving efficient conjunctive keyword searches over encrypted data. In: Qing, S., Mao, W., López, J., Wang, G. (eds.) Information and Communications Security. ICICS 2005. Lecture Notes in Computer Science, vol. 3783, pp. 414–426. Springer, Berlin (2005). https://doi.org/10.1007/11602897_35

  15. Kurosawa, K., Ohtaki, Y.: UC-Secure Searchable Symmetric Encryption, Financial Cryptography and Data Security, pp. 285–298. Springer, Berlin (2012)

  16. Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public key encryption with keyword search. In: Cachin, C., Camenisch, J.L. (eds.) Advances in Cryptology—EUROCRYPT 2004. Eurocrypt 2004. Lecture Notes in Computer Science, vol. 3027, pp. 506–522. Springer, Berlin (2004). https://doi.org/10.1007/978-3-540-24676-3_30

  17. Gentry, C.: Practical identity-based encryption without random oracles. In: Vaudenay, S. (ed.) Advances in Cryptology—EUROCRYPT 2006. Eurocrypt 2006. Lecture Notes in Computer Science, vol. 4004, pp. 445–464. Springer, Berlin (2006). https://doi.org/10.1007/11761679_27

  18. Baek, J., Safavi-Naini, R., Susilo, W.: Public Key Encryption with Keyword Search Revisited. In: Gervasi, O., Murgante, B., Laganà, A., Taniar, D., Mun, Y., Gavrilova, M.L. (eds.) Computational Science and Its Applications—ICCSA 2008. ICCSA 2008. Lecture Notes in Computer Science, vol. 5072, pp. 1249–1259. Springer, Berlin (2008). https://doi.org/10.1007/978-3-540-69839-5_96

  19. Katz, J., Lindell, Y.: Introduction to Modern Cryptography. CRC Press, Boca Raton (2014)

    MATH  Google Scholar 

  20. Merkle, R.C.: A Certified Digital Signature. In: Brassard, G. (ed.) Advances in Cryptology—CRYPTO’ 89 Proceedings. CRYPTO 1989. Lecture Notes in Computer Science, vol. 435, pp. 218–238. Springer, New York (1990). https://doi.org/10.1007/0-387-34805-0_21

  21. Papamanthou, C., Tamassia, R., Triandopoulos, N.: Optimal Verification of Operations on Dynamic Sets. In: Rogaway, P. (ed.) Advances in Cryptology—CRYPTO 2011. CRYPTO 2011. Lecture Notes in Computer Science, vol. 6841, pp. 91–110. Springer, Berlin (2011). https://doi.org/10.1007/978-3-642-22792-9_6

  22. Stefanov, E., Van Dijk, M., Shi, E. et al.: Path ORAM: an extremely simple oblivious RAM protocol. In: Proceedings of the 2013 ACM SIGSAC Conference on Computer Communications security, pp. 299–310 (2013)

Download references

Acknowledgements

This work was supported in part by the National Natural Science Foundation of China under Grant Nos. 61772127, 61472184 and 61321491, the National Science and Technology Major Project under Grant No. 2013ZX03002006, the Liaoning Province Science and Technology Projects under Grant No. 2013217004, the Liaoning Province Doctor Startup Fund under Grant No. 20141012, the Fundamental Research Funds for the Central Universities under Grant No. N130317002, the Shenyang Province Science and Technology Projects under Grant No. F14-231-1-08.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Fucai Zhou.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, Y., Zhou, F., Qin, Y. et al. Integrity-verifiable conjunctive keyword searchable encryption in cloud storage. Int. J. Inf. Secur. 17, 549–568 (2018). https://doi.org/10.1007/s10207-017-0394-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10207-017-0394-9

Keywords

Navigation