scientific article; zbMATH DE number 1107670

MaRDI QIDQ4373608zbMATH OpenFDO

Authors Giovanni Di Crescenzo, Kouichi Sakurai, Moti Yung

Publication date 11 June 1998

zbMATH Keywords

perfect zero-knowledge proof systems

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1136088
• The knowledge complexity of quadratic residuosity languages
• On zero-knowledge proofs (extended abstract)

Cited in

(9)

• New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
• Advances in Cryptology – CRYPTO 2004
• Direct Zero Knowledge Proofs of Computational Power in Five Rounds
• Promise zero knowledge and its applications to round optimal MPC
• Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
• Perfect zero knowledge: new upperbounds and relativized separations
• Which Languages Have 4-Round Zero-Knowledge Proofs?
• On zero-knowledge proofs (extended abstract)
• Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions

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