Searching for "On the Communication Complexity of Zero-Knowledge Proofs." – sorted by Relevance.
-
Subquadratic Zero-Knowledge
- on the communication complexity of zero-knowledge proof systems. Let C be a boolean circuit of size n. Previous zero-knowledge
- Cited by 15 (3 self) – Add To MetaCart
-
Zero-Knowledge from Secure Multiparty Computation ∗ ABSTRACT
- zero-knowledge protocol with communication complexity m · poly(k) · polylog(s), where k is a security
- Cited by 1 (1 self) – Add To MetaCart

