Novel -protocols for NP
From MaRDI portal
Publication:2480118
Recommendations
- A one-round, two-prover, zero-knowledge protocol for NP
- Relativistic (or 2-prover 1-round) zero-knowledge protocol for \(\mathsf {NP}\) secure against quantum adversaries
- Round-optimal zero-knowledge proofs of knowledge for NP
- scientific article; zbMATH DE number 94166
- Improved OR-composition of sigma-protocols
Cites work
- scientific article; zbMATH DE number 708820 (Why is no real title available?)
- scientific article; zbMATH DE number 2009955 (Why is no real title available?)
- scientific article; zbMATH DE number 2009957 (Why is no real title available?)
- scientific article; zbMATH DE number 1775426 (Why is no real title available?)
- scientific article; zbMATH DE number 1842511 (Why is no real title available?)
- scientific article; zbMATH DE number 1406779 (Why is no real title available?)
- Advances in Cryptology – CRYPTO 2004
- Black-box concurrent zero-knowledge requires \(\tilde{\omega}(\log n)\) rounds
- Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
- Foundations of Cryptography
- New and improved constructions of non-malleable cryptographic protocols
- Nonmalleable Cryptography
- Probabilistic encryption
- The Knowledge Complexity of Interactive Proof Systems
- The Notion of Security for Probabilistic Cryptosystems
This page was built for publication: Novel \(\Omega\)-protocols for NP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2480118)