Impossibility and Feasibility Results for Zero Knowledge with Public Keys
From MaRDI portal
Publication:5451023
Recommendations
- Advances in Cryptology – CRYPTO 2004
- Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model
- On round-optimal zero knowledge in the bare public-key model
- Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model under Standard Assumption
- Automata, Languages and Programming
Cited in
(9)- The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization
- Knowledge encryption and its applications to simulatable protocols with low round-complexity
- Smooth zero-knowledge hash functions
- scientific article; zbMATH DE number 2196514 (Why is no real title available?)
- On the Impossibility of Private Key Cryptography with Weakly Random Keys
- Individual simulations
- Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model
- Improved Setup Assumptions for 3-Round Resettable Zero Knowledge
- Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
This page was built for publication: Impossibility and Feasibility Results for Zero Knowledge with Public Keys
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5451023)