From 823d0edb691ad8947fd3caebd188ba6229641ecb Mon Sep 17 00:00:00 2001 From: ID Bot Date: Thu, 22 Aug 2024 16:15:38 +0000 Subject: [PATCH] Script updating gh-pages from 9a73ae2. [ci skip] --- cjpatton/257/draft-irtf-cfrg-vdaf.html | 16 ++++++++-------- cjpatton/257/draft-irtf-cfrg-vdaf.txt | 16 ++++++++-------- 2 files changed, 16 insertions(+), 16 deletions(-) diff --git a/cjpatton/257/draft-irtf-cfrg-vdaf.html b/cjpatton/257/draft-irtf-cfrg-vdaf.html index 278fa49c..eaae2a15 100644 --- a/cjpatton/257/draft-irtf-cfrg-vdaf.html +++ b/cjpatton/257/draft-irtf-cfrg-vdaf.html @@ -1037,7 +1037,7 @@ Barnes, et al. -Expires 22 February 2025 +Expires 23 February 2025 [Page] @@ -1050,12 +1050,12 @@
draft-irtf-cfrg-vdaf-latest
Published:
- +
Intended Status:
Informational
Expires:
-
+
Authors:
@@ -1118,7 +1118,7 @@

time. It is inappropriate to use Internet-Drafts as reference material or to cite them other than as "work in progress."

- This Internet-Draft will expire on 22 February 2025.

+ This Internet-Draft will expire on 23 February 2025.

-

This circuit contains one subtraction gate (x -1) and one multiplication -gate (x * (x -1)). Observe that C(x) = 0 if and only if x in range(2).

+

This circuit contains one subtraction gate (x - 1) and one multiplication +gate (x * (x - 1)). Observe that C(x) = 0 if and only if x in range(2).

Our goal is to allow each Aggregator, who holds a secret share of x, to correctly compute a secret share of C(x). This allows the Aggregators to determine validity by combining their shares of the output.

Suppose for a moment that the validity circuit C is affine, meaning its only operations are addition, subtraction, and multiplication-by-constant. (The circuit above is non-affine because it contains a multiplication gate with -non-constant inputs.) Then each Aggregator can compute its share locally, since

+two non-constant inputs.) Then each Aggregator can compute its share locally, since

 C(x_shares[0] + ... + x_shares[SHARES-1]) =
@@ -5352,7 +5352,7 @@

(Note that, for this equality to hold, it is necessary to scale any addition of a constant in the circuit by 1/SHARES.) However, this is not the case if C -contains multiplication gates with non-constant inputs. Thus our goal is to +contains multiplication gates with two non-constant inputs. Thus our goal is to transform these multiplication gates into computations on secret shared data that each Aggregator can perform locally.

The key idea is to have the prover construct a polynomial p such that p(j) diff --git a/cjpatton/257/draft-irtf-cfrg-vdaf.txt b/cjpatton/257/draft-irtf-cfrg-vdaf.txt index 3f67cf98..fc50ef6b 100644 --- a/cjpatton/257/draft-irtf-cfrg-vdaf.txt +++ b/cjpatton/257/draft-irtf-cfrg-vdaf.txt @@ -5,12 +5,12 @@ CFRG R. L. Barnes Internet-Draft Cisco Intended status: Informational D. Cook -Expires: 22 February 2025 ISRG +Expires: 23 February 2025 ISRG C. Patton Cloudflare P. Schoppmann Google - 21 August 2024 + 22 August 2024 Verifiable Distributed Aggregation Functions @@ -53,7 +53,7 @@ Status of This Memo time. It is inappropriate to use Internet-Drafts as reference material or to cite them other than as "work in progress." - This Internet-Draft will expire on 22 February 2025. + This Internet-Draft will expire on 23 February 2025. Copyright Notice @@ -3300,8 +3300,8 @@ Table of Contents C(x) = x * (x-1) - This circuit contains one subtraction gate (x -1) and one - multiplication gate (x * (x -1)). Observe that C(x) = 0 if and only + This circuit contains one subtraction gate (x - 1) and one + multiplication gate (x * (x - 1)). Observe that C(x) = 0 if and only if x in range(2). Our goal is to allow each Aggregator, who holds a secret share of x, @@ -3312,15 +3312,15 @@ Table of Contents Suppose for a moment that the validity circuit C is affine, meaning its only operations are addition, subtraction, and multiplication-by- constant. (The circuit above is non-affine because it contains a - multiplication gate with non-constant inputs.) Then each Aggregator - can compute its share locally, since + multiplication gate with two non-constant inputs.) Then each + Aggregator can compute its share locally, since C(x_shares[0] + ... + x_shares[SHARES-1]) = C(x_shares[0]) + ... + C(x_shares[SHARES-1]) (Note that, for this equality to hold, it is necessary to scale any addition of a constant in the circuit by 1/SHARES.) However, this is - not the case if C contains multiplication gates with non-constant + not the case if C contains multiplication gates with two non-constant inputs. Thus our goal is to transform these multiplication gates into computations on secret shared data that each Aggregator can perform locally.