Essam Ghadafi Essam.Ghadafi@uwe.ac.uk
Senior Lecturer in Computer Science
Practical zero-knowledge proofs for circuit evaluation
Ghadafi, Essam; Smart, Nigel P.; Warinschi, Bogdan
Authors
Nigel P. Smart
Bogdan Warinschi
Contributors
M.G Parker
Editor
Abstract
Showing that a circuit is satisfiable without revealing information is a key problem in modern cryptography. The related (and more general) problem of showing that a circuit evaluates to a particular value if executed on the input contained in a public commitment has potentially multiple practical applications. Although numerous solutions for the problem had been proposed, their practical applicability is poorly understood. In this paper, we take an important step towards moving existent solutions to practice. We implement and evaluate four solutions for the problem. We investigate solutions both in the common reference string model and the random oracle model. In particular, in the CRS model we use the recent techniques of Groth-Sahai for proofs that use bilinear groups in the asymmetric pairings environment. We provide various optimizations to the different solutions we investigate. We present timing results for two circuits the larger of which is an implementation of AES that uses about 30000 gates. © 2009 Springer-Verlag.
Presentation Conference Type | Conference Paper (published) |
---|---|
Conference Name | IMA International Conference on Cryptography and Coding |
Start Date | Dec 15, 2009 |
End Date | Dec 17, 2009 |
Acceptance Date | Dec 1, 2009 |
Publication Date | Dec 28, 2009 |
Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
Print ISSN | 0302-9743 |
Publisher | Springer Verlag |
Peer Reviewed | Peer Reviewed |
Volume | 5921 LNCS |
Pages | 469-494 |
ISBN | ; |
DOI | https://doi.org/10.1007/978-3-642-10868-6_28 |
Keywords | practical, zero-knowledge, proofs, circuit evaluation |
Public URL | https://uwe-repository.worktribe.com/output/989777 |
Publisher URL | http://dx.doi.org/10.1007/978-3-642-10868-6_28 |
Additional Information | Title of Conference or Conference Proceedings : IMA International Conference on Cryptography and Coding |
You might also like
Efficient round-optimal blind signatures in the standard model
(2017)
Book Chapter
Anonymous attestation with user-controlled linkability
(2013)
Journal Article
Foundations of fully dynamic group signatures
(2020)
Journal Article
Downloadable Citations
About UWE Bristol Research Repository
Administrator e-mail: repository@uwe.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search