Minimum-Knowledge Interactive Proofs for Decision Problems

DOI10.1137/0218049MaRDI QIDQ3835409zbMATH OpenOpenAlexFDO

Authors Stuart Haber, Zvi Galil, Moti Yung

Publication date 1989

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0218049

zbMATH Keywords

computational complexityinteractive proof systemtheory of knowledgetwo-party protocolcryptographic applicationsminimum-knowledgeresult-indistinguishable

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Minimum disclosure proofs of knowledge
• The Knowledge Complexity of Interactive Proof Systems
• The knowledge complexity of interactive proof-systems
• scientific article; zbMATH DE number 3999326
• Noninteractive Zero-Knowledge

Cited in

(8)

• Efficient Dynamic-Resharing “Verifiable Secret Sharing” against mobile adversary
• scientific article; zbMATH DE number 708824 (Why is no real title available?)
• Secure circuit evaluation. A protocol based on hiding information from an oracle
• Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
• Proving without knowing: on oblivious, agnostic and blindfolded provers
• Practical proofs of knowledge without relying on theoretical proofs of membership on languages
• scientific article; zbMATH DE number 3999326 (Why is no real title available?)
• Minimum disclosure proofs of knowledge

This page was built for publication: Minimum-Knowledge Interactive Proofs for Decision Problems

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