Uncloneable Quantum Encryption via Oracles
arXiv:1903.00130 · doi:10.4230/LIPIcs.TQC.2020.4
Abstract
Quantum information is well-known to achieve cryptographic feats that are unattainable using classical information alone. Here, we add to this repertoire by introducing a new cryptographic functionality called uncloneable encryption. This functionality allows the encryption of a classical message such that two collaborating but isolated adversaries are prevented from simultaneously recovering the message, even when the encryption key is revealed. Clearly, such functionality is unattainable using classical information alone. We formally define uncloneable encryption, and show how to achieve it using Wiesner's conjugate coding, combined with a quantum-secure pseudorandom function (qPRF). Modelling the qPRF as a quantum random oracle, we show security by adapting techniques from the quantum one-way-to-hiding lemma, as well as using bounds from quantum monogamy-of-entanglement games.
arXiv comment34 pages, 4 figures. Some technical details modified. New applications
References in corpus (4)
Cited by in corpus (15)
- Quantum encryption with certified deletion
- Quantum Encryption with Certified Deletion, Revisited: Public Key, Attribute-Based, and Classical Communication
- Constructions for Quantum Indistinguishability Obfuscation
- Quantum copy-protection of compute-and-compare programs in the quantum random oracle model
- Secure Software Leasing
- Device-independent uncloneable encryption
- Secure Software Leasing Without Assumptions
- Uncloneable Quantum Advice
- Local simultaneous state discrimination
- Tight adaptive reprogramming in the QROM
- Limitations on Uncloneable Encryption and Simultaneous One-Way-to-Hiding
- Parallel repetition of local simultaneous state discrimination
- Rigidity for Monogamy-of-Entanglement Games
- Tamper Detection against Unitary Operators
- Almost Public Quantum Coins