Secure Quantum Extraction Protocols

Ananth, Prabhanjan; Placa, Rolando L. La

doi:10.1007/978-3-030-64381-2_5

Cited by 14 publications

(7 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We build the first constant-round zero-knowledge argument against parallel quantum verifiers from quantum polynomial hardness of an LWE-based circular security assumption. This improves upon the work of [BS20,AP19] who provided such an argument against a single quantum verifier.…”

Section: Technical Overviewsupporting

confidence: 51%

“…We now describe a naive extension of the [BS20, AP19] approach to the parallel setting (where a receiver interacts with multiple committers), and highlight its pitfalls. We do not assume familiarity with [BS20,AP19]. To commit to messages (m 1 , .…”

Section: A Strawman Solutionmentioning

confidence: 99%

“…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. Unfortunately, it is unclear whether these protocols compose under parallel repetition.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

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

Section: Technical Overviewsupporting

confidence: 51%

Section: A Strawman Solutionmentioning

confidence: 99%

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

show abstract

“…Moreover, to plug into the quantum OT protocol, we need a strong version of extractable commitments from which the committed values can be extracted efficiently without destroying or even disturbing the quantum states of the malicious committer, 2 a property that is at odds with quantum unclonability and rules out several extraction techniques used for achieving arguments of knowledge such as in [Unr12]. In particular, we are not aware of a construction of such extractable commitments without resorting to strong assumptions such as LWE [BS20,AP19], which takes us out of minicrypt. Another standard way to construct extractable commitments is using public-key encryption in the CRS model, which unfortunately again takes us out of minicrypt.…”

Section: Do Ot and Mpc Exist In Miniqcrypt?mentioning

confidence: 99%

Oblivious Transfer is in MiniQCrypt

Grilo¹,

Lin²,

Song³

et al. 2020

Preprint

View full text Add to dashboard Cite

MiniQCrypt is a world where quantum-secure one-way functions exist, and quantum communication is possible. We construct an oblivious transfer (OT) protocol in MiniQCrypt that achieves simulation-security in the plain model against malicious quantum polynomial-time adversaries, building on the foundational work of Bennett, Brassard, Crépeau and Skubiszewska (CRYPTO 1991). Combining the OT protocol with prior works, we obtain secure two-party and multi-party computation protocols also in MiniQCrypt. This is in contrast to the classical world, where it is widely believed that one-way functions alone do not give us OT.In the common random string model, we achieve a constant-round universally composable (UC) OT protocol.

show abstract

“…Post-Quantum Zero-Knowledge with Classical Computational Soundness. Ananth and La Placa [AP20] gave a construction of post-quantum ZK argument for NP with classical com-putational soundness assuming the QLWE assumption. Though such a protocol would be easy to obtain if we assume average-case classical hardness of certain problems in BQP (e.g., factoring) in addition to the QLWE assumption, what is interesting in [AP20] is that they only assume the QLWE assumption.…”

Section: Related Workmentioning

confidence: 99%

A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Rounds

Chia¹,

Chung²,

Yamakawa³

2020

Preprint

View full text Add to dashboard Cite

In a recent seminal work, Bitansky and Shmueli (STOC '20) gave the first construction of a constant round zero-knowledge argument for NP secure against quantum attacks. However, their construction has several drawbacks compared to the classical counterparts. Specifically, their construction only achieves computational soundness, requires strong assumptions of quantum hardness of learning with errors (QLWE assumption) and the existence of quantum fully homomorphic encryption (QFHE), and relies on non-black-box simulation.In this paper, we resolve these issues at the cost of weakening the notion of zero-knowledge to what is called ǫ-zero-knowledge. Concretely, we construct the following protocols:• We construct a constant round interactive proof for NP that satisfies statistical soundness and black-box ǫ-zero-knowledge against quantum attacks assuming the existence of collapsing hash functions, which is a quantum counterpart of collision-resistant hash functions. Interestingly, this construction is just an adapted version of the classical protocol by Goldreich and Kahan (JoC '96) though the proof of ǫ-zero-knowledge property against quantum adversaries requires novel ideas.• We construct a constant round interactive argument for NP that satisfies computational soundness and black-box ǫ-zero-knowledge against quantum attacks only assuming the existence of post-quantum one-way functions.At the heart of our results is a new quantum rewinding technique that enables a simulator to extract a committed message of a malicious verifier while simulating verifier's internal state in an appropriate sense.

show abstract

Secure Quantum Extraction Protocols

Cited by 14 publications

References 38 publications

Post-Quantum Multi-Party Computation

Post-Quantum Multi-Party Computation

Oblivious Transfer is in MiniQCrypt

A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Rounds

Contact Info

Product

Resources

About