3 search results - page 1 / 1 » Private Coins versus Public Coins in Zero-Knowledge Proof Sy... |
TCC
2010
Springer
14 years 1 months ago
2010
Springer
Goldreich-Krawczyk (Siam J of Comp’96) showed that only languages in BPP have constant-round public-coin black-box zero-knowledge protocols. We extend their lower bound to “ful...
EUROCRYPT
2007
Springer
13 years 10 months ago
2007
Springer
We give a complexity-theoretic characterization of the class of problems in NP having zero-knowledge argument systems. This characterization is symmetric in its treatment of the ze...
FC
2000
Springer
13 years 8 months ago
2000
Springer
Auditability is an important property in nancial systems and architectures. Here we de ne the primitive of blind auditable membership proof" BAMP which combines public auditab...