Semi-quantum Money

Radian, Roy; Sattath, Or

doi:10.1007/s00145-021-09418-8

Cited by 16 publications

(17 citation statements)

References 43 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(sketch.) This proof sketch is a summary of the proof in [RS19]. Canetti et al [CHS05] proved that a parallel repetition exponentially decreases hardness of weakly verifiable puzzle, which is roughly a computational problem whose solution can be verified by a secret verification key generated along with the problem.…”

Section: Lemma 318 (Implicit In [Rs19]mentioning

confidence: 98%

“…Their constructions are secure relative to classical oracles. Radian and Sattath presented the notion of semi-quantum money, where both minting and verification protocols are interactive with classical communication [RS19]. Georgiou and Zhandry presented the notion of unclonable decryption keys [GZ20], which can be seen as quantum copy-protection for specific cryptographic tasks.…”

Section: Related Workmentioning

confidence: 99%

“…At a high level, the only quantum component of our SSL is two-tier QL, which can be seen as a type of quantum money. Thus we rely on techniques used for constructing semi-quantum money [RS19], which is a (secret key) quantum money with classical communication. More details are explained below.…”

Section: Ssl With Classical Communicationmentioning

confidence: 99%

“…still does not suffice for our purpose since one can generate a certificate that passes the verification without discarding the original bolt with probability 1/2 by just randomly guessing (m, d). To reduce this probability to negligible, we rely on an amplification theorem in [RS19] (which in turn is based on [CHS05]). As a result, we can show that a parallel repetition to the above construction yields a two-tier QL with the bolt-to-certificate capability.…”

Section: Ssl With Classical Communicationmentioning

confidence: 99%

“…The second question is whether we can achieve SSL/copy-protection only with classical communication and local quantum computing as in the case of quantum money [RS19,AGKZ20]. Even if quantum computers are available, communicating only classical data is much easier than communicating quantum data over quantum channels.…”

Section: Introduction 1backgroundmentioning

confidence: 99%

See 4 more Smart Citations

Secure Software Leasing from Standard Assumptions

Kitagawa,

Nishimaki,

Yamakawa

2020

Preprint

View full text Add to dashboard Cite

Secure software leasing (SSL) is a quantum cryptographic primitive that enables users to execute software only during the software is leased. It prevents users from executing leased software after they return the leased software to its owner. SSL can make software distribution more flexible and controllable.Although SSL is an attractive cryptographic primitive, the existing SSL scheme is based on public key quantum money, which is not instantiated with standard cryptographic assumptions so far. Moreover, the existing SSL scheme only supports a subclass of evasive functions.In this work, we present SSL schemes based on the learning with errors assumption (LWE). Specifically, our contributions consist of the following.• We construct an SSL scheme for pseudorandom functions from the LWE assumption against quantum adversaries.• We construct an SSL scheme for a subclass of evasive functions from the LWE assumption against sub-exponential quantum adversaries.• We construct SSL schemes for the functionalities above with classical communication from the LWE assumption against (sub-exponential) quantum adversaries.SSL with classical communication means that entities exchange only classical information though they run quantum computation locally.Our crucial tool is two-tier quantum lightning, which is introduced in this work and a relaxed version of quantum lighting. In two-tier quantum lightning schemes, we have a public verification algorithm called semi-verification and a private verification algorithm called full-verification. An adversary cannot generate possibly entangled two quantum states whose serial numbers are the same such that one passes the semi-verification, and the other also passes the full-verification. We show that we can construct a two-tier quantum lightning scheme from the LWE assumption.

show abstract

Section: Lemma 318 (Implicit In [Rs19]mentioning

confidence: 98%

Section: Related Workmentioning

confidence: 99%

Section: Ssl With Classical Communicationmentioning

confidence: 99%

Section: Ssl With Classical Communicationmentioning

confidence: 99%

Section: Introduction 1backgroundmentioning

confidence: 99%

See 3 more Smart Citations

Secure Software Leasing from Standard Assumptions

Kitagawa,

Nishimaki,

Yamakawa

2020

Preprint

View full text Add to dashboard Cite

show abstract

On the Feasibility of Unclonable Encryption, and More

Ananth

Kaleoglu

et al. 2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Semi-quantum Copy-Protection and More

Chevalier,

Hermouet,

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Properties of quantum mechanics have enabled the emergence of quantum cryptographic protocols achieving important goals which are proven to be impossible classically. Unfortunately, this usually comes at the cost of needing quantum power from every party in the protocol, while arguably a more realistic scenario would be a network of classical clients, classically interacting with a quantum server.In this paper, we focus on copy-protection, which is a quantum primitive that allows a program to be evaluated, but not copied, and has shown interest especially due to its links to other unclonable cryptographic primitives. Our main contribution is to show how to dequantize quantum copy-protection schemes constructed from hidden coset states, by giving a construction for classically-instructed remote state preparation for coset states, which preserves hardness properties of hidden coset states. We then apply this dequantizer to obtain semi-quantum cryptographic protocols for copy-protection and tokenized signatures with strong unforgeability. In the process, we present the first secure copy-protection scheme for point functions in the plain model and a new direct product hardness property of coset states which immediately implies a strongly unforgeable tokenized signature scheme.⋆ Work done while at CRED and DIENS. 1 This is called hybrid quantum cryptography in [AGKZ20]. Technical Overview Our Remote Coset State Preparation Protocol and Its Application toCopy-ProtectionIn this section, we give an overview of our remote coset state preparation protocol and its proof of soundness. To give the reader a glimpse of the functionality of our protocol and how it can be used as a generic compiler to obtain semi-quantum copy-protection, we first start by analysing security requirements for several existing quantum copy-protection schemes based on coset states.Security Requirements. For our discussion, we focus on the copy-protection of pseudorandom functions scheme in the plain model and the single-decryptor scheme in the plain model presented in [CLLZ21]. The common point is that security of these constructions all reduce to a monogamy-ofentanglement property of coset states [CLLZ21, CV22]. Informally, this property states that a triple of quantum algorithms Alice, Bob and Charlie cannot cooperatively win the following monogamy game with a challenger, except with negligible probability. The challenger first prepares a uniformly random coset state |A s,s ′ ⟩ and gives the state to Alice. Alice outputs two (possibly entangled) quantum states and sends them to Bob and Charlie respectively. No communication is allowed between Bob and Charlie. Finally, Bob and Charlie both get the description of the subspace A. The game is won if Bob outputs a vector in A + s and Charlie outputs a vector in A ⊥ + s ′ , where A ⊥ denote the dual subspace of A.If our goal is to design a semi-quantum protocol for preparing coset states such that it can be used in a plug-and-play manner for the aforementioned protocols, our protocol needs to have the fo...

show abstract

Semi-quantum Money

Cited by 16 publications

References 43 publications

Secure Software Leasing from Standard Assumptions

Secure Software Leasing from Standard Assumptions

On the Feasibility of Unclonable Encryption, and More

Semi-quantum Copy-Protection and More

Contact Info

Product

Resources

About