32 search results - page 2 / 7 » Concurrent Non-Malleable Zero Knowledge |
ASIACRYPT
2010
Springer
13 years 3 months ago
2010
Springer
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...
TCC
2010
Springer
13 years 3 months ago
2010
Springer
TCC
2010
Springer
13 years 3 months ago
2010
Springer
CRYPTO
2000
Springer
13 years 9 months ago
2000
Springer
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...
TARK
2009
Springer
13 years 11 months ago
2009
Springer
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...