139 search results - page 1 / 28 » Zero-Knowledge |
CRYPTO
1998
Springer
14 years 3 months ago
1998
Springer
STOC
2006
ACM
14 years 11 months ago
2006
ACM
TARK
2009
Springer
14 years 5 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...
STOC
2006
ACM
14 years 11 months ago
2006
ACM
We prove that every problem in NP that has a zero-knowledge proof also has a zero-knowledge proof where the prover can be implemented in probabilistic polynomial time given an NP ...
CRYPTO
2000
Springer
14 years 3 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...