{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:07:09Z","timestamp":1750694829198,"version":"3.32.0"},"reference-count":43,"publisher":"Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften","license":[{"start":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T00:00:00Z","timestamp":1736294400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"NSERC Discovery Grant","award":["DGECR-2019-00027"],"award-info":[{"award-number":["DGECR-2019-00027"]}]},{"name":"NSERC Discovery Grant","award":["RGPIN-2019-04804"],"award-info":[{"award-number":["RGPIN-2019-04804"]}]},{"name":"NSERC Alliance","award":["CRDPJ 522308 \u2013 17"],"award-info":[{"award-number":["CRDPJ 522308 \u2013 17"]}]},{"name":"Huawei Technologies Canada Co., Ltd.","award":["YBN2017010034A1"],"award-info":[{"award-number":["YBN2017010034A1"]}]}],"content-domain":{"domain":["quantum-journal.org"],"crossmark-restriction":false},"short-container-title":["Quantum"],"abstract":"<jats:p>Uncloneable encryption, first introduced by Broadbent and Lord (TQC 2020) is a quantum encryption scheme in which a quantum ciphertext cannot be distributed between two non-communicating parties such that, given access to the decryption key, both parties cannot learn the underlying plaintext. In this work, we introduce a variant of uncloneable encryption in which several possible decryption keys can decrypt a particular encryption, and the security requirement is that two parties who receive independently generated decryption keys cannot both learn the underlying ciphertext. We show that this variant of uncloneable encryption can be achieved device-independently, i.e., without trusting the quantum states and measurements used in the scheme, and that this variant works just as well as the original definition in constructing quantum money. Moreover, we show that a simple modification of our scheme yields a single-decryptor encryption scheme, which was a related notion introduced by Georgiou and Zhandry. In particular, the resulting single-decryptor encryption scheme achieves device-independent security with respect to a standard definition of security against random plaintexts. Finally, we derive an ``extractor&amp;apos;&amp;apos; result for a two-adversary scenario, which in particular yields a single-decryptor encryption scheme for single bit-messages that achieves perfect anti-piracy security without needing the quantum random oracle model.<\/jats:p>","DOI":"10.22331\/q-2025-01-08-1582","type":"journal-article","created":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T16:33:16Z","timestamp":1736353996000},"page":"1582","update-policy":"https:\/\/doi.org\/10.22331\/q-crossmark-policy-page","source":"Crossref","is-referenced-by-count":3,"title":["Device-independent uncloneable encryption"],"prefix":"10.22331","volume":"9","author":[{"given":"Srijita","family":"Kundu","sequence":"first","affiliation":[{"name":"Institute for Quantum Computing and Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ernest Y.-Z.","family":"Tan","sequence":"additional","affiliation":[{"name":"Institute for Quantum Computing and Department of Physics and Astronomy, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"9598","published-online":{"date-parts":[[2025,1,8]]},"reference":[{"key":"0","doi-asserted-by":"publisher","unstructured":"Mark Adcock and Richard Cleve. A Quantum Goldreich-Levin Theorem with Cryptographic Applications. In STACS 2002, pages 323\u2013334, 2002.","DOI":"10.1007\/3-540-45841-7_26"},{"key":"1","doi-asserted-by":"publisher","unstructured":"Nati Aharon, Andr\u00e9 Chailloux, Iordanis Kerenidis, Serge Massar, Stefano Pironio, and Jonathan Silman. Weak coin flipping in a device-independent setting. In Theory of Quantum Computation, Communication, and Cryptography, pages 1\u201312, 2014.","DOI":"10.1007\/978-3-642-54429-3_1"},{"key":"2","doi-asserted-by":"publisher","unstructured":"Antonio Ac\u00edn, Nicolas Gisin, and Lluis Masanes. From Bell&apos;s Theorem to Secure Quantum Key Distribution. Physical Review Letters, 97:120405, 2006.","DOI":"10.1103\/PhysRevLett.97.120405"},{"key":"3","doi-asserted-by":"publisher","unstructured":"Prabhanjan Ananth and Fatih Kaleoglu. Unclonable Encryption, Revisited. In Theory of Cryptography: 19th International Conference, TCC 2021, Raleigh, NC, USA, November 8\u201311, 2021, Proceedings, Part I, page 299\u2013329, Berlin, Heidelberg, 2021. Springer-Verlag.","DOI":"10.1007\/978-3-030-90459-3_11"},{"key":"4","doi-asserted-by":"publisher","unstructured":"Prabhanjan Ananth, Fatih Kaleoglu, Xingjian Li, Qipeng Liu, and Mark Zhandry. On the Feasibility of Unclonable Encryption, and More. In Advances in Cryptology \u2013 CRYPTO 2022, page 212\u2013241. Springer Nature Switzerland, 2022.","DOI":"10.1007\/978-3-031-15979-4_8"},{"key":"5","doi-asserted-by":"publisher","unstructured":"Prabhanjan Ananth, Fatih Kaleoglu, and Qipeng Liu. Cloning Games: A General Framework For Unclonable Primitives. In Proceedings of Advances in Cryptology \u2013 CRYPTO 2023: 43rd Annual International Cryptology Conference (CRYPTO 2023), page 66\u201398, 2023.","DOI":"10.1007\/978-3-031-38554-4_3"},{"key":"6","doi-asserted-by":"publisher","unstructured":"Erdal Arikan. Source polarization. In 2010 IEEE International Symposium on Information Theory, pages 899\u2013903, 2010.","DOI":"10.1109\/ISIT.2010.5513567"},{"key":"7","doi-asserted-by":"publisher","unstructured":"Anne Broadbent and Eric Culf. Rigidity for Monogamy-Of-Entanglement Games. In 14th Innovations in Theoretical Computer Science Conference (ITCS 2023), volume 251 of Leibniz International Proceedings in Informatics (LIPIcs), pages 28:1\u201328:29, Dagstuhl, Germany, 2023. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik.","DOI":"10.4230\/LiPIcs.ITCS.2023.28"},{"key":"8","doi-asserted-by":"publisher","unstructured":"Jonathan Barrett, Lucien Hardy, and Adrian Kent. No Signaling and Quantum Key Distribution. Physical Review Letters, 95:010503, 2005.","DOI":"10.1103\/PhysRevLett.95.010503"},{"key":"9","doi-asserted-by":"publisher","unstructured":"Anne Broadbent, Stacey Jeffery, S\u00e9bastien Lord, Supartha Podder, and Aarthi Sundaram. Secure Software Leasing Without Assumptions. In Kobbi Nissim and Brent Waters, editors, Theory of Cryptography, pages 90\u2013120, Cham, 2021.","DOI":"10.1007\/978-3-030-90459-3_4"},{"key":"10","doi-asserted-by":"publisher","unstructured":"Anne Broadbent and S\u00e9bastien Lord. Uncloneable Quantum Encryption via Oracles. In 15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020), pages 4:1\u20134:22, 2020.","DOI":"10.4230\/LIPIcs.TQC.2020.4"},{"key":"11","doi-asserted-by":"publisher","unstructured":"Jean-Daniel Bancal, Miguel Navascu\u00e9s, Valerio Scarani, Tam\u00e1s V\u00e9rtesi, and Tzyh Haur Yang. Physical characterization of quantum devices from nonlocal correlations. Physical Review A, 91:022115, 2015.","DOI":"10.1103\/PhysRevA.91.022115"},{"key":"12","doi-asserted-by":"publisher","unstructured":"Mohammad Bavarian, Thomas Vidick, and Henry Yuen. Hardness Amplification for Entangled Games via Anchoring. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC &apos;17, page 303\u2013316, 2017.","DOI":"10.1145\/3055399.3055433"},{"key":"13","doi-asserted-by":"publisher","unstructured":"Andrea Coladangelo, Jiahui Liu, Qipeng Liu, and Mark Zhandry. Hidden Cosets and Applications to Unclonable Cryptography. In Advances in Cryptology \u2013 CRYPTO 2021, pages 556\u2013584. Springer International Publishing, 2021.","DOI":"10.1007\/978-3-030-84242-0_20"},{"key":"14","doi-asserted-by":"publisher","unstructured":"Andrea Coladangelo, Christian Majenz, and Alexander Poremba. Quantum copy-protection of compute-and-compare programs in the quantum random oracle model. Quantum, 8:1330, 2024.","DOI":"10.22331\/q-2024-05-02-1330"},{"key":"15","doi-asserted-by":"publisher","unstructured":"Anindya De, Christopher Portmann, Thomas Vidick, and Renato Renner. Trevisan&apos;s Extractor in the Presence of Quantum Side Information. SIAM Journal on Computing, 41(4):915\u2013940, 2012.","DOI":"10.1137\/100813683"},{"key":"16","doi-asserted-by":"publisher","unstructured":"Honghao Fu and Carl A. Miller. Local randomness: Examples and application. Physical Review A, 97:032324, 2018.","DOI":"10.1103\/PhysRevA.97.032324"},{"key":"17","doi-asserted-by":"publisher","unstructured":"Alexandru Gheorghiu, Tony Metger, and Alexander Poremba. Quantum Cryptography with Classical Communication: Parallel Remote State Preparation for Copy-Protection, Verification, and More. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023), volume 261 of Leibniz International Proceedings in Informatics (LIPIcs), pages 67:1\u201367:17, Dagstuhl, Germany, 2023. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik.","DOI":"10.4230\/LIPIcs.ICALP.2023.67"},{"key":"18","doi-asserted-by":"publisher","unstructured":"Daniel Gottesman. Uncloneable Encryption. Quantum Information and Computation, 3(6):581\u2013602, 2003.","DOI":"10.26421\/QIC3.6-2"},{"key":"19","unstructured":"Marios Georgiou and Mark Zhandry. Unclonable Decryption Keys. IACR Cryptology ePrint, 2020."},{"key":"20","doi-asserted-by":"publisher","unstructured":"Thomas Holenstein. Parallel Repetition: Simplifications and the No-Signaling Case. In Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, STOC &apos;07, page 411\u2013419, 2007.","DOI":"10.1145\/1250790.1250852"},{"key":"21","doi-asserted-by":"publisher","unstructured":"Karol Horodecki and Maciej Stankiewicz. Semi-device-independent quantum money. New Journal of Physics, 22(2):023007, 2020.","DOI":"10.1088\/1367-2630\/ab6872"},{"key":"22","doi-asserted-by":"publisher","unstructured":"R. Jain and S. Kundu. A direct product theorem for quantum communication complexity with applications to device-independent QKD. In 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pages 1285\u20131295, 2022.","DOI":"10.1109\/FOCS52979.2021.00125"},{"key":"23","doi-asserted-by":"publisher","unstructured":"Rahul Jain, Attila Pereszl\u00e9nyi, and Penghui Yao. A Parallel Repetition Theorem for Entangled Two-Player One-Round Games under Product Distributions. In 2014 IEEE 29th Conference on Computational Complexity (CCC &apos;14), pages 209\u2013216, 2014.","DOI":"10.1109\/ccc.2014.29"},{"key":"24","doi-asserted-by":"publisher","unstructured":"Srijita Kundu, Jamie Sikora, and Ernest Y.-Z. Tan. A device-independent protocol for XOR oblivious transfer. Quantum, 6:725, 2022.","DOI":"10.22331\/q-2022-05-30-725"},{"key":"25","doi-asserted-by":"publisher","unstructured":"Srijita Kundu and Ernest Y.-Z. Tan. Composably secure device-independent encryption with certified deletion. Quantum, 7:1047, 2023.","DOI":"10.22331\/q-2023-07-06-1047"},{"key":"26","doi-asserted-by":"publisher","unstructured":"Jiahui Liu, Qipeng Liu, Luowen Qian, and Mark Zhandry. Collusion Resistant Copy-Protection for Watermarkable Functionalities. In Eike Kiltz and Vinod Vaikuntanathan, editors, Theory of Cryptography, pages 294\u2013323, Cham, 2022. Springer Nature Switzerland.","DOI":"10.1007\/978-3-031-22318-1_11"},{"key":"27","doi-asserted-by":"publisher","unstructured":"Sophie Laplante, Virginie Lerays, and J\u00e9r\u00e9mie Roland. Classical and Quantum Partition Bound and Detector Inefficiency. In Automata, Languages, and Programming, pages 617\u2013628, Berlin, Heidelberg, 2012.","DOI":"10.1007\/978-3-642-31594-7_52"},{"key":"28","doi-asserted-by":"publisher","unstructured":"Ll. Masanes, A. Acin, and N. Gisin. General properties of nonsignaling theories. Physical Review A, 73:012112, 2006.","DOI":"10.1103\/PhysRevA.73.012112"},{"key":"29","doi-asserted-by":"publisher","unstructured":"Michele Masini, Stefano Pironio, and Erik Woodhead. Simple and practical DIQKD security analysis via BB84-type uncertainty relations and Pauli correlation constraints. Quantum, 6:843, October 2022.","DOI":"10.22331\/q-2022-10-20-843"},{"key":"30","doi-asserted-by":"publisher","unstructured":"Christian Majenz, Christian Schaffner, and Mehrdad Tahmasbi. Limitations on Uncloneable Encryption and Simultaneous One-Way-to-Hiding. arXiv:2103.14510v3, 2021.","DOI":"10.48550\/arXiv.2103.14510"},{"key":"31","doi-asserted-by":"publisher","unstructured":"Matthew McKague, Tzyh Haur Yang, and Valerio Scarani. Robust self-testing of the singlet. Journal of Physics A: Mathematical and Theoretical, 45(45):455304, 2012.","DOI":"10.1088\/1751-8113\/45\/45\/455304"},{"key":"32","doi-asserted-by":"publisher","unstructured":"Stefano Pironio, Antonio Ac\u00edn, Nicolas Brunner, Nicolas Gisin, Serge Massar, and Valerio Scarani. Device-independent quantum key distribution secure against collective attacks. New Journal of Physics, 11(4):045021, 2009.","DOI":"10.1088\/1367-2630\/11\/4\/045021"},{"key":"33","doi-asserted-by":"publisher","unstructured":"Christopher Portmann and Renato Renner. Cryptographic security of quantum key distribution. arXiv:1409.3525v1, 2014.","DOI":"10.48550\/arXiv.1409.3525"},{"key":"34","doi-asserted-by":"publisher","unstructured":"Ran Raz. A Parallel Repetition Theorem. In Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, page 447\u2013456, 1995.","DOI":"10.1145\/225058.225181"},{"key":"35","doi-asserted-by":"publisher","unstructured":"Renato Renner. Security of Quantum Key Distribution. arXiv:0512258v2, 2005.","DOI":"10.48550\/arXiv.quant-ph\/0512258"},{"key":"36","doi-asserted-by":"publisher","unstructured":"Ernest Y.-Z. Tan. Prospects for device-independent quantum key distribution. arXiv:2111.11769v1, 2021.","DOI":"10.48550\/arXiv.2111.11769"},{"key":"37","doi-asserted-by":"publisher","unstructured":"Marco Tomamichel, Serge Fehr, J\u0119drzej Kaniewski, and Stephanie Wehner. A monogamy-of-entanglement game with applications to device-independent quantum cryptography. New Journal of Physics, 15(10):103002, 2013.","DOI":"10.1088\/1367-2630\/15\/10\/103002"},{"key":"38","doi-asserted-by":"publisher","unstructured":"Marco Tomamichel, Jesus Martinez-Mateo, Christoph Pacher, and David Elkouss. Fundamental finite key limits for one-way information reconciliation in quantum key distribution. Quantum Information Processing, 16(11), 2017.","DOI":"10.1007\/s11128-017-1709-5"},{"key":"39","doi-asserted-by":"publisher","unstructured":"Marco Tomamichel, Christian Schaffner, Adam Smith, and Renato Renner. Leftover Hashing Against Quantum Side Information. IEEE Transactions on Information Theory, 57(8):5524\u20135535, 2011.","DOI":"10.1109\/tit.2011.2158473"},{"key":"40","doi-asserted-by":"publisher","unstructured":"Thomas Vidick. Parallel DIQKD from parallel repetition. arXiv:1703.08508v1, 2017.","DOI":"10.48550\/arXiv.1703.08508"},{"key":"41","doi-asserted-by":"publisher","unstructured":"Stephen Wiesner. Conjugate Coding. SIGACT News, 15(1):78\u201388, 1983.","DOI":"10.1145\/1008908.1008920"},{"key":"42","unstructured":"E. Woodhead, S. Massar, and S. Pironio. Imperfections and self testing in prepare-and-measure quantum key distribution, 2014."}],"container-title":["Quantum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/quantum-journal.org\/papers\/q-2025-01-08-1582\/pdf\/","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T16:33:26Z","timestamp":1736354006000},"score":1,"resource":{"primary":{"URL":"https:\/\/quantum-journal.org\/papers\/q-2025-01-08-1582\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,8]]},"references-count":43,"URL":"https:\/\/doi.org\/10.22331\/q-2025-01-08-1582","archive":["CLOCKSS"],"relation":{},"ISSN":["2521-327X"],"issn-type":[{"value":"2521-327X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,8]]},"article-number":"1582"}}