Efficient zero-knowledge proofs for some practical graph problems

DOI10.1007/3-540-36413-7_21MaRDI QIDQ4414289zbMATH OpenFDO

Authors Y. Wang, Yvo Desmedt

Publication date 24 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2576/25760290.htm

zbMATH Keywords

complexitygraph theorykey-escrowsecret sharingZero-knowledge

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Efficient zero-knowledge proofs. (Abstract)
• Zero knowledge with efficient provers
• Card-based zero-knowledge proof protocols for graph problems and their computational model
• Composition of zero-knowledge proofs with efficient provers
• scientific article; zbMATH DE number 828007
• Efficient generic zero-knowledge proofs from commitments (extended abstract)
• scientific article; zbMATH DE number 4191124
• On Efficient Zero-Knowledge PCPs
• Round-optimal zero-knowledge proofs of knowledge for NP
• Efficient zero-knowledge proof systems

Cited in

(4)

• The graph clustering problem has a perfect zero-knowledge interactive proof
• scientific article; zbMATH DE number 1548176 (Why is no real title available?)
• A user authentication protocol based on the intractability of the 3-coloring problem
• Computer Aided Systems Theory – EUROCAST 2005

This page was built for publication: Efficient zero-knowledge proofs for some practical graph problems

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