Sciweavers

Share
37 search results - page 1 / 8
» Optimistic Concurrent Zero Knowledge
Sort
View
ASIACRYPT
2010
Springer
9 years 12 days ago
Optimistic Concurrent Zero Knowledge
We design cryptographic protocols that recognize best case (optimistic) situations and exploit them. As a case study, we present a new concurrent zeroknowledge protocol that is exp...
Alon Rosen, Abhi Shelat
CRYPTO
2000
Springer
182views Cryptology» more  CRYPTO 2000»
9 years 6 months ago
A Note on the Round-Complexity of Concurrent Zero-Knowledge
Abstract. We present a lower bound on the number of rounds required by Concurrent Zero-Knowledge proofs for languages in NP. It is shown that in the context of Concurrent Zero-Know...
Alon Rosen
TARK
2009
Springer
9 years 9 months ago
An epistemic characterization of zero knowledge
Halpern, Moses and Tuttle presented a definition of interactive proofs using a notion they called practical knowledge, but left open the question of finding an epistemic formula...
Joseph Y. Halpern, Rafael Pass, Vasumathi Raman
FOCS
2002
IEEE
9 years 7 months ago
Concurrent Zero Knowledge with Logarithmic Round-Complexity
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using ˜O(log n) rounds of interaction. The number of rounds in our protocol is optimal,...
Manoj Prabhakaran, Alon Rosen, Amit Sahai
EUROCRYPT
2008
Springer
9 years 4 months ago
Precise Concurrent Zero Knowledge
Precise zero knowledge introduced by Micali and Pass (STOC'06) guarantees that the view of any verifier V can be simulated in time closely related to the actual (as opposed t...
Omkant Pandey, Rafael Pass, Amit Sahai, Wei-Lung D...
books