Post-quantum zero knowledge in constant rounds

Bitansky, Nir; Shmueli, Omri

doi:10.1145/3357713.3384324

Cited by 39 publications

(43 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[BS20, AL20] recently introduced a beautiful non-black-box technique that, in particular, achieves constant-round zero knowledge arguments for NP with strict polynomial time simulation [BS20]. As discussed above, the use of non-black-box techniques is necessary to achieve strict polynomial time simulation in the classical [BL02] and quantum [CCLY21] settings (and in the quantum setting this extends to EQPT m simulation).…”

Section: Related Workmentioning

confidence: 99%

Post-Quantum Zero Knowledge, Revisited (or: How to Do Quantum Rewinding Undetectably)

Lombardi¹,

Ma²,

Spooner³

2021

Preprint

View full text Add to dashboard Cite

A major difficulty in quantum rewinding is the fact that measurement is destructive: extracting information from a quantum state irreversibly changes it. This is especially problematic in the context of zero-knowledge simulation, where preserving the adversary's state is essential.In this work, we develop new techniques for quantum rewinding in the context of extraction and zero-knowledge simulation:1. We show how to extract information from a quantum adversary by rewinding it without disturbing its internal state. We use this technique to prove that important interactive protocols, such as the Goldreich-Micali-Wigderson protocol for graph non-isomorphism and the Feige-Shamir protocol for NP, are zero-knowledge against quantum adversaries.2. We prove that the Goldreich-Kahan protocol for NP is post-quantum zero knowledge using a simulator that can be seen as a natural quantum extension of the classical simulator.Our results achieve (constant-round) black-box zero-knowledge with negligible simulation error, appearing to contradict a recent impossibility result due to Chia-Chung-Liu-Yamakawa (FOCS 2021). This brings us to our final contribution: 3. We introduce coherent-runtime expected quantum polynomial time, a computational model that (1) captures all of our zero-knowledge simulators, (2) cannot break any polynomial hardness assumptions, and (3) is not subject to the CCLY impossibility. In light of our positive results and the CCLY negative results, we propose coherent-runtime simulation to be the right quantum analogue of classical expected polynomial-time simulation.

show abstract

Section: Related Workmentioning

confidence: 99%

Post-Quantum Zero Knowledge, Revisited (or: How to Do Quantum Rewinding Undetectably)

Lombardi¹,

Ma²,

Spooner³

2021

Preprint

View full text Add to dashboard Cite

show abstract

“…In general, zero-knowledge arguments form a back-bone of general MPC as well as multiparty coin-flipping. While the recent work of Bitansky and Shmueli [BS20] builds constant-round post-quantum zero-knowledge, their protocol and its guarantees turn out to be insufficient for the multi-party setting. In the (constant-round) multi-party setting, a single prover would typically need to interact in parallel with (n−1) different verifiers, a subset or all of which may be adversarial.…”

Section: Technical Overviewmentioning

confidence: 99%

“…After Watrous' breakthrough work on zero-knowledge against quantum adversaries [Wat09], the works of [DL09, LN11, HSS11] considered variants of quantum-secure computation protocols, in the two-party setting. Very recently, Bitansky and Shmueli [BS20] obtained the first constantround classical zero-knowledge arguments with security against quantum adversaries. Their techniques (and those of [AP19] in a concurrent work) are based on the recent non-black-box simulation technique of [BKP19], who constructed two-message classically-secure weak zero-knowledge in the plain model.…”

Section: Introductionmentioning

confidence: 99%

“…Because quantum information behaves in a fundamentally different way than classical information, designing post-quantum protocols often requires new techniques to achieve provable security. As a key contribution, we propose a new powerful parallel no-cloning non-black-box simulation technique that extends the work of [BS20], to achieve security against multiple parallel quantum verifiers in constant rounds. By carefully combining this with additional technical ideas, we directly obtain constant-round MPC for classical circuits with security against quantum adversaries.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Post-Quantum Multi-Party Computation

Agarwal¹,

Bartusek²,

Goyal³

et al. 2020

Preprint

View full text Add to dashboard Cite

We obtain the first constant-round post-quantum multi-party computation protocol for general classical functionalities in the plain model, with security against malicious corruptions. We assume mildly super-polynomial quantum hardness of learning with errors (LWE), and quantum polynomial hardness of an LWE-based circular security assumption. Along the way, we also construct the following protocols that may be of independent interest.

show abstract

“…In the category of 'short' proof and argument systems for QMA, we mention three independent works. In [BS19], the authors present a constant-round computationally zero-knowledge argument system for QMA.…”

mentioning

confidence: 99%

Classical zero-knowledge arguments for quantum computations

Vidick

Gilroy

2020

Quantum

View full text Add to dashboard Cite

We show that every language in QMA admits a classical-verifier, quantum-prover zero-knowledge argument system which is sound against quantum polynomial-time provers and zero-knowledge for classical (and quantum) polynomial-time verifiers. The protocol builds upon two recent results: a computational zero-knowledge proof system for languages in QMA, with a quantum verifier, introduced by Broadbent et al. (FOCS 2016), and an argument system for languages in QMA, with a classical verifier, introduced by Mahadev (FOCS 2018).

show abstract

Post-quantum zero knowledge in constant rounds

Cited by 39 publications

References 15 publications

Post-Quantum Zero Knowledge, Revisited (or: How to Do Quantum Rewinding Undetectably)

Post-Quantum Zero Knowledge, Revisited (or: How to Do Quantum Rewinding Undetectably)

Post-Quantum Multi-Party Computation

Classical zero-knowledge arguments for quantum computations

Contact Info

Product

Resources

About