Searching for "Lower Bounds For Concurrent Zero Knowledge*." – sorted by Relevance.
-
Lower Bounds for Concurrent Zero Knowledge
- Lower Bounds for Concurrent Zero Knowledge Joe Kilian y Erez Petrank z Charles Rackoff x
- Cited by 3 (2 self) – Add To MetaCart
-
Responsive Round Complexity and Concurrent ZeroKnowledge
- . Kilian, Petrank, and Rackoff [19] gave the first lower bound for concurrent zero-knowledge, showing
- Cited by 5 (3 self) – Add To MetaCart
-
Concurrent and Resettable Zero-Knowledge in Poly-logarithmic Rounds (Extended Abstract)
- setting. Kilian, Petrank, and Rackoff [24] gave the first lower bound for concurrent zero-knowledge
- Cited by 30 (2 self) – Add To MetaCart
-
Concurrent Zero-Knowledge Proofs for NP
- ], building on techniques from [19], gave the rst lower bound for concurrent zero-knowledge, showing that any
- Add To MetaCart
-
On Concurrent and Resettable Zero-Knowledge Proofs for NP
- the rst lower bound for concurrent zero-knowledge, showing that any language that has a 4-rounds
- Cited by 1 (0 self) – Add To MetaCart

