Pith. sign in

REVIEW

A Note on Copy-Protection from Random Oracles

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2208.12884 v1 pith:BQAVQ4MH submitted 2022-08-26 cs.CR quant-ph

classification cs.CRquant-ph
keywords copy-protectionquantummodelrandomconstructingimpossibilityoracleplain
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Quantum copy-protection, introduced by Aaronson (CCC'09), uses the no-cloning principle of quantum mechanics to protect software from being illegally distributed. Constructing copy-protection has been an important problem in quantum cryptography. Since copy-protection is shown to be impossible to achieve in the plain model, we investigate the question of constructing copy-protection for arbitrary classes of unlearnable functions in the random oracle model. We present an impossibility result that rules out a class of copy-protection schemes in the random oracle model assuming the existence of quantum fully homomorphic encryption and quantum hardness of learning with errors. En route, we prove the impossibility of approximately correct copy-protection in the plain model.

Discussion (0). Continue with ORCID to comment.

Pith tools