On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations release_pxbk5jgmjff6rdeqrmfsdr7yii

by S. Dov Gordon, Hoeteck Wee, David Xiao, Arkady Yerukhimovich

Published in Lecture Notes in Computer Science by Springer Berlin Heidelberg.

2010   p189-204

Archived Files and Locations

application/pdf  168.3 kB
file_nhyqdtbugna5df5qefb73ochmm
web.archive.org (webarchive)
www.cs.princeton.edu (web)
application/pdf  387.2 kB
file_gn3zdso7rjgmdcaalvx2n2l3oe
web.archive.org (webarchive)
www.cs.umd.edu (web)
web.archive.org (webarchive)
web.archive.org (webarchive)
www.di.ens.fr (web)
+ 2 more URLs
Read Archived PDF
Preserved and Accessible
Type  chapter
Stage   published
Year   2010
Container Metadata
Not in DOAJ
Not in Keepers Registry
ISSN-L:  0302-9743
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 7bea90eb-10a1-47de-bc44-57423031b754
API URL: JSON