On concurrent zero-knowledge with pre-processing. (Extended abstract)
From MaRDI portal
Recommendations
- Concurrent zero knowledge, revisited
- The power of preprocessing in zero-knowledge proofs of knowledge
- Concurrent zero-knowledge. With additional background by Oded Goldreich
- scientific article; zbMATH DE number 1759795
- scientific article; zbMATH DE number 1696658
- On the concurrent composition of zero-knowledge proofs
- Automata, Languages and Programming
- Theory of Cryptography
- On constant-round concurrent zero-knowledge from a knowledge assumption
- On Constant-Round Concurrent Zero-Knowledge
Cited in
(11)- The power of preprocessing in zero-knowledge proofs of knowledge
- On the concurrent composition of quantum zero-knowledge
- Concurrent zero-knowledge. With additional background by Oded Goldreich
- Concurrent knowledge extraction in public-key models
- scientific article; zbMATH DE number 1676661 (Why is no real title available?)
- Client-server concurrent zero knowledge with constant rounds and guaranteed complexity
- Efficient concurrent zero-knowledge in the auxiliary string model
- Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model
- Eye for an eye: efficient concurrent zero-knowledge in the timing model
- Concurrent zero-knowledge: Reducing the need for timing constraints
- Constant-round adaptive zero-knowledge proofs for NP
This page was built for publication: On concurrent zero-knowledge with pre-processing. (Extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4941875)