Paper 2024/1826
Cloning Games, Black Holes and Cryptography
Abstract
The no-cloning principle has played a foundational role in quantum information and cryptography. Following a long-standing tradition of studying quantum mechanical phenomena through the lens of interactive games, Broadbent and Lord (TQC 2020) formalized cloning games in order to quantitatively capture no-cloning in the context of unclonable encryption schemes.
The conceptual contribution of this paper is the new, natural, notion of Haar cloning games together with two applications. In the area of black-hole physics, our game reveals that, in an idealized model of a black hole which features Haar random (or pseudorandom) scrambling dynamics, the information from infalling entangled qubits can only be recovered from either the interior or the exterior of the black hole---but never from both places at the same time. In the area of quantum cryptography, our game helps us construct succinct unclonable encryption schemes from the existence of pseudorandom unitaries, thereby, for the first time, bridging the gap between ``MicroCrypt'' and unclonable cryptography. The technical contribution of this work is a tight analysis of Haar cloning games which requires us to overcome many long-standing barriers in our understanding of cloning games:
1. Are there cloning games which admit no non-trivial winning strategies? Resolving this particular question turns out to be crucial for our application to black-hole physics. Existing work analyzing the
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint.
- Keywords
- no-cloningpseudorandom unitariesunclonable encryptionblack holes
- Contact author(s)
-
poremba @ mit edu
sragavan @ mit edu
vinodv @ mit edu - History
- 2024-11-08: approved
- 2024-11-07: received
- See all versions
- Short URL
- https://ia.cr/2024/1826
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/1826, author = {Alexander Poremba and Seyoon Ragavan and Vinod Vaikuntanathan}, title = {Cloning Games, Black Holes and Cryptography}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/1826}, year = {2024}, url = {https://eprint.iacr.org/2024/1826} }