The knowledge complexity of quadratic residuosity languages
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3482343 (Why is no real title available?)
- scientific article; zbMATH DE number 708823 (Why is no real title available?)
- scientific article; zbMATH DE number 4185024 (Why is no real title available?)
- Constant-round perfect zero-knowledge computationally convincing protocols
- Does co-NP have short interactive proofs ?
- Fast probabilistic algorithms for Hamiltonian circuits and matchings
- How to share a secret
- Minimum disclosure proofs of knowledge
- Noninteractive Zero-Knowledge
- Practic zero-knowledge proofs: Giving hints and using deficiencies
- Probabilistic encryption
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- The Lattice Point Covering Theorem for Rectangles
- The knowledge complexity of interactive proof-systems
Cited in
(11)- Practical proofs of knowledge without relying on theoretical proofs of membership on languages
- Randomness-efficient non-interactive zero knowledge
- How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge
- Efficient Non-interactive Range Proof
- On server trust in private proxy auctions
- On separating proofs of knowledge from proofs of membership of languages and its application to secure identification schemes
- scientific article; zbMATH DE number 4053065 (Why is no real title available?)
- How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge
- Which languages have 4-round zero-knowledge proofs?
- Mathematical Foundations of Computer Science 2004
- Improvements on non-interactive zero-knowledge proof systems related to quadratic residuosity languages
This page was built for publication: The knowledge complexity of quadratic residuosity languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1334668)