Hidden Cosets and Applications to Unclonable Cryptography

07/12/2021
by   Andrea Coladangelo, et al.
0

In this work, we study a generalization of hidden subspace states to hidden coset states (first introduced by Aaronson and Christiano [STOC '12]). This notion was considered independently by Vidick and Zhang [Eurocrypt '21], in the context of proofs of quantum knowledge from quantum money schemes. We explore unclonable properties of coset states and several applications: - We show that assuming indistinguishability obfuscation (iO), hidden coset states possess a certain direct product hardness property, which immediately implies a tokenized signature scheme in the plain model. Previously, it was known only relative to an oracle, from a work of Ben-David and Sattath [QCrypt '17]. - Combining a tokenized signature scheme with extractable witness encryption, we give a construction of an unclonable decryption scheme in the plain model. The latter primitive was recently proposed by Georgiou and Zhandry [ePrint '20], who gave a construction relative to a classical oracle. - We conjecture that coset states satisfy a certain natural (information-theoretic) monogamy-of-entanglement property. Assuming this conjecture is true, we remove the requirement for extractable witness encryption in our unclonable decryption construction, by relying instead on compute-and-compare obfuscation for the class of unpredictable distributions. - Finally, we give a construction of a copy-protection scheme for pseudorandom functions (PRFs) in the plain model. Our scheme is secure either assuming iO, OWF, and extractable witness encryption, or assuming iO, OWF, compute-and-compare obfuscation for the class of unpredictable distributions, and the conjectured monogamy property mentioned above. This is the first example of a copy-protection scheme with provable security in the plain model for a class of functions that is not evasive.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/29/2020

Quantum copy-protection of compute-and-compare programs in the quantum random oracle model

Copy-protection allows a software distributor to encode a program in suc...
research
07/28/2021

A monogamy-of-entanglement game for subspace coset states

We establish a strong monogamy-of-entanglement property for subspace cos...
research
12/01/2022

Quantum Cryptography in Algorithmica

We construct a classical oracle relative to which 𝖯 = 𝖭𝖯 yet single-copy...
research
04/20/2020

Quantum Copy-Protection from Hidden Subspaces

Quantum copy-protection is an innovative idea that uses the no-cloning p...
research
03/26/2021

Limitations on Uncloneable Encryption and Simultaneous One-Way-to-Hiding

We study uncloneable quantum encryption schemes for classical messages a...
research
02/03/2023

Cloning Games: A General Framework for Unclonable Primitives

The powerful no-cloning principle of quantum mechanics can be leveraged ...
research
12/28/2021

Quantum Merkle Trees

Commitment scheme is a central task in cryptography, where a party (typi...

Please sign up or login with your details

Forgot password? Click here to reset