On separating proofs of knowledge from proofs of membership of languages and its application to secure identification schemes
From MaRDI portal
Publication:6064047
DOI10.1007/bfb0030871zbMath1527.68073OpenAlexW1592444995MaRDI QIDQ6064047
Publication date: 12 December 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0030871
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60)
Cites Work
- Constant-round perfect zero-knowledge computationally convincing protocols
- Does co-NP have short interactive proofs ?
- Zero-knowledge proofs of identity
- An interactive identification scheme based on discrete logarithms and factoring
- Round-optimal perfect zero-knowledge proofs
- The knowledge complexity of quadratic residuosity languages
- Practical proofs of knowledge without relying on theoretical proofs of membership on languages
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- The Knowledge Complexity of Interactive Proof Systems
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On separating proofs of knowledge from proofs of membership of languages and its application to secure identification schemes
