Bangerter, Endre ; Camenisch, Jan ; Krenn, Stephan ; Sadeghi, Ahmad-Reza ; Schneider, Thomas (2009)
Automatic Generation of Sound Zero-Knowledge Protocols.
28th Annual International Conference on the Theory and Applications of Cryptographic Techniques. Cologne, Germany (26.04.2009-30.04.2009)
Konferenzveröffentlichung, Bibliographie
Kurzbeschreibung (Abstract)
Efficient zero-knowledge proofs of knowledge (ZK-PoK) are basic building blocks of many practical cryptographic applications such as identification schemes, group signatures, and secure multiparty computation. Currently, first applications that essentially rely on ZK-POKs are being deployed in the real world. The most prominent example is Direct Anonymous Attestation (DAA), which was adopted by the Trusted Computing Group (TCG) and implemented as one of the functionalities of the cryptographic chip Trusted Platform Module (TPM).
Implementing systems using ZK-PoK turns out to be challenging, since ZK-PoK are, loosely speaking, significantly more complex than standard crypto primitives, such as encryption and signature schemes. As a result, implementation cycles of ZK-PoK are time-consuming and error-prone, in particular for developers with minor or no cryptographic skills.
To overcome these challenges, we have designed and implemented a compiler with corresponding languages that given a high-level ZK-PoK protocol specification automatically generates a sound implementation of this. The output is given in form of -protocols, which are the most efficient protocols for ZK-PoK currently known. Our compiler translates ZK-PoK protocol specifications, written in a high-level protocol description language, into Java code or \LaTeX\ documentation of the protocol. The compiler is based on a unified theoretical framework that encompasses a large number of existing ZK-PoK techniques. Within this framework we present a new efficient ZK-PoK protocol for exponentiation homomorphisms in hidden order groups. Our protocol overcomes several limitations of the existing proof techniques.
| Typ des Eintrags: | Konferenzveröffentlichung |
|---|---|
| Erschienen: | 2009 |
| Autor(en): | Bangerter, Endre ; Camenisch, Jan ; Krenn, Stephan ; Sadeghi, Ahmad-Reza ; Schneider, Thomas |
| Art des Eintrags: | Bibliographie |
| Titel: | Automatic Generation of Sound Zero-Knowledge Protocols |
| Sprache: | Englisch |
| Publikationsjahr: | April 2009 |
| Veranstaltungstitel: | 28th Annual International Conference on the Theory and Applications of Cryptographic Techniques |
| Veranstaltungsort: | Cologne, Germany |
| Veranstaltungsdatum: | 26.04.2009-30.04.2009 |
| Zugehörige Links: | |
| Kurzbeschreibung (Abstract): | Efficient zero-knowledge proofs of knowledge (ZK-PoK) are basic building blocks of many practical cryptographic applications such as identification schemes, group signatures, and secure multiparty computation. Currently, first applications that essentially rely on ZK-POKs are being deployed in the real world. The most prominent example is Direct Anonymous Attestation (DAA), which was adopted by the Trusted Computing Group (TCG) and implemented as one of the functionalities of the cryptographic chip Trusted Platform Module (TPM). Implementing systems using ZK-PoK turns out to be challenging, since ZK-PoK are, loosely speaking, significantly more complex than standard crypto primitives, such as encryption and signature schemes. As a result, implementation cycles of ZK-PoK are time-consuming and error-prone, in particular for developers with minor or no cryptographic skills. To overcome these challenges, we have designed and implemented a compiler with corresponding languages that given a high-level ZK-PoK protocol specification automatically generates a sound implementation of this. The output is given in form of -protocols, which are the most efficient protocols for ZK-PoK currently known. Our compiler translates ZK-PoK protocol specifications, written in a high-level protocol description language, into Java code or \LaTeX\ documentation of the protocol. The compiler is based on a unified theoretical framework that encompasses a large number of existing ZK-PoK techniques. Within this framework we present a new efficient ZK-PoK protocol for exponentiation homomorphisms in hidden order groups. Our protocol overcomes several limitations of the existing proof techniques. |
| Fachbereich(e)/-gebiet(e): | 20 Fachbereich Informatik 20 Fachbereich Informatik > EC SPRIDE 20 Fachbereich Informatik > EC SPRIDE > Engineering Cryptographic Protocols (am 01.03.18 aufgegangen in Praktische Kryptographie und Privatheit) |
| Hinterlegungsdatum: | 25 Jun 2012 13:53 |
| Letzte Änderung: | 06 Aug 2024 07:27 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum