scientific article; zbMATH DE number 177018

zbMATH Open0788.68037MaRDI QIDQ4036854FDOQ4036854

Authors: M. V. D. Burmester, Yvo Desmedt 

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

SATgraph isomorphismzero-knowledge proofprobability encryption homomorphisms

Mathematics Subject Classification ID

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

Cited In (1)

• Message transmission with reverse firewalls -- secure communication on corrupted machines

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)