Skip to main content


eCommons@Cornell

eCommons@Cornell >
Faculty of Computing and Information Science >
Computing and Information Science >
Computing and Information Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/30398
Title: Constant-Round Concurrent Zero-Knowledge From Falsifiable Assumptions
Authors: Chung, Kai-Min
Lin, Huijia
Pass, Rafael
Keywords: Concurrent ZK
Falsifiable Assumption
P-Certificates
Non-Black-Box Simulation
Issue Date: 2-Oct-2012
Abstract: We present a constant-round concurrent zero-knowledge protocol for $\NP$. Our protocol is sound against uniform polynomial-time attackers, and relies on the existence of families of collision-resistant hash functions, and a new (but in our eyes, natural) falsifiable intractability assumption: Roughly speaking, that Micali's non-interactive CS-proofs are sound for languages in $\P$.
URI: http://hdl.handle.net/1813/30398
Appears in Collections:Computing and Information Science Technical Reports

Files in This Item:

File Description SizeFormat
CZKfCSP.pdf567.68 kBAdobe PDFView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us