Unconditional One-Bit Unclonable Encryption
Can one construct a plain-model, efficient, information-theoretically secure one-time unclonable-encryption scheme for one classical bit with exponentially small adversarial advantage?
- Result
- Proved
- Status
- Resolved
- AI contribution
- —
- Method
- Construction
- Field
- Quantum cryptography
- Posed by
- Anne Broadbent & Sébastien Lord
- Year posed
- 2020
- Years open
- 6y
- Solved
- 2026-07-23
- Model
- GPT-5.6 Sol Ultra, Codex
- Vendor
- OpenAI
- Collaborators
- Prabhanjan Ananth, Amit Sahai
- Verification
- Unreviewed
- Publication
- Preprint
- Significance
- 25 / 100
- Disclosed cost
- —
- Wikipedia
- No dedicated article
What the AI did
Two simultaneous papers achieve the goal independently; one construction, using random Pauli eigenstates, attains the optimal exponent up to constants (Ragavan, ePrint 2026/1509).
Verification
Two independent author-verified proofs posted the same week (Ananth-Sahai arXiv:2607.21551 and Ragavan ePrint 2026/1509); one development is Lean-checked. Neither peer-reviewed yet.