Show simple item record

dc.contributor.authorMicali, Silvioen_US
dc.contributor.authorReyzin, Leoniden_US
dc.date.accessioned2023-03-29T14:41:58Z
dc.date.available2023-03-29T14:41:58Z
dc.date.issued2000-08
dc.identifier.urihttps://hdl.handle.net/1721.1/149299
dc.description.abstractWe propose a four-round protocol for concurrent and resettable zero-knowledge arguments for any langauge in NP, assuming the verifier has a pre-registered public-key. We also propose a three-round protocol with an additional timing assumption.en_US
dc.relation.ispartofseriesMIT-LCS-TM-609
dc.titleConcurrent/Resettable Zero-Knowledge Protocols for NP in the Public Key Modelen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record