Practical zero-knowledge proofs for circuit evaluation

DOI10.1007/978-3-642-10868-6_28MaRDI QIDQ3654635zbMATH OpenOpenAlexFDO

Authors Essam Ghadafi, Bogdan Warinschi, N. P. Smart

Publication date 7 January 2010

Published in Cryptography and Coding (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-10868-6_28

Mathematics Subject Classification ID

Cryptography (94A60) Analytic circuit theory (94C05)

Recommendations

• Efficient generic zero-knowledge proofs from commitments (extended abstract)
• Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
• scientific article; zbMATH DE number 1302863
• scientific article; zbMATH DE number 4191124
• On the amortized complexity of zero knowledge protocols for multiplicative relations

Cited in

(5)

• scientific article; zbMATH DE number 4211485 (Why is no real title available?)
• Practical and Employable Protocols for UC-Secure Circuit Evaluation over ℤn
• scientific article; zbMATH DE number 503349 (Why is no real title available?)
• Efficient NIZKs for algebraic sets
• Stronger security notions for decentralized traceable attribute-based signatures and more efficient constructions

This page was built for publication: Practical zero-knowledge proofs for circuit evaluation

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