Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 54 min ago
PreprintCC BY 4.0arXiv

Unconditional Unclonable Encryption

  • Prabhanjan Ananth
  • Seyoon Ragavan
  • Amit Sahai
Open at sourcePDFDOICite

Abstract

We give an unconditional construction of information-theoretically secure one-time private-key unclonable encryption for one-bit messages, with efficient encryption and decryption and exponentially small unclonable-indistinguishability advantage. Previous work by Bhattacharyya and Culf (Nature Physics, 2026) and Bhattacharyya, Broadbent, and Culf (arXiv:2603.08916) either only showed inverse-polynomial security loss or required inefficient encryption/decryption operations; we avoid both of these caveats. Our scheme's key is a uniformly random non-identity phase-free Pauli on n qubits, and bit a is encrypted as a random (−1)a eigenstate of that Pauli. We prove that the probability that both receivers recover the bit is at most 1/2 + O(2−n/2). By a lower bound due to Broadbent, Culf, and Rochette (arXiv:2510.00903), this is the best probability bound achievable with n-qubit ciphertexts while ensuring perfect correctness (up to the constant hidden in the O(·)).

Related

  1. Unconditional authentication in quantum key distribution via hybrid entangled physical unclonable functions
    Nicolas Laurent-Puig, Mina Doosti, Adriano Innocenzi +1
    Physical Review ResearchPeer-reviewedPublisher termsAtomic, molecular & optical physicsCrossref
  2. Unclonable encryption from BB84 states: a simultaneous Goldreich-Levin reduction
    Andrea Coladangelo, Qipeng Liu, Ziyi Xie
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  3. Security assessment of photonic integrated circuit-based physically unclonable functions
    Hans Kieninger, Paul Jimenez, Fabio Pavanello +4
    Optics ExpressPeer-reviewedCC BY 4.0Full textOptics & photonicsHAL
  4. Decisional Monogamy-of-Entanglement for Coset States and Applications to Unclonable Cryptography with Correlated Challenges
    Amit Behera, Alper Cakan, Vipul Goyal
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
  5. Intelligent intrinsic physical layer security: joint authentication and encryption for data center communications
    Xinshuai Liang, Chongfu Zhang, Yue Lin +3
    Optics ExpressPeer-reviewedPublisher termsOptics & photonicsCrossref

Cite

BibTeXRIS
BibTeX
@misc{ananth2026unconditional,
  title = {{Unconditional Unclonable Encryption}},
  author = {Prabhanjan Ananth and Seyoon Ragavan and Amit Sahai},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2607.21551},
  eprint = {2607.21551},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2607.21551},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Unconditional Unclonable Encryption
AU  - Prabhanjan Ananth
AU  - Seyoon Ragavan
AU  - Amit Sahai
PY  - 2026
DA  - 2026/10/04
PB  - arXiv
DO  - 10.48550/arxiv.2607.21551
UR  - https://arxiv.org/abs/2607.21551
AB  - We give an unconditional construction of information-theoretically secure one-time private-key unclonable encryption for one-bit messages, with efficient encryption and decryption and exponentially small unclonable-indistinguishability advantage. Previous work by Bhattacharyya and Culf (Nature Physics, 2026) and Bhattacharyya, Broadbent, and Culf (arXiv:2603.08916) either only showed inverse-polynomial security loss or required inefficient encryption/decryption operations; we avoid both of these caveats. Our scheme's key is a uniformly random non-identity phase-free Pauli on n qubits, and bit a is encrypted as a random (−1)^a eigenstate of that Pauli. We prove that the probability that both receivers recover the bit is at most 1/2 + O(2^−n/2). By a lower bound due to Broadbent, Culf, and Rochette (arXiv:2510.00903), this is the best probability bound achievable with n-qubit ciphertexts while ensuring perfect correctness (up to the constant hidden in the O(·)).
ER  -