Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

ECCC
2007

favoriteEmaildiscussreport

91views more ECCC 2007»

Which Languages Have 4-Round Zero-Knowledge Proofs?

13 years 4 months ago

Which Languages Have 4-Round Zero-Knowledge Proofs?

Download www.cs.umd.edu

We show that if a language L has a 4-round, black-box, computational zero-knowledge proof system with negligible soundness error, then ¯L ∈ MA. Assuming the polynomial hierarchy does not collapse, this means in particular that NP-complete languages do not have 4-round zero-knowledge proofs (at least with respect to black-box simulation).

Jonathan Katz

Real-time Traffic

4-round Zero-knowledge Proofs | Black-box | ECCC 2007 | Negligible Soundness Error |

claim paper

Related Content

» ZKPDL A LanguageBased System for Efficient ZeroKnowledge Proofs and Electronic Cash

» Increasing the Power of the Dealer in Noninteractive ZeroKnowledge Proof Systems

» Unconditional Characterizations of Noninteractive ZeroKnowledge

» ConstantRound Resettable Zero Knowledge with Concurrent Soundness in the Bare PublicKey Mo...

» A Note on the RoundComplexity of Concurrent ZeroKnowledge

» Private Coins versus Public Coins in ZeroKnowledge Proof Systems

» On the Round Complexity of ZeroKnowledge Proofs Based on OneWay Permutations

» On Monotone Formula Composition of Perfect ZeroKnowledge Languages

» Concise Mercurial Vector Commitments and Independent ZeroKnowledge Sets with Short Proofs

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	ECCC
Authors	Jonathan Katz

Comments (0)