Concurrent zero knowledge in the bounded player model
From MaRDI portal
Recommendations
- Constant-round concurrent zero knowledge in the bounded player model
- Bounded-concurrent secure multi-party computation with a dishonest majority
- Concurrent zero knowledge in the public-key model
- Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
- A note on the round-complexity of concurrent zero-knowledge
Cited in
(4)
This page was built for publication: Concurrent zero knowledge in the bounded player model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4910271)