Minimum-Knowledge Interactive Proofs for Decision Problems

DOI10.1137/0218049zbMath0678.94007OpenAlexW2019573778MaRDI QIDQ3835409

Stuart Haber, Mordechai M. Yung, Zvi Galil

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)

Related Items (5)

Proving Without Knowing: On Oblivious, Agnostic and Blindfolded Provers ⋮ Practical proofs of knowledge without relying on theoretical proofs of membership on languages ⋮ Efficient Dynamic-Resharing “Verifiable Secret Sharing” against mobile adversary ⋮ 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