scientific article; zbMATH DE number 177018

MaRDI QIDQ4036854zbMATH OpenFDO

Authors M. V. D. Burmester, Yvo Desmedt

Publication date 18 May 1993

zbMATH Keywords

graph isomorphismprobability encryption homomorphismsSATzero-knowledge proof

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Cryptography (94A60)

Recommendations

• Divertible and subliminal-free zero-knowledge proofs for languages
• scientific article; zbMATH DE number 4211487
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• scientific article; zbMATH DE number 3999326
• scientific article; zbMATH DE number 4185024

Cited in

(4)

• Divertible and subliminal-free zero-knowledge proofs for languages
• Message transmission with reverse firewalls -- secure communication on corrupted machines
• scientific article; zbMATH DE number 4211487 (Why is no real title available?)
• scientific article; zbMATH DE number 503348 (Why is no real title available?)

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 Q4036854)