Skip to main content
SpringerLink
Log in

Trapdoor Security Lattice-Based Public-Key Searchable Encryption with a Designated Cloud Server

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Cloud storage technique has becoming increasingly significant in cloud service platform. Before choosing to outsource sensitive data to the cloud server, most of cloud users need to encrypt the important data ahead of time. Recently, the research on how to efficiently retrieve the encrypted data stored in the cloud server has become a hot research topic. Public-key searchable encryption, as a good candidate method, which enables a cloud server to search on a collection of encrypted data with a trapdoor from a receiver, has attracted more researchers’ attention. In this paper, we propose the frist efficient lattice-based public-key searchable encryption with a designated cloud server, which can resist quantum computers attack. In our scheme, we designate a unique cloud server to test and return the search results, thus can remove the secure channel between the cloud server and the receiver. We have proved that our scheme can achieve ciphertext indistinguishability under the hardness of learning with errors, and can achieve trapdoor security in the random oracle model. Moreover, our scheme is secure against off-line keyword guessing attacks from outside adversary.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. Boneh, D., Crescenzo, G. D., Ostrovsky, R., & Persiano, G. (2004). Public key encryption with keyword search. In Proceedings of advances in cryptology—Eurocrypt’04,LNCS 3027 (pp. 506–522).

  2. Baek, J., Safavi-Naini, R., & Susilo, W. (2006). Public key encryption with keyword search revisited. In Proceedings of ACIS’06, LNCS 5072 (pp. 1249–1259).

  3. Rhee, H. S., Park, J. H., Susilo, W., & Lee, D. H. (2010). Trapdoor security in a searchable public-key encryption scheme with a designated tester. Journal of Systems and Software, 83(5), 763–771.

    Article  Google Scholar 

  4. Rhee, H. S., Park, J. H., & Lee, D. H. (2012). Generic construction of designated tester public-key encryption with keyword search. Information Sciences, 205, 93–109.

    Article  MathSciNet  MATH  Google Scholar 

  5. Zhao, Y., Chen, X., Ma, H., Tang, Q., & Zhu, H. (2012). A new trapdoor-indistinguishable public key encryption with keyword search. Journal of Wireless Mobile Networks, Ubiquitous Computing, and Dependable Applications, 3(1/2), 72–81.

    Google Scholar 

  6. Wu, T. Y., Tsai, T. T., & Tseng, Y. M. (2014). Efficient searchable identity-based encryption with a designated server. Annales des Télécommunications, 69(7-8), 391–402.

    Article  Google Scholar 

  7. Shor, P. (1997). Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5), 1484–1509.

    Article  MathSciNet  MATH  Google Scholar 

  8. Ajtai, M. (1999). Generating hard instances of the short basis problem. In Proceedings of automata, languages and Programming ICALP 1999, LNCS 1644 (pp. 1–9). Prague: Springer.

  9. Regev, O. (2005). On lattices, learning with errors, random linear codes, and cryptography. In Proceedings of STOC’05, Baltimore, MD, USA (pp. 84–93).

  10. Gordon, S. D., Katz, J., & Vaikuntanathan, V. (2010). A group signature from lattice assumptions. In Proceedings of advances in cryptology—ASIACRYPT’10, LNCS 6477 (pp. 395–412). Singapore: Springer.

  11. Alwen, J., & Peikert, C. (1996). Generating shorter bases for hard random lattices. In Proceedings of the 20th annual ACM symposium on the theory of computing, STOC 1996, Philadelphia, Pennsylvania, USA (pp. 99–108).

  12. Gentry, C., Peikert, C., & Vaikuntanathan, V. (2008). Trapdoors for hard lattices and new cryptographic constructions. In Proceedings of the 40th annual ACM symposium on theory of computing, STOC 2008, Victoria, British Columbia, Canada, (pp. 197–206).

  13. Agrawal, S., Boneh, D., & Boyen, X. (2010). Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE. In Proceedings of advances in cryptology—CRYPTO 2010, LNCS (Vol. 6223, pp. 98–115). Springer.

  14. Cash, D., Hofheinz, D., Kiltz, E., & Peikert, C. (2010). Bonsai trees, or how to delegate a lattice basis. In Proceedings of advances in cryptology—EUROCRYPT 2010, LNCS (pp. 523–552). Springer.

Download references

Acknowledgements

This work is supported by the National Natural Science Foundation of China (No. 61370203) and China Postdoctoral Science Foundation Funded Project (No. 2017M623008) and Scientific Research Starting  Project of SWPU (No. 2017QHZ023).

Author information

Authors and Affiliations

  1. School of Computer Science, Southwest Petroleum University, Xindu Avenue, No. 8, Xindu Zone, Chengdu, 610500, China

    Xiaojun Zhang

  2. School of Computer Science and Engineering, University of Electronic Science and Technology of China, 2006 Xi Yuan Avenue, West High-Tech Zone, Chengdu, 611731, China

    Xiaojun Zhang & Chunxiang Xu

Authors
  1. Xiaojun Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chunxiang Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiaojun Zhang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, X., Xu, C. Trapdoor Security Lattice-Based Public-Key Searchable Encryption with a Designated Cloud Server. Wireless Pers Commun 100, 907–921 (2018). https://doi.org/10.1007/s11277-018-5357-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-018-5357-6

Keywords

Search

Navigation