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

Electronic colloquium on computational complexity

Constant-Round Concurrently-Secure rZK in the (Real) Bare Public-Key Model

Moti M. Yung, Yunlei Zhao

Published Jan 1, 2005• 1 citation
OpenAlex

Related papers

Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model

Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti

Lecture notes in computer science•Aug 12, 2008•28 citations

Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model

Giovanni Di Crescenzo, Giuseppe Persiano, Ivan Visconti

Lecture notes in computer science•Jan 1, 2004•59 citations

Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model

Yi Deng, Giovanni Di Crescenzo, Dongdai Lin +1 more

Lecture notes in computer science•Jan 1, 2009•1 citation

Concurrently Secure Computation in Constant Rounds

Sanjam Garg, Vipul Goyal, Abhishek Jain +1 more

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

On Round-Optimal Zero Knowledge in the Bare Public-Key Model

Alessandra Scafuro, Ivan Visconti

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

Concurrent Zero Knowledge in the Public-Key Model

Giovanni Di Crescenzo, Ivan Visconti

Lecture notes in computer science•Jan 1, 2005•25 citations