Subquadratic zero-knowledge

DOI10.1145/227683.227686MaRDI QIDQ4369895zbMATH OpenOpenAlexWikidataFDO

Authors Gilles Brassard, René Peralta, Joan Boyar

Publication date 28 January 1998

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/227683.227686

zbMATH Keywords

communication complexityzero-knowledge proof systems

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Recommendations

• scientific article; zbMATH DE number 1559559
• On the communication complexity of zero-knowledge proofs
• scientific article; zbMATH DE number 1302863

Cited in

(15)

• On the communication complexity of zero-knowledge proofs
• Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
• Mathematical problems in cryptology
• Zero-knowledge proofs via polynomial representations
• Efficient generic zero-knowledge proofs from commitments (extended abstract)
• On the state of strength-three covering arrays
• On the Amortized Complexity of Zero-Knowledge Protocols
• Structures and lower bounds for binary covering arrays
• scientific article; zbMATH DE number 1559559 (Why is no real title available?)
• scientific article; zbMATH DE number 1406780 (Why is no real title available?)
• On the amortized complexity of zero knowledge protocols for multiplicative relations
• \(H\)-wise independence
• Slow motion zero knowledge identifying with colliding commitments
• Zero-knowledge arguments for subverted RSA groups
• Commitments with efficient zero-knowledge arguments from subset sum problems

This page was built for publication: Subquadratic zero-knowledge

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4369895)