[PDF][PDF] {ZKPDL}: A {Language-Based} system for efficient {Zero-Knowledge} proofs and electronic cash
In recent years, many advances have been made in cryptography, as well as in the
performance of communication networks and processors. As a result, many advanced …
performance of communication networks and processors. As a result, many advanced …
{DIZK}: A distributed zero knowledge proof system
Recently there has been much academic and industrial interest in practical implementations
of zero knowledge proofs. These techniques allow a party to prove to another party that a …
of zero knowledge proofs. These techniques allow a party to prove to another party that a …
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 …
AntMan: Interactive zero-knowledge proofs with sublinear communication
Recent works on interactive zero-knowledge (ZK) protocols provide a new paradigm with
high efficiency and scalability. However, these protocols suffer from high communication …
high efficiency and scalability. However, these protocols suffer from high communication …
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 …
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 …
[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 …
Strictly-black-box zero-knowledge and efficient validation of financial transactions
Abstract Zero Knowledge Proofs (ZKPs) are one of the most striking innovations in
theoretical computer science. In practice, the prevalent ZKP methods are, at times, too …
theoretical computer science. In practice, the prevalent ZKP methods are, at times, too …
Non-interactive zero-knowledge proofs to multiple verifiers
K Yang, X Wang - International Conference on the Theory and …, 2022 - Springer
In this paper, we study zero-knowledge (ZK) proofs for circuit satisfiability that can prove to n
verifiers at a time efficiently. The proofs are secure against the collusion of a prover and a …
verifiers at a time efficiently. The proofs are secure against the collusion of a prover and a …