Practical proofs of knowledge without relying on theoretical proofs of membership on languages

DOI10.1016/S0304-3975(96)00277-0zbMath0901.68049OpenAlexW2061404094MaRDI QIDQ1391315

Kouichi Sakurai

Publication date: 22 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00277-0

zbMATH Keywords

interactive protocols

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Data encryption (aspects in computer science) (68P25)

Related Items (1)

On separating proofs of knowledge from proofs of membership of languages and its application to secure identification schemes

Cites Work

• Constant-round perfect zero-knowledge computationally convincing protocols
• Statistical zero-knowledge languages can be recognized in two rounds
• Does co-NP have short interactive proofs ?
• Minimum disclosure proofs of knowledge
• 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
• Computational complexity and knowledge complexity (extended abstract)
• Minimum-Knowledge Interactive Proofs for Decision Problems
• Noninteractive Zero-Knowledge
• Cryptographic Applications of the Non-Interactive Metaproof and Many-prover Systems
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• The knowledge complexity of interactive proof-systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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: Practical proofs of knowledge without relying on theoretical proofs of membership on languages