Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

On Zero Knowledge Argument with PQT Soundness

Guifang Huang, Hongda Li

Published Jan 1, 2016• 0 citations
Publisher
DOI
10.1007/978-3-319-31875-2_27

Related papers

Efficient Lattice-Based Zero-Knowledge Arguments with Standard Soundness: Construction and Applications

Rupeng Yang, Man Ho Au, Zhenfei Zhang +3 more

Lecture notes in computer science•Jan 1, 2019•114 citations

Non-interactive Zero-Knowledge Arguments for QMA, with Preprocessing

Andrea Coladangelo, Thomas Vidick, Tina Zhang

Lecture notes in computer science•Jan 1, 2020•33 citations

Concurrent Zero Knowledge, Revisited

Rafael Pass, Wei-Lung Dustin Tseng, Muthuramakrishnan Venkitasubramaniam

Journal of Cryptology•Nov 17, 2012•20 citations

Classical zero-knowledge arguments for quantum computations

Thomas Vidick, Tina Zhang

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).

arXiv:1902.05217•Quantum•May 14, 2020•26 citations

Concurrent/Resettable Zero-Knowledge With Concurrent Soundness in the Bare Public-Key Model and Its Applications.

Yunlei Zhao

In this paper, we present both practical and general 4-round concurrent and resettable zeroknowledge arguments with concurrent soundness in the bare public-key (BPK) model. To our knowledge, our result is the first work that achieves concurrent soundness for ZK protocols in the BPK model and stands for the current state-of-the-art of concurrent zero-knowledge with setup assumptions.

•Jan 1, 2003•12 citations

A Constant-Round Resettably-Sound Resettable Zero-Knowledge Argument in the BPK Model

Seiko Arita

In resetting attacks against a proof system, a prover or a verifier is reset and enforced to use the same random tape on various inputs as many times as an adversary may want. Recent deployment of cloud computing gives these attacks a new importance. This paper shows that argument systems for any NP language that are both resettably-sound and resettable zero-knowledge are possible by a constant-round protocol in the BPK model. For that sake, we define and construct a resettably-extractable conditional commitment scheme.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Jan 1, 2012•4 citations
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).
In resetting attacks against a proof system, a prover or a verifier is reset and enforced to use the same random tape on various inputs as many times as an adversary may want. Recent deployment of cloud computing gives these attacks a new importance. This paper shows that argument systems for any NP language that are both resettably-sound and resettable zero-knowledge are possible by a constant-round protocol in the BPK model. For that sake, we define and construct a resettably-extractable conditional commitment scheme.