Cryptology ePrint Archive: Report 2019/257

Uncloneable Quantum Encryption via Random Oracles

Anne Broadbent and Sébastien Lord

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.

Category / Keywords: foundations / Quantum Cryptography, Encryption, Uncloneability, Conjugate Coding, Monogamy-of- Entanglement, Quantum Random Oracle

Original Publication (in the same form): arXiv

Date: received 28 Feb 2019, last revised 28 Feb 2019

Contact author: slord050 at uottawa ca

Available format(s): PDF | BibTeX Citation

Note: 28 pages, 3 figures.

Version: 20190301:032554 (All versions of this report)

Short URL: ia.cr/2019/257


[ Cryptology ePrint archive ]