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

Removing Complexity Assumptions from Concurrent Zero-Knowledge Proofs: Extended Abstract

Giovanni Di Crescenzo

Published Jan 1, 2000• 3 citations
Publisher
DOI
10.1007/3-540-44968-x_42

Related papers

Concurrent Non-Malleable Zero Knowledge Proofs

Huijia Lin, Rafael Pass, Wei-Lung Dustin Tseng +1 more

Lecture notes in computer science•Jan 1, 2010•35 citations

Precise bounded-concurrent zero-knowledge proofs for NP

Ning Ding, Dawu Gu

Science China Information Sciences•Sep 1, 2010•1 citation

On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption

Divya Gupta, Amit Sahai

Lecture notes in computer science•Jan 1, 2014•16 citations

Zero-Knowledge Proofs with Low Amortized Communication from Lattice Assumptions

Ivan Damgård, Adriana López-Alt

Lecture notes in computer science•Jan 1, 2012•5 citations

Quantum Bit Commitment with Application in Quantum Zero-Knowledge Proof (Extended Abstract)

Jun Yan, Jian Weng, Dongdai Lin +1 more

Lecture notes in computer science•Jan 1, 2015•21 citations

Simplified design for concurrent statistical zero-knowledge arguments

Puwen Wei, Guoyan Zhang, Lijiang Zhang +1 more

This paper shows that the protocol presented by Goyal et al. can be further simplified for a one-way function, with the simplified protocol being more practical for the decisional Diffie-Hellman assumption. Goyal et al. provided a general transformation from any honest verifier statistical zero-knowledge argument to a concurrent statistical zero-knowledge argument. Their transformation relies only on the existence of one-way functions. For the simplified transformation, the witness indistinguishable proof of knowledge protocols in “parallel” not only plays the role of preamble but also removes some computational zero-knowledge proofs, which Goyal et al. used to prove the existence of the valid openings to the commitments. Therefore, although some computational zero-knowledge proofs are replaced with a weaker notion, the witness indistinguishable protocol, the proof of soundness can still go through.

Tsinghua Science & Technology•Apr 1, 2009•0 citations
This paper shows that the protocol presented by Goyal et al. can be further simplified for a one-way function, with the simplified protocol being more practical for the decisional Diffie-Hellman assumption. Goyal et al. provided a general transformation from any honest verifier statistical zero-knowledge argument to a concurrent statistical zero-knowledge argument. Their transformation relies only on the existence of one-way functions. For the simplified transformation, the witness indistinguishable proof of knowledge protocols in “parallel” not only plays the role of preamble but also removes some computational zero-knowledge proofs, which Goyal et al. used to prove the existence of the valid openings to the commitments. Therefore, although some computational zero-knowledge proofs are replaced with a weaker notion, the witness indistinguishable protocol, the proof of soundness can still go through.