Sherlock Holmes Zero-Knowledge Protocols
G Teşeleanu - … Conference on Information Security Practice and …, 2022 - Springer
We present two simple zero knowledge interactive proofs that can be instantiated with many
of the standard decisional or computational hardness assumptions. Compared with …
of the standard decisional or computational hardness assumptions. Compared with …
Legosnark: Modular design and composition of succinct zero-knowledge proofs
We study the problem of building non-interactive proof systems modularly by linking small
specialized" gadget" SNARKs in a lightweight manner. Our motivation is both theoretical and …
specialized" gadget" SNARKs in a lightweight manner. Our motivation is both theoretical and …
[PDF][PDF] zk-SNARKs: A gentle introduction
A Nitulescu - Ecole Normale Superieure, 2020 - di.ens.fr
Abstract Zero-Knowledge Succinct Non-interactive Arguments of Knowledge (zk-SNARKs)
are non-interactive systems with short proofs (ie, independent of the size of the witness) that …
are non-interactive systems with short proofs (ie, independent of the size of the witness) that …
Succinct Publicly-Certifiable Proofs: Or, Can a Blockchain Verify a Designated-Verifier Proof?
M Campanelli, H Khoshakhlagh - International Conference on Cryptology …, 2021 - Springer
We study zero-knowledge arguments where proofs are: of knowledge, short, publicly-
verifiable and produced without interaction. While zkSNARKs satisfy these requirements, we …
verifiable and produced without interaction. While zkSNARKs satisfy these requirements, we …
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 …
Snarky ceremonies
Succinct non-interactive arguments of knowledge (SNARKs) have found numerous
applications in the blockchain setting and elsewhere. The most efficient SNARKs require a …
applications in the blockchain setting and elsewhere. The most efficient SNARKs require a …
[PDF][PDF] An introduction to zero-knowledge proofs in blockchains and economics
A Berentsen, J Lenzi… - Federal Reserve Bank of St …, 2023 - files.stlouisfed.org
With a zero-knowledge proof (ZKP), a party can prove that a statement is true without
revealing any information except for whether it is indeed true or not. The obvious benefit is …
revealing any information except for whether it is indeed true or not. The obvious benefit is …
Secure sampling of public parameters for succinct zero knowledge proofs
Non-interactive zero-knowledge proofs (NIZKs) are a powerful cryptographic tool, with
numerous potential applications. However, succinct NIZKs (eg, zk-SNARK schemes) …
numerous potential applications. However, succinct NIZKs (eg, zk-SNARK schemes) …
{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 …