A Framework for Practical Universally Composable Zero-Knowledge Protocols

Zero-Knowledge Proofs of Knowledge (ZK-PoK) for discrete logarithms and related problems are indispensable for practical cryptographic protocols. At Eurocrypt 2009, Camenisch, Kiayias, and Yung provided a specification language (the CKY-language) for such protocols, which allows one to modularly design and analyze cryptographic protocols: protocol designers just need to specify the statement they want to prove in zero-knowledge and are ensured that an efficient proof protocol exists and indeed proves the specified statement, provided that the specification was in the CKY-language.

Provided by: University of Fribourg Topic: Security Date Added: May 2011 Format: PDF

Find By Topic