Skip to main content
Springer Nature Link
Log in

Unbounded ABE for Circuits from LWE, Revisited

  • Conference paper
  • First Online:
Advances in Cryptology – ASIACRYPT 2024 (ASIACRYPT 2024)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 15487))

  • 244 Accesses

Abstract

We introduce new lattice-based techniques for building ABE for circuits with unbounded attribute length based on the LWE assumption, improving upon the previous constructions of Brakerski and Vaikuntanathan (CRYPTO 16) and Goyal, Koppula, and Waters (TCC 16). Our main result is a simple and more efficient unbounded ABE scheme for circuits where only the circuit depth is fixed at set-up; this is the first unbounded ABE scheme for circuits that rely only on black-box access to cryptographic and lattice algorithms. The scheme achieves semi-adaptive security against unbounded collusions under the LWE assumption. The encryption time and ciphertext size are roughly \(3 \times \) larger than the prior bounded ABE of Boneh et al. (EUROCRYPT 2014), substantially improving upon the encryption times in prior works. As a secondary contribution, we present an analogous result for unbounded inner product predicate encryption that satisfies weak attribute-hiding.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    We can also adapt the construction to support non-prime moduli using techniques from [MP12].

  2. 2.

    Similar argument shows that \(\textbf{c}_5\) is also pseudorandom.

References

  1. hweta Agrawal, Dan Boneh, and Xavier Boyen. Efficient lattice (H)IBE in the standard model. In Henri Gilbert, editor, EUROCRYPT 2010, volume 6110 of LNCS, pages 553–572. Springer, Heidelberg, May / June 2010.

    Chapter  Google Scholar 

  2. Shweta Agrawal, David Mandell Freeman, and Vinod Vaikuntanathan. Functional encryption for inner product predicates from learning with errors. In Dong Hoon Lee and Xiaoyun Wang, editors, ASIACRYPT 2011, volume 7073 of LNCS, pages 21–40. Springer, Heidelberg, December 2011.

    Chapter  Google Scholar 

  3. Shweta Agrawal. Stronger security for reusable garbled circuits, general definitions and attacks. In Jonathan Katz and Hovav Shacham, editors, CRYPTO 2017, Part I, volume 10401 of LNCS, pages 3–35. Springer, Heidelberg, 2017.

    Chapter  Google Scholar 

  4. Miklós Ajtai. Generating hard instances of lattice problems (extended abstract). In 28th ACM STOC, pages 99–108. ACM Press, May 1996.

    Google Scholar 

  5. Nuttapong Attrapadung. Dual system encryption via doubly selective security: Framework, fully secure functional encryption for regular languages, and more. In Phong Q. Nguyen and Elisabeth Oswald, editors, EUROCRYPT 2014, volume 8441 of LNCS, pages 557–577. Springer, Heidelberg, 2014.

    Chapter  Google Scholar 

  6. Nuttapong Attrapadung. Dual system encryption framework in primeorder groups via computational pair encodings. In Jung Hee Cheon and Tsuyoshi Takagi, editors, ASIACRYPT 2016, Part II, volume 10032 of LNCS, pages 591–623. Springer, Heidelberg, December 2016.

    Google Scholar 

  7. Zvika Brakerski, David Cash, Rotem Tsabary, and Hoeteck Wee. Targeted homomorphic attribute-based encryption. In Martin Hirt and Adam D. Smith, editors, TCC 2016-B, Part II, volume 9986 of LNCS, pages 330–360. Springer, Heidelberg, October / November 2016.

    Chapter  Google Scholar 

  8. Dan Boneh, Craig Gentry, Sergey Gorbunov, Shai Halevi, Valeria Nikolaenko, Gil Segev, Vinod Vaikuntanathan, and Dhinakaran Vinayagamurthy. Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits. In Phong Q. Nguyen and Elisabeth Oswald, editors, EUROCRYPT 2014, volume 8441 of LNCS, pages 533–556. Springer, Heidelberg, 2014.

    Google Scholar 

  9. Zvika Brakerski and Vinod Vaikuntanathan. Circuit-ABE from LWE: Unbounded attributes and semi-adaptive security. In Matthew Robshaw and Jonathan Katz, editors, CRYPTO 2016, Part III, volume 9816 of LNCS, pages 363–384. Springer, Heidelberg, 2016.

    Chapter  Google Scholar 

  10. Jie Chen, Junqing Gong, Lucas Kowalczyk, and Hoeteck Wee. Unbounded ABE via bilinear entropy expansion, revisited. In Jesper Buus Nielsen and Vincent Rijmen, editors, EUROCRYPT 2018, Part I, volume 10820 of LNCS, pages 503–534. Springer, Heidelberg, April / May 2018.

    Chapter  Google Scholar 

  11. David Cash, Dennis Hofheinz, Eike Kiltz, and Chris Peikert. Bonsai trees, or how to delegate a lattice basis. In Henri Gilbert, editor, EUROCRYPT 2010, volume 6110 of LNCS, pages 523–552. Springer, Heidelberg, May / June 2010.

    Chapter  Google Scholar 

  12. Jie Chen and Hoeteck Wee. Semi-adaptive attribute-based encryption and improved delegation for Boolean formula. In Michel Abdalla and Roberto De Prisco, editors, SCN 14, volume 8642 of LNCS, pages 277– 297. Springer, Heidelberg, 2014.

    Chapter  Google Scholar 

  13. Yevgeniy Dodis, Leonid Reyzin, and Adam Smith. Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. In Christian Cachin and Jan Camenisch, editors, EUROCRYPT 2004, volume 3027 of LNCS, pages 523–540. Springer, Heidelberg, 2004.

    Chapter  Google Scholar 

  14. Rishab Goyal, Venkata Koppula, and BrentWaters. Semi-adaptive security and bundling functionalities made generic and easy. In Martin Hirt and Adam D. Smith, editors, TCC 2016-B, Part II, volume 9986 of LNCS, pages 361–388. Springer, Heidelberg, October / November 2016.

    Chapter  Google Scholar 

  15. Vipul Goyal, Omkant Pandey, Amit Sahai, and Brent Waters. Attributebased encryption for fine-grained access control of encrypted data. In Ari Juels, Rebecca N. Wright, and Sabrina De Capitani di Vimercati, editors, ACM CCS 2006, pages 89–98. ACM Press, October / November 2006. Available as Cryptology ePrint Archive Report 2006/309.

    Google Scholar 

  16. Craig Gentry, Chris Peikert, and Vinod Vaikuntanathan. Trapdoors for hard lattices and new cryptographic constructions. In Richard E. Ladner and Cynthia Dwork, editors, 40th ACM STOC, pages 197–206. ACM Press, May 2008.

    Google Scholar 

  17. Craig Gentry, Amit Sahai, and Brent Waters. Homomorphic encryption from learning with errors: Conceptually-simpler, asymptoticallyfaster, attribute-based. In Ran Canetti and Juan A. Garay, editors, CRYPTO 2013, Part I, volume 8042 of LNCS, pages 75–92. Springer, Heidelberg, 2013.

    Chapter  Google Scholar 

  18. Sergey Gorbunov, Vinod Vaikuntanathan, and Hoeteck Wee. Attributebased encryption for circuits. In Dan Boneh, Tim Roughgarden, and Joan Feigenbaum, editors, 45th ACM STOC, pages 545–554. ACM Press, June 2013.

    Google Scholar 

  19. Johan Håstad, Russell Impagliazzo, Leonid A. Levin, and Michael Luby. A pseudorandom generator from any one-way function. SIAM Journal on Computing, 28(4):1364–1396, 1999.

    Article  MathSciNet  Google Scholar 

  20. Lucas Kowalczyk and Allison Bishop Lewko. Bilinear entropy expansion from the decisional linear assumption. In Rosario Gennaro and Matthew J. B. Robshaw, editors, CRYPTO 2015, Part II, volume 9216 of LNCS, pages 524–541. Springer, Heidelberg, August 2015.

    Chapter  Google Scholar 

  21. Jonathan Katz, Amit Sahai, and Brent Waters. Predicate encryption supporting disjunctions, polynomial equations, and inner products. In Nigel P. Smart, editor, EUROCRYPT 2008, volume 4965 of LNCS, pages 146–162. Springer, Heidelberg, 2008.

    Chapter  Google Scholar 

  22. Allison B. Lewko. Tools for simulating features of composite order bilinear groups in the prime order setting. In David Pointcheval and Thomas Johansson, editors, EUROCRYPT 2012, volume 7237 of LNCS, pages 318– 335. Springer, Heidelberg, 2012.

    Chapter  Google Scholar 

  23. Allison B. Lewko and BrentWaters. Unbounded HIBE and attribute-based encryption. In Kenneth G. Paterson, editor, EUROCRYPT 2011, volume 6632 of LNCS, pages 547–567. Springer, Heidelberg, 2011.

    Chapter  Google Scholar 

  24. Daniele Micciancio and Chris Peikert. Trapdoors for lattices: Simpler, tighter, faster, smaller. In David Pointcheval and Thomas Johansson, editors, EUROCRYPT 2012, volume 7237 of LNCS, pages 700–718. Springer, Heidelberg, 2012.

    Chapter  Google Scholar 

  25. Tatsuaki Okamoto and Katsuyuki Takashima. Fully secure unbounded inner-product and attribute-based encryption. In XiaoyunWang and Kazue Sako, editors, ASIACRYPT 2012, volume 7658 of LNCS, pages 349–366. Springer, Heidelberg, December 2012.

    Chapter  Google Scholar 

  26. Yannis Rouselakis and Brent Waters. Practical constructions and new proof methods for large universe attribute-based encryption. In Ahmad- Reza Sadeghi, Virgil D. Gligor, and Moti Yung, editors, ACM CCS 2013, pages 463–474. ACM Press, November 2013.

    Google Scholar 

  27. Amit Sahai and Brent R. Waters. Fuzzy identity-based encryption. In Ronald Cramer, editor, EUROCRYPT 2005, volume 3494 of LNCS, pages 457–473. Springer, Heidelberg, 2005.

    Chapter  Google Scholar 

  28. Tanya Verma. Inside geo key manager v2: re-imagining access control for distributed systems.https://blog.cloudflare.com/inside-geo-key-managerv2/, 2023.

  29. Shota Yamada. Adaptively secure identity-based encryption from lattices with asymptotically shorter public parameters. In Marc Fischlin and Jean- Sébastien Coron, editors, EUROCRYPT 2016, Part II, volume 9666 of LNCS, pages 32–62. Springer, Heidelberg, May 2016.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. NTT Research, Sunnyvale, CA, USA

    Valerio Cini & Hoeteck Wee

Authors
  1. Valerio Cini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hoeteck Wee
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Valerio Cini .

Editor information

Editors and Affiliations

  1. Academia Sinica, Taipei, Taiwan

    Kai-Min Chung

  2. NTT Social Informatics Laboratories, Tokyo, Japan

    Yu Sasaki

Rights and permissions

Reprints and permissions

Copyright information

© 2025 International Association for Cryptologic Research

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Cini, V., Wee, H. (2025). Unbounded ABE for Circuits from LWE, Revisited. In: Chung, KM., Sasaki, Y. (eds) Advances in Cryptology – ASIACRYPT 2024. ASIACRYPT 2024. Lecture Notes in Computer Science, vol 15487. Springer, Singapore. https://doi.org/10.1007/978-981-96-0894-2_8

Download citation

  • DOI: https://doi.org/10.1007/978-981-96-0894-2_8

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-96-0893-5

  • Online ISBN: 978-981-96-0894-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics