{"date_updated":"2021-01-12T07:40:13Z","month":"10","title":"Automatic Generation of Sigma-Protocols","publisher":"Springer","page":"67 - 82","status":"public","doi":"10.1007/978-3-642-16441-5","main_file_link":[{"open_access":"1","url":"http://eprint.iacr.org/2008/471.pdf"}],"alternative_title":["LNCS"],"publication_status":"published","day":"25","conference":{"name":"EuroPKI: Public Key Infrastructures, Services and Applications"},"oa":1,"date_created":"2018-12-11T12:00:40Z","citation":{"chicago":"Bangerter, Endre, Thomas Briner, Wilko Henecka, Stephan Krenn, Ahmad Sadeghi, and Thomas Schneider. “Automatic Generation of Sigma-Protocols.” edited by Fabio Martinelli and Bart Preneel, 6391:67–82. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-16441-5\">https://doi.org/10.1007/978-3-642-16441-5</a>.","apa":"Bangerter, E., Briner, T., Henecka, W., Krenn, S., Sadeghi, A., &#38; Schneider, T. (2010). Automatic Generation of Sigma-Protocols. In F. Martinelli &#38; B. Preneel (Eds.) (Vol. 6391, pp. 67–82). Presented at the EuroPKI: Public Key Infrastructures, Services and Applications, Springer. <a href=\"https://doi.org/10.1007/978-3-642-16441-5\">https://doi.org/10.1007/978-3-642-16441-5</a>","short":"E. Bangerter, T. Briner, W. Henecka, S. Krenn, A. Sadeghi, T. Schneider, in:, F. Martinelli, B. Preneel (Eds.), Springer, 2010, pp. 67–82.","mla":"Bangerter, Endre, et al. <i>Automatic Generation of Sigma-Protocols</i>. Edited by Fabio Martinelli and Bart Preneel, vol. 6391, Springer, 2010, pp. 67–82, doi:<a href=\"https://doi.org/10.1007/978-3-642-16441-5\">10.1007/978-3-642-16441-5</a>.","ista":"Bangerter E, Briner T, Henecka W, Krenn S, Sadeghi A, Schneider T. 2010. Automatic Generation of Sigma-Protocols. EuroPKI: Public Key Infrastructures, Services and Applications, LNCS, vol. 6391, 67–82.","ieee":"E. Bangerter, T. Briner, W. Henecka, S. Krenn, A. Sadeghi, and T. Schneider, “Automatic Generation of Sigma-Protocols,” presented at the EuroPKI: Public Key Infrastructures, Services and Applications, 2010, vol. 6391, pp. 67–82.","ama":"Bangerter E, Briner T, Henecka W, Krenn S, Sadeghi A, Schneider T. Automatic Generation of Sigma-Protocols. In: Martinelli F, Preneel B, eds. Vol 6391. Springer; 2010:67-82. doi:<a href=\"https://doi.org/10.1007/978-3-642-16441-5\">10.1007/978-3-642-16441-5</a>"},"publist_id":"3723","author":[{"first_name":"Endre","full_name":"Bangerter, Endre","last_name":"Bangerter"},{"first_name":"Thomas","full_name":"Briner, Thomas","last_name":"Briner"},{"last_name":"Henecka","full_name":"Henecka, Wilko","first_name":"Wilko"},{"first_name":"Stephan","full_name":"Stephan Krenn","last_name":"Krenn","id":"329FCCF0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2835-9093"},{"first_name":"Ahmad","last_name":"Sadeghi","full_name":"Sadeghi, Ahmad-Reza"},{"first_name":"Thomas","last_name":"Schneider","full_name":"Schneider, Thomas"}],"abstract":[{"lang":"eng","text":"Efficient zero-knowledge proofs of knowledge (ZK-PoK) are basic\n  building blocks of many practical cryptographic applications such as\n  identification schemes, group signatures, and secure multi-party\n  computation (SMPC). Currently, first applications that essentially\n  rely on ZK-PoKs are being deployed in the real world. The most\n  prominent example is the Direct Anonymous Attestation (DAA)\n  protocol, which was adopted by the Trusted Computing Group (TCG) \n  and implemented as one of the functionalities of the cryptographic \n  chip Trusted Platform Module (TPM).\n\nImplementing systems using ZK-PoK turns out to be challenging,\n  since ZK-PoK are significantly more complex than standard crypto\n  primitives (e.g., encryption and signature schemes). As a result, \n  the design-implementation cycles of ZK-PoK are time-consuming\n  and error-prone.\n\nTo overcome this, we present a compiler with corresponding languages \n  for the automatic generation of sound and efficient ZK-PoK based on \n  Σ-protocols. The protocol designer using our compiler formulates \n  the goal of a ZK-PoK proof in a high-level protocol specification language,\n  which abstracts away unnecessary technicalities from the designer. The\n  compiler then automatically generates the protocol implementation in \n  Java code; alternatively, the compiler can output a description of the \n  protocol in LaTeX which can be used for documentation or verification."}],"type":"conference","editor":[{"last_name":"Martinelli","full_name":"Martinelli, Fabio","first_name":"Fabio"},{"last_name":"Preneel","full_name":"Preneel, Bart","first_name":"Bart"}],"_id":"2980","year":"2010","volume":6391,"quality_controlled":0,"extern":1,"intvolume":"      6391","date_published":"2010-10-25T00:00:00Z","acknowledgement":"This work was performed within the FP7 EU project CACE (Computer Aided Cryptography Engineering)."}