Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Quantum Key Leasing for PKE and FHE with a Classical Lessor (2310.14328v4)

Published 22 Oct 2023 in cs.CR and quant-ph

Abstract: In this work, we consider the problem of secure key leasing, also known as revocable cryptography (Agarwal et. al. Eurocrypt' 23, Ananth et. al. TCC' 23), as a strengthened security notion of its predecessor put forward in Ananth et. al. Eurocrypt' 21. This problem aims to leverage unclonable nature of quantum information to allow a lessor to lease a quantum key with reusability for evaluating a classical functionality. Later, the lessor can request the lessee to provably delete the key and then the lessee will be completely deprived of the capability to evaluate. In this work, we construct a secure key leasing scheme to lease a decryption key of a (classical) public-key, homomorphic encryption scheme from standard lattice assumptions. We achieve strong form of security where: * The entire protocol uses only classical communication between a classical lessor (client) and a quantum lessee (server). * Assuming standard assumptions, our security definition ensures that every computationally bounded quantum adversary could not simultaneously provide a valid classical deletion certificate and yet distinguish ciphertexts. Our security relies on the hardness of learning with errors assumption. Our scheme is the first scheme to be based on a standard assumption and satisfying the two properties above.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (46)
  1. Scott Aaronson. Limitations of quantum advice and one-way communication. In Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004., pages 320–332. IEEE, 2004.
  2. Scott Aaronson. Quantum copy-protection and quantum money. In 2009 24th Annual IEEE Conference on Computational Complexity, pages 229–242. IEEE, 2009.
  3. Scott Aaronson. Shadow tomography of quantum states. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, pages 325–338, 2018.
  4. On quantum obfuscation. arXiv preprint arXiv:1602.01771, 2016.
  5. Unclonable encryption, revisited. In Theory of Cryptography Conference, pages 299–329. Springer, 2021.
  6. On the feasibility of unclonable encryption, and more. In Annual International Cryptology Conference, pages 212–241. Springer, 2022.
  7. Public key encryption with secure key leasing. In Annual International Conference on the Theory and Applications of Cryptographic Techniques, pages 581–610. Springer, 2023.
  8. New approaches for quantum copy-protection, 2020.
  9. Prabhanjan Ananth and Rolando L. La Placa. Secure software leasing. EUROCRYPT, 2021.
  10. Revocable cryptography from learning with errors. In Guy Rothblum and Hoeteck Wee, editors, Theory of Cryptography, pages 93–122, Cham, 2023. Springer Nature Switzerland.
  11. Constructive post-quantum reductions. In Annual International Cryptology Conference, pages 654–683. Springer, 2022.
  12. A cryptographic test of quantumness and certifiable randomness from a single quantum device. Journal of the ACM (JACM), 68(5):1–47, 2021.
  13. Obfuscation and outsourced computation with certified deletion. Cryptology ePrint Archive, 2023.
  14. Quantum encryption with certified deletion. In Theory of Cryptography: 18th International Conference, TCC 2020, Durham, NC, USA, November 16–19, 2020, Proceedings, Part III 18, pages 92–122. Springer, 2020.
  15. Secure software leasing without assumptions. In Theory of Cryptography Conference, pages 90–120. Springer, 2021.
  16. Cryptography with certified deletion. In Annual International Cryptology Conference, pages 192–223. Springer, 2023.
  17. Uncloneable quantum encryption via random oracles. IACR Cryptology ePrint Archive, 2019:257, 2019.
  18. Efficient fully homomorphic encryption from (standard) LWE. In Rafail Ostrovsky, editor, 52nd FOCS, pages 97–106. IEEE Computer Society Press, October 2011.
  19. Classical verification of quantum computations with efficient verifier. In Theory of Cryptography Conference, pages 181–206. Springer, 2020.
  20. Unbounded leakage-resilience and leakage-detection in a quantum world. IACR Cryptol. ePrint Arch., page 410, 2023.
  21. Semi-quantum copy-protection and more. Cryptology ePrint Archive, 2023.
  22. Hidden cosets and applications to unclonable cryptography. In Advances in Cryptology–CRYPTO 2021: 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16–20, 2021, Proceedings, Part I 41, pages 556–584. Springer, 2021.
  23. Quantum copy-protection of compute-and-compare programs in the quantum random oracle model, 2020.
  24. Post-quantum succinct arguments: breaking the quantum rewinding barrier. In 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pages 49–58. IEEE, 2022.
  25. Public-key encryption schemes with auxiliary inputs. In Theory of Cryptography: 7th Theory of Cryptography Conference, TCC 2010, Zurich, Switzerland, February 9-11, 2010. Proceedings 7, pages 361–381. Springer, 2010.
  26. Quantum digital signatures. arXiv preprint quant-ph/0105032, 2001.
  27. Craig Gentry. Toward basing fully homomorphic encryption on worst-case hardness. In Tal Rabin, editor, CRYPTO 2010, volume 6223 of LNCS, pages 116–137. Springer, Heidelberg, August 2010.
  28. Trapdoors for hard lattices and new cryptographic constructions. Cryptology ePrint Archive, Report 2007/432, 2007. https://eprint.iacr.org/2007/432.
  29. Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based. In Ran Canetti and Juan A. Garay, editors, CRYPTO 2013, Part I, volume 8042 of LNCS, pages 75–92. Springer, Heidelberg, August 2013.
  30. Quantum encryption with certified deletion, revisited: Public key, attribute-based, and classical communication. In Advances in Cryptology–ASIACRYPT 2021: 27th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, December 6–10, 2021, Proceedings, Part I 27, pages 606–636. Springer, 2021.
  31. Secure software leasing from standard assumptions. In Theory of Cryptography Conference, pages 31–61. Springer, 2021.
  32. Collusion resistant copy-protection for watermarkable functionalities. In Theory of Cryptography Conference, pages 294–323. Springer, 2022.
  33. Urmila Mahadev. Classical verification of quantum computations. In 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pages 259–267. IEEE, 2018.
  34. 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, April 2012.
  35. Hardness of SIS and LWE with small parameters. In Ran Canetti and Juan A. Garay, editors, CRYPTO 2013, Part I, volume 8042 of LNCS, pages 21–39. Springer, Heidelberg, August 2013.
  36. Quantum arthur–merlin games. computational complexity, 14(2):122–152, 2005.
  37. Quantum computation and quantum information, 2002.
  38. Alexander Poremba. Quantum proofs of deletion for learning with errors. arXiv preprint arXiv:2203.01610, 2022.
  39. Oded Regev. On lattices, learning with errors, random linear codes, and cryptography. In STOC, pages 84–93, 2005.
  40. Oded Regev. On lattices, learning with errors, random linear codes, and cryptography. In Harold N. Gabow and Ronald Fagin, editors, 37th ACM STOC, pages 84–93. ACM Press, May 2005.
  41. Roy Radian and Or Sattath. Semi-quantum money. In Proceedings of the 1st ACM Conference on Advances in Financial Technologies, AFT ’19, page 132–146. Association for Computing Machinery, 2019.
  42. Omri Shmueli. Public-key quantum money with a classical bank. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, pages 790–803, 2022.
  43. Quantum search-to-decision reduction for the lwe problem. Cryptology ePrint Archive, 2023.
  44. Vinod Vaikunthananthan. Cs 294 lecture 4: Worst-case to average-case reductions for lwe. Class at UC Berkeley, 2020. http://people.csail.mit.edu/vinodv/CS294/lecture6.pdf.
  45. Stephen Wiesner. Conjugate coding. ACM Sigact News, 15(1):78–88, 1983.
  46. Mark Zhandry. Schrödinger’s pirate: How to trace a quantum decoder. In Rafael Pass and Krzysztof Pietrzak, editors, Theory of Cryptography, pages 61–91, Cham, 2020. Springer International Publishing.
Citations (4)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now