On the round complexity of zero-knowledge proofs based on one-way permutations
From MaRDI portal
Recommendations
- Round-optimal fully black-box zero-knowledge arguments from one-way permutations
- Round-optimal zero-knowledge proofs of knowledge for NP
- On the existence of three round zero-knowledge proofs
- How to construct constant-round zero-knowledge proof systems for NP
- Lower bounds for non-black-box zero knowledge
Cited in
(12)- Perfect zero-knowledge arguments for NP using any one-way permutation
- Round-optimal fully black-box zero-knowledge arguments from one-way permutations
- Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions?
- On the possibility of basing cryptography on \(\mathsf{EXP}\ne \mathsf{BPP} \)
- On the implausibility of constant-round public-coin zero-knowledge proofs
- Private coins versus public coins in zero-knowledge proof systems
- Round-optimal zero-knowledge proofs of knowledge for NP
- Which languages have 4-round zero-knowledge proofs?
- Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
- The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization
- Theory of Cryptography
- Full round zero-sum distinguishers on \textsf{TinyJAMBU}-128 and \textsf{TinyJAMBU}-192 keyed-permutation in the known-key setting
This page was built for publication: On the round complexity of zero-knowledge proofs based on one-way permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3584983)
