<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">José Bacelar Almeida</style></author><author><style face="normal" font="default" size="100%">Endre Bangerter</style></author><author><style face="normal" font="default" size="100%">Manuel Bernardo Barbosa</style></author><author><style face="normal" font="default" size="100%">Stephan Krenn</style></author><author><style face="normal" font="default" size="100%">Ahmad Reza Sadeghi</style></author><author><style face="normal" font="default" size="100%">Thomas Schneider</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on Sigma-Protocols</style></title><secondary-title><style face="normal" font="default" size="100%">European Symposium on Research in Computer Security - ESORICS</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year><pub-dates><date><style  face="normal" font="default" size="100%">September</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-642-15497-3_10</style></url></web-urls><related-urls><url><style face="normal" font="default" size="100%">https://haslab.uminho.pt/sites/default/files/jba/files/10esorics.pdf</style></url></related-urls></urls><pub-location><style face="normal" font="default" size="100%">Saint Malo, France</style></pub-location><pages><style face="normal" font="default" size="100%">151-167</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;br /&gt;
We 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.&lt;/p&gt;
</style></abstract></record></records></xml>