Minimum-Knowledge Interactive Proofs for Decision Problems

DOI10.1137/0218049zbMATH Open0678.94007OpenAlexW2019573778MaRDI QIDQ3835409FDOQ3835409

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (8)

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

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)