Cryptology ePrint Archive: Report 2019/257

Uncloneable Quantum Encryption via 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 an 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 (with major differences): TQC 2020 - 15th Conference on the Theory of Quantum Computation, Communication and Cryptography
DOI:
10.4230/LIPIcs.TQC.2020.4

Date: received 28 Feb 2019, last revised 25 Jun 2021

Contact author: slord050 at uottawa ca

Available format(s): PDF | BibTeX Citation

Note: 34 pages, 4 figures. Some technical details modified. New applications.

Version: 20210625:150630 (All versions of this report)

Short URL: ia.cr/2019/257


[ Cryptology ePrint archive ]