Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
47 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Simultaneous Haar Indistinguishability with Applications to Unclonable Cryptography (2405.10274v1)

Published 16 May 2024 in quant-ph and cs.CR

Abstract: Unclonable cryptography is concerned with leveraging the no-cloning principle to build cryptographic primitives that are otherwise impossible to achieve classically. Understanding the feasibility of unclonable encryption, one of the key unclonable primitives, satisfying indistinguishability security in the plain model has been a major open question in the area. So far, the existing constructions of unclonable encryption are either in the quantum random oracle model or are based on new conjectures. We present a new approach to unclonable encryption via a reduction to a novel question about nonlocal quantum state discrimination: how well can non-communicating -- but entangled -- players distinguish between different distributions over quantum states? We call this task simultaneous state indistinguishability. Our main technical result is showing that the players cannot distinguish between each player receiving independently-chosen Haar random states versus all players receiving the same Haar random state. We leverage this result to present the first construction of unclonable encryption satisfying indistinguishability security, with quantum decryption keys, in the plain model. We also show other implications to single-decryptor encryption and leakage-resilient secret sharing.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (54)
  1. Scott Aaronson. Quantum copy-protection and quantum money. In 2009 24th Annual IEEE Conference on Computational Complexity, pages 229–242. IEEE, 2009.
  2. A modular approach to unclonable cryptography. arXiv preprint arXiv:2311.11890, 2023.
  3. A quantum goldreich-levin theorem with cryptographic applications. In Helmut Alt and Afonso Ferreira, editors, STACS 2002, pages 323–334, Berlin, Heidelberg, 2002. Springer Berlin Heidelberg.
  4. Stronger leakage-resilient and non-malleable secret sharing schemes for general access structures. In Advances in Cryptology–CRYPTO 2019: 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18–22, 2019, Proceedings, Part II 39, pages 510–539. Springer, 2019.
  5. Unclonable encryption, revisited. In Theory of Cryptography Conference, pages 299–329. Springer, 2021.
  6. On the feasibility of unclonable encryption, and more. In Yevgeniy Dodis and Thomas Shrimpton, editors, Advances in Cryptology – CRYPTO 2022, pages 212–241, Cham, 2022. Springer Nature Switzerland.
  7. Cloning games: A general framework for unclonable primitives. In CRYPTO, 2023.
  8. Secure software leasing. In Anne Canteaut and François-Xavier Standaert, editors, Advances in Cryptology – EUROCRYPT 2021, pages 501–530, Cham, 2021. Springer International Publishing.
  9. Teleporting an unknown quantum state via dual classical and einstein-podolsky-rosen channels. Physical review letters, 70(13):1895, 1993.
  10. Quantum nonlocality without entanglement. Physical Review A, 59(2):1070, 1999.
  11. On the local leakage resilience of linear secret sharing schemes. Journal of Cryptology, 34:1–65, 2021.
  12. On the (im) possibility of obfuscating programs. In Annual international cryptology conference, pages 1–18. Springer, 2001.
  13. Constructions for quantum indistinguishability obfuscation. In International Conference on Cryptology and Information Security in Latin America, pages 24–43. Springer, 2021.
  14. Obfuscation of pseudo-deterministic quantum circuits. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing, pages 1567–1578, 2023.
  15. Uncloneable Quantum Encryption via Oracles. In Steven T. Flammia, editor, 15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020), volume 158 of Leibniz International Proceedings in Informatics (LIPIcs), pages 4:1–4:22, Dagstuhl, Germany, 2020. Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
  16. Indistinguishability obfuscation of null quantum circuits and applications. In ITCS, 2022.
  17. Francesco Buscemi. All entangled quantum states are nonlocal. Physical review letters, 108(20):200401, 2012.
  18. Exponential separations between learning with and without quantum memory. In FOCS, 2021.
  19. Unclonable cryptography with unbounded collusions. Cryptology ePrint Archive, 2023.
  20. How to use quantum indistinguishability obfuscation. In STOC, 2024.
  21. Extractors and secret sharing against bounded collusion protocols. In 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pages 1226–1242. IEEE, 2020.
  22. Unbounded leakage-resilience and intrusion-detection in a quantum world. Cryptology ePrint Archive, 2023.
  23. Asymptotic state discrimination and a strict hierarchy in distinguishability norms. Journal of Mathematical Physics, 55(11), 2014.
  24. Hidden cosets and applications to unclonable cryptography. In Tal Malkin and Chris Peikert, editors, Advances in Cryptology – CRYPTO 2021, pages 556–584, Cham, 2021. Springer International Publishing.
  25. Everything you always wanted to know about locc (but were afraid to ask). Communications in Mathematical Physics, 328:303–326, 2014.
  26. A framework for bounding nonlocality of state discrimination. Communications in Mathematical Physics, 323:1121–1153, 2013.
  27. Quantum copy-protection of compute-and-compare programs in the quantum random oracle model, 2020.
  28. Quantum data hiding. IEEE Transactions on Information Theory, 48(3):580–598, 2002.
  29. Parallel repetition of local simultaneous state discrimination. arXiv preprint arXiv:2211.06456, 2022.
  30. Julio Gea-Banacloche. Hiding messages in quantum data. Journal of Mathematical Physics, 43(9):4531–4536, 2002.
  31. Candidate indistinguishability obfuscation and functional encryption for all circuits. SIAM Journal on Computing, 45(3):882–929, 2016.
  32. Non-malleable secret sharing. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, pages 685–698, 2018.
  33. O. Goldreich and L. A. Levin. A hard-core predicate for all one-way functions. In Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, STOC ’89, page 25–32, New York, NY, USA, 1989. Association for Computing Machinery.
  34. Unclonable decryption keys. IACR Cryptol. ePrint Arch., 2020:877, 2020.
  35. Aram W. Harrow. The church of the symmetric subspace, 2013.
  36. Aram W. Harrow. Approximate orthogonality of permutation operators, with application to quantum information, 2023.
  37. Strong quantum nonlocality without entanglement. Physical review letters, 122(4):040403, 2019.
  38. Carl W Helstrom. Quantum detection and estimation theory. Journal of Statistical Physics, 1:231–252, 1969.
  39. Robust combiners and universal constructions for quantum cryptography. arXiv preprint arXiv:2311.09487, 2023.
  40. Multiparty data hiding of quantum information. Physical Review A, 71(6):062339, 2005.
  41. One-out-of-many unclonable cryptography: Definitions, constructions, and more. In Theory of Cryptography Conference, pages 246–275. Springer, 2023.
  42. A survey of leakage-resilient cryptography. In Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, pages 727–794. Association for Computing Machinery, 2019.
  43. Srijita Kundu and Ernest Y. Z. Tan. Device-independent uncloneable encryption, 2022.
  44. Antonio Anna Mele. Introduction to haar measure tools in quantum information: A beginner’s tutorial, 2024.
  45. Local simultaneous state discrimination, 2021.
  46. Distinguishability of quantum states under restricted families of measurements with an application to quantum data hiding. Communications in Mathematical Physics, 291:813–843, 2009.
  47. Michael Nathanson. Distinguishing bipartitite orthogonal states using locc: Best and worst cases. Journal of Mathematical Physics, 46(6), 2005.
  48. Roger Penrose. Applications of negative dimensional tensors. Welsh, D., Ed., Combinatorial Mathematics and Its Applications, pages 221–244, 1971.
  49. Quantumness of correlations, quantumness of ensembles and quantum data hiding. New Journal of Physics, 16(11):113001, 2014.
  50. Optimal detection of quantum information. Physical Review Letters, 66(9):1119, 1991.
  51. Quantum computation by local measurement. Annual Review of Condensed Matter Physics, 3(Volume 3, 2012):239–261, 2012.
  52. Leakage resilient secret sharing and applications. In Annual International Cryptology Conference, pages 480–509. Springer, 2019.
  53. Stephen Wiesner. Conjugate coding. ACM Sigact News, 15(1):78–88, 1983.
  54. Mark Zhandry. Quantum lightning never strikes the same state twice. In Yuval Ishai and Vincent Rijmen, editors, Advances in Cryptology – EUROCRYPT 2019, pages 408–438, Cham, 2019. Springer International Publishing.
Citations (3)
View on Semantic Scholar

Summary

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

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