Device-independent uncloneable encryption

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. Moreover, we show that this variant of uncloneable encryption works just as well as the original definition in constructing quantum money, and can be used to get uncloneable bits without using the quantum random oracle model.

[1]  P. Ananth,et al.  On the Feasibility of Unclonable Encryption, and More , 2022, IACR Cryptol. ePrint Arch..

[2]  Rahul Jain,et al.  A direct product theorem for quantum communication complexity with applications to device-independent QKD , 2022, 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS).

[3]  A. Gheorghiu,et al.  Quantum cryptography with classical communication: parallel remote state preparation for copy-protection, verification, and more , 2022, IACR Cryptol. ePrint Arch..

[4]  E. Y. Tan.  Prospects for device-independent quantum key distribution , 2021, 2111.11769.

[5]  A. Broadbent,et al.  Rigidity for Monogamy-Of-Entanglement Games , 2021, ITCS.

[6]  E. Woodhead,et al.  Simple and practical DIQKD security analysis via BB84-type uncertainty relations and Pauli correlation constraints , 2021, Quantum.

[7]  Mehrdad Tahmasbi,et al.  Limitations on Uncloneable Encryption and Simultaneous One-Way-to-Hiding , 2021, IACR Cryptol. ePrint Arch..

[8]  A. Broadbent,et al.  Secure Software Leasing Without Assumptions , 2021, TCC.

[9]  Srijita Kundu,et al.  Composably secure device-independent encryption with certified deletion , 2020, Quantum.

[10]  Christian Majenz,et al.  Quantum copy-protection of compute-and-compare programs in the quantum random oracle model , 2020, IACR Cryptol. ePrint Arch..

[11]  Jamie Sikora,et al.  A device-independent protocol for XOR oblivious transfer , 2020, Quantum.

[12]  A. Broadbent,et al.  Uncloneable Quantum Encryption via Oracles , 2019, TQC.

[13]  Karol Horodecki,et al.  Semi-device-independent quantum money , 2018, New Journal of Physics.

[14]  Thomas Vidick,et al.  Practical device-independent quantum cryptography via entropy accumulation , 2018, Nature Communications.

[15]  Carl A Miller,et al.  Local Randomness: Examples and Application. , 2017, Physical review. A.

[16]  Thomas Vidick,et al.  Hardness amplification for entangled games via anchoring , 2017, STOC.

[17]  Thomas Vidick,et al.  Parallel DIQKD from parallel repetition , 2017, 1703.08508.

[18]  Rahul Jain,et al.  Parallel Device-Independent Quantum Key Distribution , 2017, IEEE Transactions on Information Theory.

[19]  S. Massar,et al.  Imperfections and self testing in prepare-and-measure quantum key distribution , 2014 .

[20]  Renato Renner,et al.  Cryptographic security of quantum key distribution , 2014, ArXiv.

[21]  David Elkouss,et al.  Fundamental finite key limits for one-way information reconciliation in quantum key distribution , 2014, Quantum Information Processing.

[22]  Rahul Jain,et al.  A Parallel Repetition Theorem for Entangled Two-Player One-Round Games under Product Distributions , 2013, 2014 IEEE 29th Conference on Computational Complexity (CCC).

[23]  S. Wehner,et al.  A monogamy-of-entanglement game with applications to device-independent quantum cryptography , 2012, 1210.4359.

[24]  Sophie Laplante,et al.  Classical and Quantum Partition Bound and Detector Inefficiency , 2012, ICALP.

[25]  T. H. Yang,et al.  Robust self-testing of the singlet , 2012, 1203.2976.

[26]  Stefano Pironio,et al.  Weak Coin Flipping in a Device-Independent Setting , 2011, TQC.

[27]  Adam D. Smith,et al.  Leftover Hashing Against Quantum Side Information , 2010, IEEE Transactions on Information Theory.

[28]  Erdal Arikan,et al.  Source polarization , 2010, 2010 IEEE International Symposium on Information Theory.

[29]  Anindya De,et al.  Trevisan's Extractor in the Presence of Quantum Side Information , 2009, SIAM J. Comput..

[30]  V. Scarani,et al.  Device-independent quantum key distribution secure against collective attacks , 2009, 0903.4460.

[31]  Thomas Holenstein,et al.  Parallel repetition: simplifications and the no-signaling case , 2007, STOC '07.

[32]  Renato Renner,et al.  Security of quantum key distribution , 2005, Ausgezeichnete Informatikdissertationen.

[33]  N. Gisin,et al.  From Bell's theorem to secure quantum key distribution. , 2005, Physical review letters.

[34]  N. Gisin,et al.  General properties of nonsignaling theories , 2005, quant-ph/0508016.

[35]  Adrian Kent,et al.  No signaling and quantum key distribution. , 2004, Physical review letters.

[36]  D. Gottesman.  Uncloneable encryption , 2002, Quantum Inf. Comput..

[37]  Mark R. Adcock,et al.  A Quantum Goldreich-Levin Theorem with Cryptographic Applications , 2001, STACS.

[38]  Ran Raz,et al.  A parallel repetition theorem , 1995, STOC '95.

[39]  Stephen Wiesner,et al.  Conjugate coding , 1983, SIGA.