Skip to main content

Attribute-Based Keyword Search from Lattices

Part of the Lecture Notes in Computer Science book series (LNSC,volume 12020)

Abstract

Attribute-based keyword search (ABKS) is a special case of public key encryption with keyword search (PEKS) which allows fine-grained control of the search ability and can be further categorized into key-policy ABKS (KP-ABKS) and ciphertext-policy ABKS (CP-ABKS). In a KP-ABKS (resp., CP-ABKS) scheme, a trapdoor that is associated with an access policy f (resp., an attributes string \(\mathbf {x}\)) can only be used to search over ciphertexts that is associated with an attributes string \(\mathbf {x}\) (resp., an access policy f) if \(f(\mathbf {x})=0\). As ABKS is very useful in the era of big data, many researchers have been devoted to design ABKS schemes with different features, but almost all the known schemes are based on the traditional number-theoretical assumptions such as Factoring or Discrete Logarithm, and thus are insecure against quantum adversaries.

In this paper, we propose a lattice-based KP-ABKS scheme supporting circuit policy of any predetermined polynomial depth. Our scheme is provably secure against chosen keyword attacks and keyword guessing attacks under the DLWE and ISIS assumptions in the random oracle model. By using a universal circuit, our scheme can also be converted into a CP-ABKS scheme.

Keywords

  • Attribute-based encryption
  • keyword search
  • Lattice
  • Post-quantum secure

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-030-42921-8_4
  • Chapter length: 20 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   79.99
Price excludes VAT (USA)
  • ISBN: 978-3-030-42921-8
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   99.99
Price excludes VAT (USA)

References

  1. Agrawal, S., Boneh, D., Boyen, X.: Efficient lattice (h)ibe in the standard model. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 553–572. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-13190-5_28

    CrossRef  MATH  Google Scholar 

  2. Ajtai, M.: Generating hard instances of lattice problems. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 99–108. ACM (1996)

    Google Scholar 

  3. Ajtai, M.: Generating hard instances of the short basis problem. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 1–9. Springer, Heidelberg (1999). https://doi.org/10.1007/3-540-48523-6_1

    CrossRef  Google Scholar 

  4. Alwen, J., Peikert, C.: Generating shorter bases for hard random lattices. Theory Comput. Syst. 48(3), 535–553 (2011)

    MathSciNet  CrossRef  Google Scholar 

  5. Ameri, M.H., Delavar, M., Mohajeri, J., Salmasizadeh, M.: A key-policy attribute-based temporary keyword search scheme for secure cloud storage. IEEE Trans. Cloud Comput. (2018)

    Google Scholar 

  6. Behnia, R., Ozmen, M.O., Yavuz, A.A.: Lattice-based public key searchable encryption from experimental perspectives. IEEE Trans. Dependable Secure Comput. (2018)

    Google Scholar 

  7. Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public key encryption with keyword search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 506–522. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-24676-3_30

    CrossRef  Google Scholar 

  8. Boneh, D., et al.: Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 533–556. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-642-55220-5_30

    CrossRef  Google Scholar 

  9. Boneh, D., Waters, B.: Conjunctive, subset, and range queries on encrypted data. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 535–554. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-70936-7_29

    CrossRef  Google Scholar 

  10. Bösch, C., Hartel, P., Jonker, W., Peter, A.: A survey of provably secure searchable encryption. ACM Comput. Surv. (CSUR) 47(2), 18 (2015)

    Google Scholar 

  11. Boyen, X.: Attribute-based functional encryption on lattices. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 122–142. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-36594-2_8

    CrossRef  Google Scholar 

  12. Cash, D., Hofheinz, D., Kiltz, E., Peikert, C.: Bonsai trees, or how to delegate a lattice basis. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 523–552. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-13190-5_27

    CrossRef  Google Scholar 

  13. Cash, D., Jarecki, S., Jutla, C., Krawczyk, H., Roşu, M.-C., Steiner, M.: Highly-scalable searchable symmetric encryption with support for Boolean queries. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 353–373. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40041-4_20

    CrossRef  Google Scholar 

  14. Chen, R., Mu, Y., Yang, G., Guo, F., Wang, X.: Dual-server public-key encryption with keyword search for secure cloud storage. IEEE Trans. Inf. Forensics Secur. 11(4), 789–798 (2015)

    Google Scholar 

  15. Cui, H., Wan, Z., Deng, R.H., Wang, G., Li, Y.: Efficient and expressive keyword search over encrypted data in cloud. IEEE Trans. Dependable Secure Comput. 15(3), 409–422 (2016)

    CrossRef  Google Scholar 

  16. Dodis, Y., Ostrovsky, R., Reyzin, L., Smith, A.: Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. SIAM J. Comput. 38(1), 97–139 (2008)

    MathSciNet  CrossRef  Google Scholar 

  17. Fiat, A., Naor, M.: Broadcast encryption. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 480–491. Springer, Heidelberg (1994). https://doi.org/10.1007/3-540-48329-2_40

    CrossRef  Google Scholar 

  18. Fu, Z., Shu, J., Sun, X., Linge, N.: Smart cloud search services: verifiable keyword-based semantic search over encrypted cloud data. IEEE Trans. Consum. Electron. 60(4), 762–770 (2014)

    CrossRef  Google Scholar 

  19. Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, pp. 197–206. ACM (2008)

    Google Scholar 

  20. Goh, E.-J., et al.: Secure indexes. IACR Cryptology ePrint Archive, p. 216 (2003)

    Google Scholar 

  21. Golle, P., Staddon, J., Waters, B.: Secure conjunctive keyword search over encrypted data. In: Jakobsson, M., Yung, M., Zhou, J. (eds.) ACNS 2004. LNCS, vol. 3089, pp. 31–45. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-24852-1_3

    CrossRef  Google Scholar 

  22. Gorbunov, S., Vaikuntanathan, V., Wee, H.: Attribute-based encryption for circuits. J. ACM (JACM) 62(6), 45 (2015)

    MathSciNet  CrossRef  Google Scholar 

  23. Goyal, V., Pandey, O., Sahai, A., Waters, B.: Attribute-based encryption for fine-grained access control of encrypted data. In: Proceedings of the 13th ACM Conference on Computer and Communications Security, pp. 89–98. ACM (2006)

    Google Scholar 

  24. Hou, C., Liu, F., Bai, H., Ren, L.: Public-key encryption with keyword search from lattice. In: 2013 Eighth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing, pp. 336–339. IEEE (2013)

    Google Scholar 

  25. Hu, C., Han, L.: Efficient wildcard search over encrypted data. Int. J. Inf. Secur. 15(5), 539–547 (2016)

    CrossRef  Google Scholar 

  26. Huang, Q., Li, H.: An efficient public-key searchable encryption scheme secure against inside keyword guessing attacks. Inf. Sci. 403, 1–14 (2017)

    CrossRef  Google Scholar 

  27. Katz, J., Sahai, A., Waters, B.: Predicate Encryption supporting disjunctions, polynomial equations, and inner products. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 146–162. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-78967-3_9

    CrossRef  Google Scholar 

  28. Kuchta, V., Markowitch, O.: Multi-authority distributed attribute-based encryption with application to searchable encryption on lattices. In: Phan, R.C.-W., Yung, M. (eds.) Mycrypt 2016. LNCS, vol. 10311, pp. 409–435. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-61273-7_20

    CrossRef  Google Scholar 

  29. Li, H., Yang, Y., Luan, T.H., Liang, X., Zhou, L., Shen, X.S.: Enabling fine-grained multi-keyword search supporting classified sub-dictionaries over encrypted cloud data. IEEE Trans. Dependable Secure Comput. 13(3), 312–325 (2015)

    CrossRef  Google Scholar 

  30. Li, J., et al.: Searchable symmetric encryption with forward search privacy. IEEE Trans. Dependable Secure Comput. (2019)

    Google Scholar 

  31. Li, J., Shi, Y., Zhang, Y.: Searchable ciphertext-policy attribute-based encryption with revocation in cloud storage. Int. J. Commun. Syst. 30(1), e2942 (2017)

    CrossRef  Google Scholar 

  32. Liu, P., Wang, J., Ma, H., Nie, H.: Efficient verifiable public key encryption with keyword search based on KP-ABE. In: 2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications, pp. 584–589. IEEE (2014)

    Google Scholar 

  33. Liu, X., Yang, G., Mu, Y., Deng, R.: Multi-user verifiable searchable symmetric encryption for cloud storage. IEEE Trans. Dependable Secure Comput. (2018)

    Google Scholar 

  34. Liu, Z., Wang, Z., Cheng, X., Jia, C., Yuan, K.: Multi-user searchable encryption with coarser-grained access control in hybrid cloud. In: 2013 Fourth International Conference on Emerging Intelligent Data and Web Technologies, pp. 249–255. IEEE (2013)

    Google Scholar 

  35. Lu, Y., Wang, G., Li, J.: Keyword guessing attacks on a public key encryption with keyword search scheme without random oracle and its improvement. Inf. Sci. 479, 270–276 (2019)

    CrossRef  Google Scholar 

  36. Micciancio, D.: Lattice-based cryptography. In: van Tilborg, H.C.A., Jajodia, S. (eds.) Encyclopedia of Cryptography and Security, pp. 713–715. Springer, Boston (2011). https://doi.org/10.1007/978-1-4419-5906-5_417

    CrossRef  Google Scholar 

  37. Micciancio, D., Peikert, C.: Trapdoors for lattices: simpler, tighter, faster, smaller. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 700–718. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-29011-4_41

    CrossRef  Google Scholar 

  38. Peng, T., Liu, Q., Hu, B., Liu, J., Zhu, J.: Dynamic keyword search with hierarchical attributes in cloud computing. IEEE Access 6, 68948–68960 (2018)

    CrossRef  Google Scholar 

  39. Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM (JACM) 56(6), 34 (2009). Preliminary version in Proc. of STOC 2005

    MathSciNet  CrossRef  Google Scholar 

  40. Sahai, A., Waters, B.: Fuzzy identity-based encryption. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 457–473. Springer, Heidelberg (2005). https://doi.org/10.1007/11426639_27

    CrossRef  Google Scholar 

  41. Shen, J., Wang, C., Wang, A., Ji, S., Zhang, Y.: A searchable and verifiable data protection scheme for scholarly big data. IEEE Trans. Emerg. Topics Comput. (2018)

    Google Scholar 

  42. Song, X., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: 2000 IEEE Symposium on Security and Privacy, S&P, Proceedings, pp. 44–55. IEEE (2000)

    Google Scholar 

  43. Sun, W., Yu, S., Lou, W., Hou, Y.T., Li, H.: Protecting your right: attribute-based keyword search with fine-grained owner-enforced search authorization in the cloud. In: IEEE INFOCOM 2014-IEEE Conference on Computer Communications, pp. 226–234. IEEE (2014)

    Google Scholar 

  44. Sun, X.: Critical security issues in cloud computing: a survey. In: 2018 IEEE 4th International Conference on Big Data Security on Cloud (BigDataSecurity), IEEE International Conference on High Performance and Smart Computing, (HPSC) and IEEE International Conference on Intelligent Data and Security (IDS), pp. 216–221. IEEE (2018)

    Google Scholar 

  45. Wang, C., Li, W., Li, Y., Xu, X.: A ciphertext-policy attribute-based encryption scheme supporting keyword search function. In: Wang, G., Ray, I., Feng, D., Rajarajan, M. (eds.) CSS 2013. LNCS, vol. 8300, pp. 377–386. Springer, Cham (2013). https://doi.org/10.1007/978-3-319-03584-0_28

    CrossRef  Google Scholar 

  46. 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 (2015)

    CrossRef  Google Scholar 

  47. Xu, P., Jin, H., Wu, Q., Wang, W.: Public-key encryption with fuzzy keyword search: a provably secure scheme under keyword guessing attack. IEEE Trans. Comput. 62(11), 2266–2277 (2012)

    MathSciNet  CrossRef  Google Scholar 

  48. Yin, H., et al.: CP-ABSE: a ciphertext-policy attribute-based searchable encryption scheme. IEEE Access 7, 5682–5694 (2019)

    CrossRef  Google Scholar 

  49. Zhang, X., Tang, Y., Wang, H., Xu, C., Miao, Y., Cheng, H.: Lattice-based proxy-oriented identity-based encryption with keyword search for cloud storage. Inf. Sci. 494, 193–207 (2019)

    MathSciNet  CrossRef  Google Scholar 

  50. Zhang, X., Xu, C., Mu, L., Zhao, J.: Identity-based encryption with keyword search from lattice assumption. China Commun. 15(4), 164–178 (2018)

    CrossRef  Google Scholar 

  51. Zhang, X., Xu, C., Wang, H., Zhang, Y., Wang, S.: FS-PEKS: lattice-based forward secure public-key encryption with keyword search for cloud-assisted industrial internet of things. IEEE Trans. Dependable Secure Comput. (2019)

    Google Scholar 

  52. Zheng, Q., Xu, S., Ateniese, G.: Vabks: verifiable attribute-based keyword search over outsourced encrypted data. In: IEEE INFOCOM 2014-IEEE Conference on Computer Communications, pp. 522–530. IEEE (2014)

    Google Scholar 

  53. Zhou, R., Zhang, X., Du, X., Wang, X., Yang, G., Guizani, M.: File-centric multi-key aggregate keyword searchable encryption for industrial internet of things. IEEE Trans. Ind. Inf. 14(8), 3648–3658 (2018)

    CrossRef  Google Scholar 

Download references

Acknowledgments

We thank the anonymous Inscrypt’2019 reviewers for their helpful comments. This work was supported by the National Natural Science Foundation of China (Grant Nos. 61902111, 61672030, 61602046, 61932019), the National Key Research and Development Program of China (Grant Nos. 2017YFB0802005, 2018YFB0804105), and the Young Elite Scientists Sponsorship Program by CAST (Grant No. 2016QNRC001).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jie Li .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Verify currency and authenticity via CrossMark

Cite this paper

Li, J., Ma, M., Zhang, J., Fan, S., Li, S. (2020). Attribute-Based Keyword Search from Lattices. In: Liu, Z., Yung, M. (eds) Information Security and Cryptology. Inscrypt 2019. Lecture Notes in Computer Science(), vol 12020. Springer, Cham. https://doi.org/10.1007/978-3-030-42921-8_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-42921-8_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-42920-1

  • Online ISBN: 978-3-030-42921-8

  • eBook Packages: Computer ScienceComputer Science (R0)