A note on zero-knowledge proofs of knowledge and the ZKPOK ideal functionality
In this note, we provide a formal proof of the fact that any protocol that is a zero-knowledge
proof of knowledge for a relation $ R $ is also a secure protocol for the zero-knowledge …
proof of knowledge for a relation $ R $ is also a secure protocol for the zero-knowledge …
Towards a unified approach to black-box constructions of zero-knowledge proofs
General-purpose zero-knowledge proofs for all NP NP languages greatly simplify secure
protocol design. However, they inherently require the code of the underlying relation. If the …
protocol design. However, they inherently require the code of the underlying relation. If the …
Complex zero-knowledge proofs of knowledge are easy to use
Since 1985 and their introduction by Goldwasser, Micali and Rackoff, followed in 1988 by
Feige, Fiat and Shamir, zero-knowledge proofs of knowledge have become a central tool in …
Feige, Fiat and Shamir, zero-knowledge proofs of knowledge have become a central tool in …
Efficient zero-knowledge proofs of knowledge without intractability assumptions
R Cramer, I Damgård, P MacKenzie - International Workshop on Public …, 2000 - Springer
We initiate the investigation of the class of relations that admit extremely efficient perfect zero
knowledge proofs of knowledge: constant number of rounds, communication linear in the …
knowledge proofs of knowledge: constant number of rounds, communication linear in the …
A certifying compiler for zero-knowledge proofs of knowledge based on σ-protocols
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 …
cryptographic applications. Although ZK-PoK have a high potential impact, their real world …
Bringing zero-knowledge proofs of knowledge to practice
E Bangerter, S Barzan, S Krenn, AR Sadeghi… - Security Protocols XVII …, 2013 - Springer
Efficient zero-knowledge proofs of knowledge (ZK-PoK) are basic building blocks of many
practical cryptographic applications such as identification schemes, group signatures, and …
practical cryptographic applications such as identification schemes, group signatures, and …
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. Recently, Camenisch, Kiayias, and …
are indispensable for practical cryptographic protocols. Recently, Camenisch, Kiayias, and …
Do You Need a Zero Knowledge Proof?
Abstract Zero-Knowledge Proofs (ZKPs), a cryptographic tool known for decades, have
gained significant attention in recent years due to advancements that have made them …
gained significant attention in recent years due to advancements that have made them …
Compressing Proofs of k-Out-Of-n Partial Knowledge
In a proof of partial knowledge, introduced by Cramer, Damgård and Schoenmakers
(CRYPTO 1994), a prover knowing witnesses for some k-subset of n given public statements …
(CRYPTO 1994), a prover knowing witnesses for some k-subset of n given public statements …
[PDF][PDF] On the design and implementation of efficient zero-knowledge proofs of knowledge
E Bangerter, S Krenn, AR Sadeghi… - … for Encryption and …, 2009 - encrypto.de
Zero-knowledge proofs of knowledge (ZK-PoK) play an important role in many cryptographic
applications. Direct anonymous attestation (DAA) and the identity mixer anonymous …
applications. Direct anonymous attestation (DAA) and the identity mixer anonymous …