Zero-knowledge proofs via polynomial representations

DOI10.1007/978-3-642-32589-2_31MaRDI QIDQ2912732zbMATH OpenOpenAlexFDO

Authors Giovanni Di Crescenzo, Vadym Fedyukovych

Publication date 25 September 2012

Published in Mathematical Foundations of Computer Science 2012 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32589-2_31

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1302863
• Zero-knowledge proofs from secure multiparty computation
• Subquadratic zero-knowledge
• scientific article; zbMATH DE number 4191106
• scientific article; zbMATH DE number 1559559

Cited in

(6)

• Zero-knowledge for multivariate polynomials
• Zero-knowledge proof protocol of the roots of polynomial functions
• Polynomial-Space Approximation of No-Signaling Provers
• scientific article; zbMATH DE number 1302863 (Why is no real title available?)
• Malleable commitments from group actions and zero-knowledge proofs for circuits based on isogenies
• \textsc{Zeromorph}: zero-knowledge multilinear-evaluation proofs from homomorphic univariate commitments

This page was built for publication: Zero-knowledge proofs via polynomial representations

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