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 $\Sigma$-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.Category / Keywords: implementation / Zero-Knowledge, Protocol Compiler, Language Design Publication Info: This paper will be presented at EuroCrypt 2009 poster session. Date: received 5 Nov 2008, last revised 16 Feb 2009 Contact author: stephan krenn at bfh ch Available format(s): PDF | BibTeX Citation Version: 20090216:110425 (All versions of this report) Short URL: ia.cr/2008/471 Discussion forum: Show discussion | Start new discussion