Show simple item record

dc.contributor.authorChung, Kai-Min
dc.contributor.authorLin, Huijia
dc.contributor.authorPass, Rafael
dc.date.accessioned2012-10-02T19:37:33Z
dc.date.available2012-10-02T19:37:33Z
dc.date.issued2012-10-02
dc.identifier.urihttps://hdl.handle.net/1813/30398
dc.description.abstractWe 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$.en_US
dc.language.isoen_USen_US
dc.subjectConcurrent ZKen_US
dc.subjectFalsifiable Assumptionen_US
dc.subjectP-Certificatesen_US
dc.subjectNon-Black-Box Simulationen_US
dc.titleConstant-Round Concurrent Zero-Knowledge From Falsifiable Assumptionsen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics