Sciweavers

7 search results - page 2 / 2
» Lower Bounds for Non-interactive Zero-Knowledge
Sort
View
ASIACRYPT
2001
Springer
15 years 2 months ago
Responsive Round Complexity and Concurrent Zero-Knowledge
The number of communication rounds is a classic complexity measure for protocols; reducing round complexity is a major goal in protocol design. However, when the communication time...
Tzafrir Cohen, Joe Kilian, Erez Petrank
TCC
2009
Springer
158views Cryptology» more  TCC 2009»
15 years 10 months ago
On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols
The concept of witness-hiding suggested by Feige and Shamir is a natural relaxation of zero-knowledge. In this paper we identify languages and distributions for which many known co...
Iftach Haitner, Alon Rosen, Ronen Shaltiel