<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Introduction on ZKDocs</title><link>https://www.zkdocs.com/</link><description>Recent content in Introduction on ZKDocs</description><generator>Hugo</generator><language>en-us</language><atom:link href="https://www.zkdocs.com/index.xml" rel="self" type="application/rss+xml"/><item><title/><link>https://www.zkdocs.com/docs/zkdocs/protocol-primitives/random-sampling/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://www.zkdocs.com/docs/zkdocs/protocol-primitives/random-sampling/</guid><description>In this section, we describe how to uniformly sample from different groups.</description></item><item><title>Notation &amp; Definitions</title><link>https://www.zkdocs.com/docs/zkdocs/notation/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://www.zkdocs.com/docs/zkdocs/notation/</guid><description>Common notation and definitions used in the documentation.</description></item><item><title>Schnorr's identification protocol</title><link>https://www.zkdocs.com/docs/zkdocs/zero-knowledge-protocols/schnorr/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://www.zkdocs.com/docs/zkdocs/zero-knowledge-protocols/schnorr/</guid><description>The zero-knowledge proof for a discrete-logarithm in a prime modulo.</description></item><item><title>Variants of Schnorr's identification protocol</title><link>https://www.zkdocs.com/docs/zkdocs/zero-knowledge-protocols/schnorr-variants/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://www.zkdocs.com/docs/zkdocs/zero-knowledge-protocols/schnorr-variants/</guid><description>Common variants of Schnorr&amp;rsquo;s protocol.</description></item><item><title>Fiat-Shamir transformation</title><link>https://www.zkdocs.com/docs/zkdocs/protocol-primitives/fiat-shamir/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://www.zkdocs.com/docs/zkdocs/protocol-primitives/fiat-shamir/</guid><description>Here, we describe what the Fiat-Shamir transformation is, its goals, its pitfalls, and its different versions.</description></item><item><title>Number is square-free</title><link>https://www.zkdocs.com/docs/zkdocs/zero-knowledge-protocols/product-primes/square-freeness/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://www.zkdocs.com/docs/zkdocs/zero-knowledge-protocols/product-primes/square-freeness/</guid><description>Proves that a number is square-free.</description></item><item><title>Two prime divisors</title><link>https://www.zkdocs.com/docs/zkdocs/zero-knowledge-protocols/product-primes/two-prime-divisors/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://www.zkdocs.com/docs/zkdocs/zero-knowledge-protocols/product-primes/two-prime-divisors/</guid><description>Proves that a number has two prime divisors.</description></item><item><title>Nothing-up-my-sleeve constructions</title><link>https://www.zkdocs.com/docs/zkdocs/protocol-primitives/nums/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://www.zkdocs.com/docs/zkdocs/protocol-primitives/nums/</guid><description>Generic, honest, and deterministic method to sample elements.</description></item><item><title>Girault's identification protocol</title><link>https://www.zkdocs.com/docs/zkdocs/zero-knowledge-protocols/girault-identification/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://www.zkdocs.com/docs/zkdocs/zero-knowledge-protocols/girault-identification/</guid><description>A statistical zero-knowledge proof for discrete-logarithm in a composite modulo.</description></item><item><title>Product of two primes</title><link>https://www.zkdocs.com/docs/zkdocs/zero-knowledge-protocols/product-primes/product-of-two-primes/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://www.zkdocs.com/docs/zkdocs/zero-knowledge-protocols/product-primes/product-of-two-primes/</guid><description>Proves that a number is the product of two distinct primes: in parallel, run the square-freeness proof together with the two-prime-divisors proof.</description></item><item><title>Using HVZKP in the wrong context</title><link>https://www.zkdocs.com/docs/zkdocs/security-of-zkps/when-to-use-hvzk/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://www.zkdocs.com/docs/zkdocs/security-of-zkps/when-to-use-hvzk/</guid><description>Potential attacks when honest verifier zero-knowledge proofs are used in the context of a malicious verifier.</description></item><item><title>Paillier-Blum Modulus</title><link>https://www.zkdocs.com/docs/zkdocs/zero-knowledge-protocols/product-primes/paillier_blum_modulus/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://www.zkdocs.com/docs/zkdocs/zero-knowledge-protocols/product-primes/paillier_blum_modulus/</guid><description>An efficient proof that shows a number is the product of two primes congruent with 3 mod 4.</description></item><item><title>Short factoring proofs</title><link>https://www.zkdocs.com/docs/zkdocs/zero-knowledge-protocols/short-factoring-proofs/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://www.zkdocs.com/docs/zkdocs/zero-knowledge-protocols/short-factoring-proofs/</guid><description>Proof of knowledge of the factorization of an integer.</description></item><item><title>Inner Product Argument</title><link>https://www.zkdocs.com/docs/zkdocs/zero-knowledge-protocols/ipa/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://www.zkdocs.com/docs/zkdocs/zero-knowledge-protocols/ipa/</guid><description>Proving the knowledge of vectors for a public inner product</description></item><item><title>Pedersen Commitments</title><link>https://www.zkdocs.com/docs/zkdocs/commitments/pedersen/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://www.zkdocs.com/docs/zkdocs/commitments/pedersen/</guid><description>An overview of the Pedersen commitment scheme and its applications</description></item><item><title>Shamir's Secret Sharing Scheme</title><link>https://www.zkdocs.com/docs/zkdocs/protocol-primitives/shamir/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://www.zkdocs.com/docs/zkdocs/protocol-primitives/shamir/</guid><description>An overview of Shamir&amp;rsquo;s Secret Sharing scheme and potential security pitfalls.</description></item><item><title>Feldman's Verifiable Secret Sharing</title><link>https://www.zkdocs.com/docs/zkdocs/protocol-primitives/verifiable-secret-sharing/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://www.zkdocs.com/docs/zkdocs/protocol-primitives/verifiable-secret-sharing/</guid><description>A verifiable version of Shamir&amp;rsquo;s secret sharing scheme due to Feldman.</description></item><item><title>KZG Polynomial Commitments</title><link>https://www.zkdocs.com/docs/zkdocs/commitments/kzg_polynomial_commitment/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://www.zkdocs.com/docs/zkdocs/commitments/kzg_polynomial_commitment/</guid><description>Kate et. al&amp;rsquo;s Pairing-Based Polynomial Commitments</description></item><item><title>IPA Polynomial Commitment</title><link>https://www.zkdocs.com/docs/zkdocs/commitments/ipa-pcs/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://www.zkdocs.com/docs/zkdocs/commitments/ipa-pcs/</guid><description>An overview of the Inner Product Argument polynomial commitment scheme</description></item><item><title>Alternative versions of Shamir's Secret Sharing scheme</title><link>https://www.zkdocs.com/docs/zkdocs/protocol-primitives/alt-shamir/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://www.zkdocs.com/docs/zkdocs/protocol-primitives/alt-shamir/</guid><description>Secret sharing alternatives which do not hide the secret in the constant term of the polynomial.</description></item><item><title>Bibliography</title><link>https://www.zkdocs.com/docs/zkdocs/bibliography/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://www.zkdocs.com/docs/zkdocs/bibliography/</guid><description>All references</description></item></channel></rss>