2576 search results - page 6 / 516 » The Complexity of Zero Knowledge |
TARK
2009
Springer
15 years 4 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
15 years 9 months ago
2006
ACM
STOC
2006
ACM
15 years 9 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 ...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Abstract--Space-Time Block Codes from square complex orthogonal designs (SCOD) have been extensively studied and most of the existing SCODs contain large number of zero. The zeros ...
107
Voted
AFRICACRYPT
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We present a simple zero-knowledge proof of knowledge protocol of which many protocols in the literature are instantiations. These include Schnorr’s protocol for provin...