scientific article; zbMATH DE number 94166

MaRDI QIDQ4019982zbMATH OpenFDO

Authors Valtteri Niemi

Publication date 16 January 1993

zbMATH Keywords

graph isomorphism problemHAMILTONIAN CYCLE problemnon-interactive zero-knowledge protocolszero-knowledge proofs

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Graph theory (including graph drawing) in computer science (68R10) Cryptography (94A60)

Recommendations

• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• A general zero-knowledge scheme
• Noninteractive Zero-Knowledge
• scientific article; zbMATH DE number 31277
• scientific article; zbMATH DE number 4053065

Cited in

(31)

• Practic zero-knowledge proofs: Giving hints and using deficiencies
• A general zero-knowledge scheme
• A one-round, two-prover, zero-knowledge protocol for NP
• Zero-knowledge proofs for committed symmetric Boolean functions
• Novel \(\Omega\)-protocols for NP
• Local zero knowledge
• The graph clustering problem has a perfect zero-knowledge interactive proof
• Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
• scientific article; zbMATH DE number 4211485 (Why is no real title available?)
• scientific article; zbMATH DE number 4211486 (Why is no real title available?)
• A Dolev-Yao model for zero knowledge
• scientific article; zbMATH DE number 4037759 (Why is no real title available?)
• Zero-Knowledge Simulation of Boolean Circuits
• scientific article; zbMATH DE number 4101089 (Why is no real title available?)
• The Knowledge Complexity of Interactive Proof Systems
• scientific article; zbMATH DE number 1304185 (Why is no real title available?)
• Zero-Knowledge Proofs
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• scientific article; zbMATH DE number 708808 (Why is no real title available?)
• scientific article; zbMATH DE number 2059223 (Why is no real title available?)
• scientific article; zbMATH DE number 1559565 (Why is no real title available?)
• Provably Hard Zero-Way Functions
• scientific article; zbMATH DE number 828007 (Why is no real title available?)
• A framework for non-interactive instance-dependent commitment schemes (NIC)
• An Equivalence Between Zero Knowledge and Commitments
• The Complexity of Zero Knowledge
• scientific article; zbMATH DE number 2196514 (Why is no real title available?)
• scientific article; zbMATH DE number 4185024 (Why is no real title available?)
• Information Security and Cryptology
• Sherlock Holmes zero-knowledge protocols
• Zero‐Knowledge Proofs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4019982)