{
  "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\\left(2^{-n/2}\\right).$ 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(\\cdot)$).",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2607.21551",
  "author_total": 3,
  "authors": [
    {
      "name": "Prabhanjan Ananth"
    },
    {
      "name": "Seyoon Ragavan"
    },
    {
      "name": "Amit Sahai"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/fegnj11tc5nxc.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2607.21551",
  "fulltext_url": null,
  "id": "fegnj11tc5nxc",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2607.21551",
  "language": null,
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.CR"
    ],
    [
      "arxiv",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Cryptography and Data Security"
    ]
  ],
  "openalex": "W7170729947",
  "pdf_url": "https://arxiv.org/pdf/2607.21551",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-04",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/fegnj11tc5nxc.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:27:01Z",
      "native_id": "2607.21551",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2607.21551"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Unconditional Unclonable Encryption",
  "title_text": "Unconditional Unclonable Encryption",
  "type": "preprint",
  "updated_at": "2026-10-30T12:27:01Z",
  "url": "https://research.draconitic.com/paper/fegnj11tc5nxc",
  "venue": "arXiv",
  "versions": []
}