A note on the round-complexity of concurrent zero-knowledge
From MaRDI portal
Recommendations
- Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
- The knowledge tightness of parallel zero-knowledge
- Black-box concurrent zero-knowledge requires \(\tilde{\omega}(\log n)\) rounds
- Concurrent and resettable zero-knowledge in poly-logarithmic rounds
- Lower bounds for concurrent zero knowledge
Cited in
(20)- Random walks and concurrent zero-knowledge
- Concurrent zero knowledge, revisited
- Lower bounds for non-black-box zero knowledge
- The round complexity of quantum zero-knowledge
- Client-server concurrent zero knowledge with constant rounds and guaranteed complexity
- On Efficient Zero-Knowledge PCPs
- On constant-round concurrent zero-knowledge from a knowledge assumption
- Eye for an eye: efficient concurrent zero-knowledge in the timing model
- Leakproof secret sharing protocols with applications to group identification scheme
- scientific article; zbMATH DE number 2081079 (Why is no real title available?)
- Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
- Concurrent zero knowledge in the bounded player model
- On concurrent zero-knowledge with pre-processing. (Extended abstract)
- Concurrent and resettable zero-knowledge in poly-logarithmic rounds
- Black-box concurrent zero-knowledge requires \(\tilde{\omega}(\log n)\) rounds
- The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization
- On Constant-Round Concurrent Zero-Knowledge
- Automata, Languages and Programming
- Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
- Lower bounds for concurrent zero knowledge
This page was built for publication: A note on the round-complexity of concurrent zero-knowledge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536818)
