{"author":[{"last_name":"Almeida","full_name":"Almeida, José Bacelar","first_name":"José"},{"first_name":"Endre","full_name":"Bangerter, Endre","last_name":"Bangerter"},{"full_name":"Barbosa, Manuel","last_name":"Barbosa","first_name":"Manuel"},{"id":"329FCCF0-F248-11E8-B48F-1D18A9856A87","first_name":"Stephan","full_name":"Stephan Krenn","last_name":"Krenn","orcid":"0000-0003-2835-9093"},{"last_name":"Sadeghi","full_name":"Sadeghi, Ahmad-Reza","first_name":"Ahmad"},{"last_name":"Schneider","full_name":"Schneider, Thomas","first_name":"Thomas"}],"date_published":"2010-08-30T00:00:00Z","main_file_link":[{"open_access":"1","url":"http://eprint.iacr.org/2010/339.pdf"}],"day":"30","year":"2010","type":"conference","status":"public","date_created":"2018-12-11T12:00:40Z","alternative_title":["LNCS"],"page":"151 - 167","date_updated":"2021-01-12T07:40:13Z","month":"08","volume":6345,"_id":"2979","quality_controlled":0,"title":"A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on Sigma-Protocols","intvolume":"      6345","publisher":"Springer","publist_id":"3724","abstract":[{"lang":"eng","text":"Zero-knowledge proofs of knowledge (ZK-PoK) are important building blocks for numerous cryptographic applications. Although ZK-PoK have a high potential impact, their real world deployment is  typically hindered by their significant complexity compared to other (non-interactive) crypto primitives. Moreover, their design and implementation are time-consuming and error-prone.\n\nWe contribute to overcoming these challenges as follows: We present a comprehensive specification language and a compiler for ZK-PoK protocols based on Σ-protocols. The compiler allows the fully automatic translation of an abstract description of a proof goal into an executable implementation. Moreover, the compiler overcomes various restrictions of previous approaches, e.g., it supports the important class of exponentiation homomorphisms with hidden-order co-domain,  needed for privacy-preserving applications such as DAA. Finally, our compiler is certifying, in the sense that it automatically produces a formal proof of the soundness of the compiled protocol for a large class of protocols using the Isabelle/HOL theorem prover. \n"}],"extern":1,"oa":1,"conference":{"name":"ESORICS: European Symposium on Research in Computer Security"},"publication_status":"published","citation":{"apa":"Almeida, J., Bangerter, E., Barbosa, M., Krenn, S., Sadeghi, A., &#38; Schneider, T. (2010). A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on Sigma-Protocols. In D. Gritzalis, B. Preneel, &#38; M. Theoharidou (Eds.) (Vol. 6345, pp. 151–167). Presented at the ESORICS: European Symposium on Research in Computer Security, Springer. <a href=\"https://doi.org/10.1007/978-3-642-15497-3\">https://doi.org/10.1007/978-3-642-15497-3</a>","short":"J. Almeida, E. Bangerter, M. Barbosa, S. Krenn, A. Sadeghi, T. Schneider, in:, D. Gritzalis, B. Preneel, M. Theoharidou (Eds.), Springer, 2010, pp. 151–167.","ista":"Almeida J, Bangerter E, Barbosa M, Krenn S, Sadeghi A, Schneider T. 2010. A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on Sigma-Protocols. ESORICS: European Symposium on Research in Computer Security, LNCS, vol. 6345, 151–167.","mla":"Almeida, José, et al. <i>A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on Sigma-Protocols</i>. Edited by Dimitris Gritzalis et al., vol. 6345, Springer, 2010, pp. 151–67, doi:<a href=\"https://doi.org/10.1007/978-3-642-15497-3\">10.1007/978-3-642-15497-3</a>.","chicago":"Almeida, José, Endre Bangerter, Manuel Barbosa, Stephan Krenn, Ahmad Sadeghi, and Thomas Schneider. “A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on Sigma-Protocols.” edited by Dimitris Gritzalis, Bart Preneel, and Marianthi Theoharidou, 6345:151–67. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15497-3\">https://doi.org/10.1007/978-3-642-15497-3</a>.","ieee":"J. Almeida, E. Bangerter, M. Barbosa, S. Krenn, A. Sadeghi, and T. Schneider, “A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on Sigma-Protocols,” presented at the ESORICS: European Symposium on Research in Computer Security, 2010, vol. 6345, pp. 151–167.","ama":"Almeida J, Bangerter E, Barbosa M, Krenn S, Sadeghi A, Schneider T. A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on Sigma-Protocols. In: Gritzalis D, Preneel B, Theoharidou M, eds. Vol 6345. Springer; 2010:151-167. doi:<a href=\"https://doi.org/10.1007/978-3-642-15497-3\">10.1007/978-3-642-15497-3</a>"},"editor":[{"full_name":"Gritzalis, Dimitris","last_name":"Gritzalis","first_name":"Dimitris"},{"first_name":"Bart","last_name":"Preneel","full_name":"Preneel, Bart"},{"full_name":"Theoharidou, Marianthi","last_name":"Theoharidou","first_name":"Marianthi"}],"doi":"10.1007/978-3-642-15497-3","acknowledgement":"This work was in part funded by the European Community's Seventh Framework Programme (FP7) under grant agreement no. 216499.\nA preliminary version of the compiler can be found at http://zkc.cace-project.eu."}