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

Science China Information Sciences

Precise bounded-concurrent zero-knowledge proofs for NP

Ning Ding, Dawu Gu

Published Sep 1, 2010• 0 citations
Publisher
DOI
10.1007/s11432-010-4056-z

Related papers

Removing Complexity Assumptions from Concurrent Zero-Knowledge Proofs

Giovanni Di Crescenzo

Lecture notes in computer science•Jan 1, 2000•3 citations

Concurrent Non-Malleable Zero Knowledge Proofs

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

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

Constant-round adaptive zero-knowledge proofs for NP

Zongyang Zhang, Zhenfu Cao, Haojin Zhu

Information Sciences•Sep 4, 2013•4 citations

Toward Non-interactive Zero-Knowledge Proofs for NP from LWE

Ron D. Rothblum, Adam Sealfon, Katerina Sotiraki

Journal of Cryptology•Jan 1, 2021•8 citations

Noninteractive Zero Knowledge Proof System for NP from Ring LWE.

Wenping Ma

•Jan 1, 2019•0 citations

Precise Concurrent Zero Knowledge

Omkant Pandey, Rafael Pass, Amit Sahai +2 more

Lecture notes in computer science•Jan 1, 2008•22 citations