Verifiable Distributed Aggregation Functions

Verifiable Distributed Aggregation Functions Cisco

rlb@ipv.sx

ISRG

divergentdave@gmail.com

Cloudflare

chrispatton+ietf@gmail.com

Google

schoppmann@google.com

IRTF CFRG Internet-Draft This document describes Verifiable Distributed Aggregation Functions (VDAFs), a family of multi-party protocols for computing aggregate statistics over user measurements. These protocols are designed to ensure that, as long as at least one aggregation server executes the protocol honestly, individual measurements are never seen by any server in the clear. At the same time, VDAFs allow the servers to detect if a malicious or misconfigured client submitted an input that would result in an incorrect aggregate result. Discussion Venues Discussion of this document takes place on the Crypto Forum Research Group mailing list (cfrg@ietf.org), which is archived at . Source for this draft and an issue tracker can be found at .

Introduction The ubiquity of the Internet makes it an ideal platform for measurement of large-scale phenomena, whether public health trends or the behavior of computer systems at scale. There is substantial overlap, however, between information that is valuable to measure and information that users consider private. For example, consider an application that provides health information to users. The operator of an application might want to know which parts of their application are used most often, as a way to guide future development of the application. Specific users' patterns of usage, though, could reveal sensitive things about them, such as which users are researching a given health condition. In many situations, the measurement collector is only interested in aggregate statistics, e.g., which portions of an application are most used or what fraction of people have experienced a given disease. Thus systems that provide aggregate statistics while protecting individual measurements can deliver the value of the measurements while protecting users' privacy. Most prior approaches to this problem fall under the rubric of "differential privacy (DP)" . Roughly speaking, a data aggregation system that is differentially private ensures that the degree to which any individual measurement influences the value of the aggregate result can be precisely controlled. For example, in systems like RAPPOR , each user samples noise from a well-known distribution and adds it to their input before submitting to the aggregation server. The aggregation server then adds up the noisy inputs, and because it knows the distribution from whence the noise was sampled, it can estimate the true sum with reasonable precision. Differentially private systems like RAPPOR are easy to deploy and provide a useful guarantee. On its own, however, DP falls short of the strongest privacy property one could hope for. Specifically, depending on the "amount" of noise a client adds to its input, it may be possible for a curious aggregator to make a reasonable guess of the input's true value. Indeed, the more noise the clients add, the less reliable will be the server's estimate of the output. Thus systems employing DP techniques alone must strike a delicate balance between privacy and utility. The ideal goal for a privacy-preserving measurement system is that of secure multi-party computation (MPC): No participant in the protocol should learn anything about an individual input beyond what it can deduce from the aggregate. In this document, we describe Verifiable Distributed Aggregation Functions (VDAFs) as a general class of protocols that achieve this goal. VDAF schemes achieve their privacy goal by distributing the computation of the aggregate among a number of non-colluding aggregation servers. As long as a subset of the servers executes the protocol honestly, VDAFs guarantee that no input is ever accessible to any party besides the client that submitted it. At the same time, VDAFs are "verifiable" in the sense that malformed inputs that would otherwise garble the output of the computation can be detected and removed from the set of input measurements. We refer to this property as "robustness". In addition to these MPC-style security goals of privacy and robustness, VDAFs can be composed with various mechanisms for differential privacy, thereby providing the added assurance that the aggregate result itself does not leak too much information about any one measurement.

TODO(issue #94) Provide guidance for local and central DP and point to it here.

The cost of achieving these security properties is the need for multiple servers to participate in the protocol, and the need to ensure they do not collude to undermine the VDAF's privacy guarantees. Recent implementation experience has shown that practical challenges of coordinating multiple servers can be overcome. The Prio system (essentially a VDAF) has been deployed in systems supporting hundreds of millions of users: The Mozilla Origin Telemetry project and the Exposure Notification Private Analytics collaboration among the Internet Security Research Group (ISRG), Google, Apple, and others . The VDAF abstraction laid out in represents a class of multi-party protocols for privacy-preserving measurement proposed in the literature. These protocols vary in their operational and security requirements, sometimes in subtle but consequential ways. This document therefore has two important goals:

Providing higher-level protocols like with a simple, uniform interface for accessing privacy-preserving measurement schemes, documenting relevant operational and security requirements, and specifying constraints for safe usage:
1. General patterns of communications among the various actors involved in the system (clients, aggregation servers, and the collector of the aggregate result);
2. Capabilities of a malicious coalition of servers attempting to divulge information about client measurements; and
3. Conditions that are necessary to ensure that malicious clients cannot corrupt the computation.
Providing cryptographers with design criteria that provide a clear deployment roadmap for new constructions.

This document also specifies two concrete VDAF schemes, each based on a protocol from the literature.

The aforementioned Prio system allows for the privacy-preserving computation of a variety aggregate statistics. The basic idea underlying Prio is fairly simple:
1. Each client shards its measurement into a sequence of additive shares and distributes the shares among the aggregation servers.
2. Next, each server adds up its shares locally, resulting in an additive share of the aggregate.
3. Finally, the aggregation servers send their aggregate shares to the data collector, who combines them to obtain the aggregate result.
The difficult part of this system is ensuring that the servers hold shares of a valid input, e.g., the input is an integer in a specific range. Thus Prio specifies a multi-party protocol for accomplishing this task. In we describe Prio3, a VDAF that follows the same overall framework as the original Prio protocol, but incorporates techniques introduced in that result in significant performance gains.
More recently, Boneh et al. described a protocol called Poplar for solving the t-heavy-hitters problem in a privacy-preserving manner. Here each client holds a bit-string of length n, and the goal of the aggregation servers is to compute the set of inputs that occur at least t times. The core primitive used in their protocol is a specialized Distributed Point Function (DPF) that allows the servers to "query" their DPF shares on any bit-string of length shorter than or equal to n. As a result of this query, each of the servers has an additive share of a bit indicating whether the string is a prefix of the client's input. The protocol also specifies a multi-party computation for verifying that at most one string among a set of candidates is a prefix of the client's input. In we describe a VDAF called Poplar1 that implements this functionality.

Finally, perhaps the most complex aspect of schemes like Prio3 and Poplar1 is the process by which the client-generated measurements are prepared for aggregation. Because these constructions are based on secret sharing, the servers will be required to exchange some amount of information in order to verify the measurement is valid and can be aggregated. Depending on the construction, this process may require multiple round trips over the network. There are applications in which this verification step may not be necessary, e.g., when the client's software is run a trusted execution environment. To support these applications, this document also defines Distributed Aggregation Functions (DAFs) as a simpler class of protocols that aim to provide the same privacy guarantee as VDAFs but fall short of being verifiable.

OPEN ISSUE Decide if we should give one or two example DAFs. There are natural variants of Prio3 and Poplar1 that might be worth describing.

The remainder of this document is organized as follows: gives a brief overview of DAFs and VDAFs; defines the syntax for DAFs; defines the syntax for VDAFs; defines various functionalities that are common to our constructions; describes the Prio3 construction; describes the Poplar1 construction; and enumerates the security considerations for VDAFs.

Change Log (*) Indicates a change that breaks wire compatibility with the previous draft. 06:

Vdaf: Define a wrapper interface for preparation that is suitable for the "ping-pong" topology in which two Aggregators exchange messages over a request/response protocol, like HTTP, and take turns executing the computation until input from the peer is required.
Prio3Histogram: Generalize the measurement type so that the histogram can be used more easily with discrete domains. (*)
Daf, Vdaf: Change the aggregation parameter validation algorithm to take the set of previous parameters rather than a list. (The order of the parameters is irrelevant.)
Daf, Vdaf, Idpf: Add parameter RAND_SIZE that specifies the number of random bytes consumed by the randomized algorithm (shard() for Daf and Vdaf and gen() for Idpf).

05:

IdpfPoplar: Replace PrgSha3 with PrgFixedKeyAes128, a fixed-key mode for AES-128 based on a construction from . This change is intended to improve performance of IDPF evaluation. Note that the new PRG is not suitable for all applications. (*)
Idpf: Add a binder string to the key-generation and evaluation algorithms. This is used to plumb the nonce generated by the Client to the PRG.
Plumb random coins through the interface of randomized algorithms. Specifically, add a random input to (V)DAF sharding algorithm and IDPF key-generation algorithm and require implementations to specify the length of the random input. Accordingly, update Prio3, Poplar1, and IdpfPoplar to match the new interface. This change is intended to improve coverage of test vectors.
Use little-endian byte-order for field element encoding. (*)
Poplar1: Move the last step of sketch evaluation from prep_next() to prep_shares_to_prep().

04:

Align security considerations with the security analysis of .
Vdaf: Pass the nonce to the sharding algorithm.
Vdaf: Rather than allow the application to choose the nonce length, have each implementation of the Vdaf interface specify the expected nonce length. (*)
Prg: Split "info string" into two components: the "customization string", intended for domain separation; and the "binder string", used to bind the output to ephemeral values, like the nonce, associated with execution of a (V)DAF.
Replace PrgAes128 with PrgSha3, an implementation of the Prg interface based on SHA-3, and use the new scheme as the default. Accordingly, replace Prio3Aes128Count with Prio3Count, Poplar1Aes128 with Poplar1, and so on. SHA-3 is a safer choice for instantiating a random oracle, which is used in the analysis of Prio3 of . (*)
Prio3, Poplar1: Ensure each invocation of the Prg uses a distinct customization string, as suggested by . This is intended to make domain separation clearer, thereby simplifying security analysis. (*)
Prio3: Replace "joint randomness hints" sent in each input share with "joint randomness parts" sent in the public share. This reduces communication overhead when the number of shares exceeds two. (*)
Prio3: Bind nonce to joint randomness parts. This is intended to address birthday attacks on robustness pointed out by . (*)
Poplar1: Use different Prg invocations for producing the correlated randomness for inner and leaf nodes of the IDPF tree. This is intended to simplify implementations. (*)
Poplar1: Don't bind the candidate prefixes to the verifier randomness. This is intended to improve performance, while not impacting security. According to the analysis of , it is necessary to restrict Poplar1 usage such that no report is aggregated more than once at a given level of the IDPF tree; otherwise, attacks on privacy may be possible. In light of this restriction, there is no added benefit of binding to the prefixes themselves. (*)
Poplar1: During preparation, assert that all candidate prefixes are unique and appear in order. Uniqueness is required to avoid erroneously rejecting a valid report; the ordering constraint ensures the uniqueness check can be performed efficiently. (*)
Poplar1: Increase the maximum candidate prefix count in the encoding of the aggregation parameter. (*)
Poplar1: Bind the nonce to the correlated randomness derivation. This is intended to provide defense-in-depth by ensuring the Aggregators reject the report if the nonce does not match what the Client used for sharding. (*)
Poplar1: Clarify that the aggregation parameter encoding is OPTIONAL. Accordingly, update implementation considerations around cross-aggregation state.
IdpfPoplar: Add implementation considerations around branching on the values of control bits.
IdpfPoplar: When decoding the the control bits in the public share, assert that the trailing bits of the final byte are all zero. (*)

03:

Define codepoints for (V)DAFs and use them for domain separation in Prio3 and Poplar1. (*)
Prio3: Align joint randomness computation with revised paper . This change mitigates an attack on robustness. (*)
Prio3: Remove an intermediate PRG evaluation from query randomness generation. (*)
Add additional guidance for choosing FFT-friendly fields.

02:

Complete the initial specification of Poplar1.
Extend (V)DAF syntax to include a "public share" output by the Client and distributed to all of the Aggregators. This is to accommodate "extractable" IDPFs as required for Poplar1. (See , Section 4.3 for details.)
Extend (V)DAF syntax to allow the unsharding step to take into account the number of measurements aggregated.
Extend FLP syntax by adding a method for decoding the aggregate result from a vector of field elements. The new method takes into account the number of measurements.
Prio3: Align aggregate result computation with updated FLP syntax.
Prg: Add a method for statefully generating a vector of field elements.
Field: Require that field elements are fully reduced before decoding. (*)
Define new field Field255.

01:

Require that VDAFs specify serialization of aggregate shares.
Define Distributed Aggregation Functions (DAFs).
Prio3: Move proof verifier check from prep_next() to prep_shares_to_prep(). (*)
Remove public parameter and replace verification parameter with a "verification key" and "Aggregator ID".

Conventions and Definitions The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in BCP 14 when, and only when, they appear in all capitals, as shown here. Algorithms in this document are written in Python 3. Type hints are used to define input and output types. A fatal error in a program (e.g., failure to parse one of the function parameters) is usually handled by raising an exception. A variable with type Bytes is a byte string. This document defines several byte-string constants. When comprised of printable ASCII characters, they are written as Python 3 byte-string literals (e.g., b'some constant string'). A global constant VERSION of type Unsigned is defined, which algorithms are free to use as desired. Its value SHALL be 6. This document describes algorithms for multi-party computations in which the parties typically communicate over a network. Wherever a quantity is defined that must be be transmitted from one party to another, this document prescribes a particular encoding of that quantity as a byte string.

OPEN ISSUE It might be better to not be prescriptive about how quantities are encoded on the wire. See issue #58.

Some common functionalities:

zeros(len: Unsigned) -> Bytes returns an array of zero bytes. The length of output MUST be len.
gen_rand(len: Unsigned) -> Bytes returns an array of random bytes. The length of output MUST be len.
byte(int: Unsigned) -> Bytes returns the representation of int as a byte string. The value of int MUST be in [0,256).
concat(parts: Vec[Bytes]) -> Bytes returns the concatenation of the input byte strings, i.e., parts[0] || ... || parts[len(parts)-1].
front(length: Unsigned, vec: Vec[Any]) -> (Vec[Any], Vec[Any]) splits vec into two vectors, where the first vector is made up of the first length elements of the input. I.e., (vec[:length], vec[length:]).
xor(left: Bytes, right: Bytes) -> Bytes returns the bitwise XOR of left and right. An exception is raised if the inputs are not the same length.
to_be_bytes(val: Unsigned, length: Unsigned) -> Bytes converts val to big-endian bytes; its value MUST be in range [0, 2^(8*length)). Function from_be_bytes(encoded: Bytes) -> Unsigned computes the inverse.
to_le_bytes(val: Unsigned, length: Unsigned) -> Bytes converts val to little-endian bytes; its value MUST be in range [0, 2^(8*length)). Function from_le_bytes(encoded: Bytes) -> Unsigned computes the inverse.
next_power_of_2(n: Unsigned) -> Unsigned returns the smallest integer greater than or equal to n that is also a power of two.
additive_secret_share(vec: Vec[Field], num_shares: Unsigned, field: type) -> Vec[Vec[Field]] takes a vector of field elements and returns multiple vectors of the same length, such that they all add up to the input vector, and each proper subset of the vectors are indistinguishable from random.

Overview

Overall data flow of a (V)DAF | Aggregator 0 |----+ | +--------------+ | | ^ | | | | | V | | +--------------+ | | +-->| Aggregator 1 |--+ | | | +--------------+ | | +--------+-+ | ^ | +->+-----------+ | Client |---+ | +--->| Collector |--> Aggregate +--------+-+ +->+-----------+ | ... | | | | | | | V | | +----------------+ | +--->| Aggregator N-1 |---+ +----------------+ Input shares Aggregate shares ]]> In a DAF- or VDAF-based private measurement system, we distinguish three types of actors: Clients, Aggregators, and Collectors. The overall flow of the measurement process is as follows:

To submit an individual measurement, the Client shards the measurement into "input shares" and sends one input share to each Aggregator. We sometimes refer to this sequence of input shares collectively as the Client's "report".
The Aggregators convert their input shares into "output shares".
- Output shares are in one-to-one correspondence with the input shares.
- Just as each Aggregator receives one input share of each measurement, if this process succeeds, then each aggregator holds one output share.
- In VDAFs, Aggregators will need to exchange information among themselves as part of the validation process.
Each Aggregator combines the output shares across inputs in the batch to compute the "aggregate share" for that batch, i.e., its share of the desired aggregate result.
The Aggregators submit their aggregate shares to the Collector, who combines them to obtain the aggregate result over the batch.

Aggregators are a new class of actor relative to traditional measurement systems where Clients submit measurements to a single server. They are critical for both the privacy properties of the system and, in the case of VDAFs, the correctness of the measurements obtained. The privacy properties of the system are assured by non-collusion among Aggregators, and Aggregators are the entities that perform validation of Client measurements. Thus Clients trust Aggregators not to collude (typically it is required that at least one Aggregator is honest), and Collectors trust Aggregators to correctly run the protocol. Within the bounds of the non-collusion requirements of a given (V)DAF instance, it is possible for the same entity to play more than one role. For example, the Collector could also act as an Aggregator, effectively using the other Aggregator(s) to augment a basic client-server protocol. In this document, we describe the computations performed by the actors in this system. It is up to the higher-level protocol making use of the (V)DAF to arrange for the required information to be delivered to the proper actors in the proper sequence. In general, we assume that all communications are confidential and mutually authenticated, with the exception that Clients submitting measurements may be anonymous.

Definition of DAFs By way of a gentle introduction to VDAFs, this section describes a simpler class of schemes called Distributed Aggregation Functions (DAFs). Unlike VDAFs, DAFs do not provide verifiability of the computation. Clients must therefore be trusted to compute their input shares correctly. Because of this fact, the use of a DAF is NOT RECOMMENDED for most applications. See for additional discussion. A DAF scheme is used to compute a particular "aggregation function" over a set of measurements generated by Clients. Depending on the aggregation function, the Collector might select an "aggregation parameter" and disseminates it to the Aggregators. The semantics of this parameter is specific to the aggregation function, but in general it is used to represent the set of "queries" that can be made on the measurement set. For example, the aggregation parameter is used to represent the candidate prefixes in Poplar1 . Execution of a DAF has four distinct stages:

Sharding - Each Client generates input shares from its measurement and distributes them among the Aggregators.
Preparation - Each Aggregator converts each input share into an output share compatible with the aggregation function. This computation involves the aggregation parameter. In general, each aggregation parameter may result in a different an output share.
Aggregation - Each Aggregator combines a sequence of output shares into its aggregate share and sends the aggregate share to the Collector.
Unsharding - The Collector combines the aggregate shares into the aggregate result.

Sharding and Preparation are done once per measurement. Aggregation and Unsharding are done over a batch of measurements (more precisely, over the recovered output shares). A concrete DAF specifies an algorithm for the computation needed in each of these stages. The interface of each algorithm is defined in the remainder of this section. In addition, a concrete DAF defines the associated constants and types enumerated in the following table. Constants and types defined by each concrete DAF.

Parameter	Description
`ID`	Algorithm identifier for this DAF. A 32-bit, unsigned integer.
`SHARES`	Number of input shares into which each measurement is sharded.
`RAND_SIZE`	Size of the random byte string passed to sharding algorithm.
`Measurement`	Type of each measurement.
`AggParam`	Type of aggregation parameter.
`OutShare`	Type of each output share.
`AggResult`	Type of the aggregate result.

These types define some of the inputs and outputs of DAF methods at various stages of the computation. Observe that only the measurements, output shares, the aggregate result, and the aggregation parameter have an explicit type. All other values --- in particular, the input shares and the aggregate shares --- have type Bytes and are treated as opaque byte strings. This is because these values must be transmitted between parties over a network.

OPEN ISSUE It might be cleaner to define a type for each value, then have that type implement an encoding where necessary. This way each method parameter has a meaningful type hint. See issue#58.

Each DAF is identified by a unique, 32-bit integer ID. Identifiers for each (V)DAF specified in this document are defined in .

Sharding In order to protect the privacy of its measurements, a DAF Client shards its measurements into a sequence of input shares. The measurement_to_input_shares method is used for this purpose.

Daf.measurement_to_input_shares(input: Measurement, rand: Bytes[Daf.RAND_SIZE]) -> tuple[Bytes, Vec[Bytes]] is the randomized sharding algorithm run by each Client. The input rand consists of the random bytes consumed by the algorithm. This value MUST be generated using a cryptographically secure pseudorandom number generator (CSPRNG). It consumes the measurement and produces a "public share", distributed to each of the Aggregators, and a corresponding sequence of input shares, one for each Aggregator. The length of the output vector MUST be SHARES.

The Client divides its measurement into input shares and distributes them to the Aggregators. The public share is broadcast to all Aggregators.

Preparation Once an Aggregator has received the public share and one of the input shares, the next step is to prepare the input share for aggregation. This is accomplished using the following algorithm:

Daf.prep(agg_id: Unsigned, agg_param: AggParam, public_share: Bytes, input_share: Bytes) -> OutShare is the deterministic preparation algorithm. It takes as input the public share and one of the input shares generated by a Client, the Aggregator's unique identifier, and the aggregation parameter selected by the Collector and returns an output share.

The protocol in which the DAF is used MUST ensure that the Aggregator's identifier is equal to the integer in range [0, SHARES) that matches the index of input_share in the sequence of input shares output by the Client.

Validity of Aggregation Parameters Concrete DAFs implementations MAY impose certain restrictions for input shares and aggregation parameters. Protocols using a DAF MUST ensure that for each input share and aggregation parameter agg_param, Daf.prep is only called if Daf.is_valid(agg_param, previous_agg_params) returns True, where previous_agg_params contains all aggregation parameters that have previously been used with the same input share. DAFs MUST implement the following function:

Daf.is_valid(agg_param: AggParam, previous_agg_params: set[AggParam]) -> Bool: Checks if the agg_param is compatible with all elements of previous_agg_params.

Aggregation Once an Aggregator holds output shares for a batch of measurements (where batches are defined by the application), it combines them into a share of the desired aggregate result:

Daf.out_shares_to_agg_share(agg_param: AggParam, out_shares: Vec[OutShare]) -> agg_share: Bytes is the deterministic aggregation algorithm. It is run by each Aggregator a set of recovered output shares.

Aggregation of output shares. `B` indicates the number of measurements in the batch. For simplicity, we have written this algorithm in a "one-shot" form, where all output shares for a batch are provided at the same time. Many DAFs may also support a "streaming" form, where shares are processed one at a time. Implementation note: For most natural DAFs (and VDAFs) it is not necessary for an Aggregator to store all output shares individually before aggregating. Typically it is possible to merge output shares into aggregate shares as they arrive, merge these into other aggregate shares, and so on. In particular, this is the case when the output shares are vectors over some finite field and aggregating them involves merely adding up the vectors element-wise. Such is the case for Prio3 and Poplar1 .

Unsharding After the Aggregators have aggregated a sufficient number of output shares, each sends its aggregate share to the Collector, who runs the following algorithm to recover the following output:

Daf.agg_shares_to_result(agg_param: AggParam, agg_shares: Vec[Bytes], num_measurements: Unsigned) -> AggResult is run by the Collector in order to compute the aggregate result from the Aggregators' shares. The length of agg_shares MUST be SHARES. num_measurements is the number of measurements that contributed to each of the aggregate shares. This algorithm is deterministic.

Computation of the final aggregate result from aggregate shares.

QUESTION Maybe the aggregation algorithms should be randomized in order to allow the Aggregators (or the Collector) to add noise for differential privacy. (See the security considerations of .) Or is this out-of-scope of this document? See https://github.com/ietf-wg-ppm/ppm-specification/issues/19.

Execution of a DAF Securely executing a DAF involves emulating the following procedure.

Execution of a DAF. The inputs to this procedure are the same as the aggregation function computed by the DAF: An aggregation parameter and a sequence of measurements. The procedure prescribes how a DAF is executed in a "benign" environment in which there is no adversary and the messages are passed among the protocol participants over secure point-to-point channels. In reality, these channels need to be instantiated by some "wrapper protocol", such as , that realizes these channels using suitable cryptographic mechanisms. Moreover, some fraction of the Aggregators (or Clients) may be malicious and diverge from their prescribed behaviors. describes the execution of the DAF in various adversarial environments and what properties the wrapper protocol needs to provide in each.

Definition of VDAFs Like DAFs described in the previous section, a VDAF scheme is used to compute a particular aggregation function over a set of Client-generated measurements. Evaluation of a VDAF involves the same four stages as for DAFs: Sharding, Preparation, Aggregation, and Unsharding. However, the Preparation stage will require interaction among the Aggregators in order to facilitate verifiability of the computation's correctness. Accommodating this interaction will require syntactic changes. Overall execution of a VDAF comprises the following stages:

Sharding - Computing input shares from an individual measurement
Preparation - Conversion and verification of input shares to output shares compatible with the aggregation function being computed
Aggregation - Combining a sequence of output shares into an aggregate share
Unsharding - Combining a sequence of aggregate shares into an aggregate result

In contrast to DAFs, the Preparation stage for VDAFs now performs an additional task: Verification of the validity of the recovered output shares. This process ensures that aggregating the output shares will not lead to a garbled aggregate result. The remainder of this section defines the VDAF interface. The attributes are listed in are defined by each concrete VDAF. Constants and types defined by each concrete VDAF.

Parameter	Description
`ID`	Algorithm identifier for this VDAF
`VERIFY_KEY_SIZE`	Size (in bytes) of the verification key ()
`RAND_SIZE`	Size of the random byte string passed to sharding algorithm
`NONCE_SIZE`	Size (in bytes) of the nonce
`ROUNDS`	Number of rounds of communication during the Preparation stage ()
`SHARES`	Number of input shares into which each measurement is sharded ()
`Measurement`	Type of each measurement
`AggParam`	Type of aggregation parameter
`Prep`	State of each Aggregator during Preparation ()
`OutShare`	Type of each output share
`AggResult`	Type of the aggregate result

Similarly to DAFs (see {[sec-daf}}), any output of a VDAF method that must be transmitted from one party to another is treated as an opaque byte string. All other quantities are given a concrete type.

OPEN ISSUE It might be cleaner to define a type for each value, then have that type implement an encoding where necessary. See issue#58.

Each VDAF is identified by a unique, 32-bit integer ID. Identifiers for each (V)DAF specified in this document are defined in . The following method is defined for every VDAF: Bytes: """ Format domain separation tag for this VDAF with the given usage. """ return format_dst(0, Vdaf.ID, usage) ]]> It is used to construct a domain separation tag for an instance of Prg used by the VDAF. (See .)

Sharding Sharding transforms a measurement into input shares as it does in DAFs (cf. ); in addition, it takes a nonce as input and produces a public share:

Vdaf.measurement_to_input_shares(measurement: Measurement, nonce: Bytes[Vdaf.NONCE_SIZE], rand: Bytes[Vdaf.RAND_SIZE]) -> tuple[Bytes, Vec[Bytes]] is the randomized sharding algorithm run by each Client. Input rand consists of the random bytes consumed by the algorithm. It consumes the measurement and the nonce and produces a public share, distributed to each of Aggregators, and the corresponding sequence of input shares, one for each Aggregator. Depending on the VDAF, the input shares may encode additional information used to verify the recovered output shares (e.g., the "proof shares" in Prio3 ). The length of the output vector MUST be SHARES.

In order to ensure privacy of the measurement, the Client MUST generate the random bytes and nonce using a CSPRNG. (See for details.)

Preparation To recover and verify output shares, the Aggregators interact with one another over ROUNDS rounds. Prior to each round, each Aggregator constructs an outbound message. Next, the sequence of outbound messages is combined into a single message, called a "preparation message". (Each of the outbound messages are called "preparation-message shares".) Finally, the preparation message is distributed to the Aggregators to begin the next round. An Aggregator begins the first round with its input share and it begins each subsequent round with the previous preparation message. Its output in the last round is its output share and its output in each of the preceding rounds is a preparation-message share. This process involves a value called the "aggregation parameter" used to map the input shares to output shares. The Aggregators need to agree on this parameter before they can begin preparing inputs for aggregation.

VDAF preparation process on the input shares for a single measurement. At the end of the computation, each Aggregator holds an output share or an error. To facilitate the preparation process, a concrete VDAF implements the following class methods:

Vdaf.prep_init(verify_key: Bytes[Vdaf.VERIFY_KEY_SIZE], agg_id: Unsigned, agg_param: AggParam, nonce: Bytes[Vdaf.NONCE_SIZE], public_share: Bytes, input_share: Bytes) -> Prep is the deterministic preparation-state initialization algorithm run by each Aggregator to begin processing its input share into an output share. Its inputs are the shared verification key (verify_key), the Aggregator's unique identifier (agg_id), the aggregation parameter (agg_param), the nonce provided by the environment (nonce, see ), the public share (public_share), and one of the input shares generated by the Client (input_share). Its output is the Aggregator's initial preparation state. It is up to the high level protocol in which the VDAF is used to arrange for the distribution of the verification key prior to generating and processing reports. (See for details.) Protocols using the VDAF MUST ensure that the Aggregator's identifier is equal to the integer in range [0, SHARES) that matches the index of input_share in the sequence of input shares output by the Client. Protocols MUST ensure that public share consumed by each of the Aggregators is identical. This is security critical for VDAFs such as Poplar1.
Vdaf.prep_next(prep: Prep, inbound: Optional[Bytes]) -> Union[Tuple[Prep, Bytes], OutShare] is the deterministic preparation-state update algorithm run by each Aggregator. It updates the Aggregator's preparation state (prep) and returns either its next preparation state and its message share for the current round or, if this is the last round, its output share. An exception is raised if a valid output share could not be recovered. The input of this algorithm is the inbound preparation message or, if this is the first round, None.
Vdaf.prep_shares_to_prep(agg_param: AggParam, prep_shares: Vec[Bytes]) -> Bytes is the deterministic preparation-message pre-processing algorithm. It combines the preparation-message shares generated by the Aggregators in the previous round into the preparation message consumed by each in the next round.

In effect, each Aggregator moves through a linear state machine with ROUNDS+1 states. The Aggregator enters the first state on using the initialization algorithm, and the update algorithm advances the Aggregator to the next state. Thus, in addition to defining the number of rounds (ROUNDS), a VDAF instance defines the state of the Aggregator after each round.

TODO Consider how to bake this "linear state machine" condition into the syntax. Given that Python 3 is used as our pseudocode, it's easier to specify the preparation state using a class.

The preparation-state update accomplishes two tasks: recovery of output shares from the input shares and ensuring that the recovered output shares are valid. The abstraction boundary is drawn so that an Aggregator only recovers an output share if it is deemed valid (at least, based on the Aggregator's view of the protocol). Another way to draw this boundary would be to have the Aggregators recover output shares first, then verify that they are valid. However, this would allow the possibility of misusing the API by, say, aggregating an invalid output share. Moreover, in protocols like Prio+ based on oblivious transfer, it is necessary for the Aggregators to interact in order to recover aggregatable output shares at all. Note that it is possible for a VDAF to specify ROUNDS == 0, in which case each Aggregator runs the preparation-state update algorithm once and immediately recovers its output share without interacting with the other Aggregators. However, most, if not all, constructions will require some amount of interaction in order to ensure validity of the output shares (while also maintaining privacy).

OPEN ISSUE accommodating 0-round VDAFs may require syntax changes if, for example, public keys are required. On the other hand, we could consider defining this class of schemes as a different primitive. See issue#77.

Validity of Aggregation Parameters Similar to DAFs (see ), VDAFs MAY impose restrictions for input shares and aggregation parameters. Protocols using a VDAF MUST ensure that for each input share and aggregation parameter agg_param, the preparation phase (including Vdaf.prep_init, Vdaf.prep_next, and Vdaf.prep_shares_to_prep; see ) is only called if Vdaf.is_valid(agg_param, previous_agg_params) returns True, where previous_agg_params contains all aggregation parameters that have previously been used with the same input share. VDAFs MUST implement the following function:

Vdaf.is_valid(agg_param: AggParam, previous_agg_params: set[AggParam]) -> Bool: Checks if the agg_param is compatible with all elements of previous_agg_params.

Aggregation VDAF Aggregation is identical to DAF Aggregation (cf. ):

Vdaf.out_shares_to_agg_share(agg_param: AggParam, out_shares: Vec[OutShare]) -> agg_share: Bytes is the deterministic aggregation algorithm. It is run by each Aggregator over the output shares it has computed over a batch of measurement inputs.

The data flow for this stage is illustrated in . Here again, we have the aggregation algorithm in a "one-shot" form, where all shares for a batch are provided at the same time. VDAFs typically also support a "streaming" form, where shares are processed one at a time.

Unsharding VDAF Unsharding is identical to DAF Unsharding (cf. ):

Vdaf.agg_shares_to_result(agg_param: AggParam, agg_shares: Vec[Bytes], num_measurements: Unsigned) -> AggResult is run by the Collector in order to compute the aggregate result from the Aggregators' shares. The length of agg_shares MUST be SHARES. num_measurements is the number of measurements that contributed to each of the aggregate shares. This algorithm is deterministic.

The data flow for this stage is illustrated in .

Execution of a VDAF Secure execution of a VDAF involves simulating the following procedure.

Execution of a VDAF. The inputs to this algorithm are the aggregation parameter, a list of measurements, and a nonce for each measurement. This document does not specify how the nonces are chosen, but security requires that the nonces be unique. See for details. As explained in , the secure execution of a VDAF requires the application to instantiate secure channels between each of the protocol participants.

Communication Patterns for Preparation In each round of preparation, each Aggregator writes a prep share to the channel, which is then processed into the prep message using the public prep_shares_to_prep() algorithm and broadcast to the Aggregators to start the next round. In this section we describe some approaches to realizing this broadcast channel functionality in protocols that use VDAFs with at least one round of preparation. The state machine of each Aggregator for VDAF preparation is shown in .

State machine for VDAF preparation. Continued(prep_state) --> Finished(out_share) | | | | +--> Rejected <--+ ]]> State transitions are made when the state is acted upon by the host's local inputs and/or messages sent by the peers. The initial state is Start. The terminal states are Rejected, indicating that the report was rejected and cannot be processed any further, and Finished(out_share), indicating that the Aggregator has recovered an output share out_share.

Ping-Pong Topology (Only Two Aggregators) For VDAFs with precisely two Aggregators (i.e., Vdaf.SHARES == 2), the following "ping pong" communication pattern can be used. It is compatible with any request/response transport protocol, such as HTTP. The first state transition, from Start to Continued or Rejected, is induced by the following transition rule. No messages are sent or received during this transition. State: try: prep_state = Vdaf.prep_init( vdaf_verify_key, 0 if is_leader else 1, agg_param, nonce, public_share, host_input_share, ) return Continue(prep_state) except: return Rejected() ]]> If the state is Rejected, then processing halts. Otherwise, if the state is Continued, then processing continues using the following transition rule until a terminal state is reached. Let us call the initiating party the "Leader" and the responding party the "Helper". The high-level idea is that the Leader and Helper will take turns running the computation locally until input from their peer is required:

For a 1-round VDAF (e.g., Prio3 ()), the Leader sends its prep share to the Helper, who computes the prep message locally, computes its output share, then sends the prep message to the Leader. Preparation requires just one round trip between the Leader and the Helper.
For a 2-round VDAF (e.g., Poplar1 ()), the Leader sends its first-round prep share to the Helper, who replies with the first-round prep message and its second-round prep share. In the next request, the Leader computes its second-round prep share locally, computes its output share, and sends the second-round prep message to the Helper. Finally, the Helper computes its own output share.
In general, each request includes the Leader's prep share for the previous round and/or the prep message for the current round; correspondingly, each response consists of the prep message for the current round and the Helper's prep share for the next round.

The Aggregators proceed in this ping-ponging fashion until a step of the computation fails, indicating the report is invalid and should be rejected, or preparation is completed. All told there there are ceil((Vdaf.ROUNDS+1)/2) requests sent. Each message in the ping-pong protocol is structured as follows (expressed in TLS syntax ): ; case continue: opaque prep_msg<0..2^32-1>; opaque prep_share<0..2^32-1>; case finish: opaque prep_msg<0..2^32-1>; }; } Message; ]]> The Leader computes each state transition according to the following algorithm: (State, Optional[Message]): if inbound == None: prep_msg = None peer_prep_share = None elif inbound.type == 1: # continue prep_msg = inbound.prep_msg peer_prep_share = inbound.prep_share elif inbound.type == 2: # finish prep_msg = inbound.prep_msg peer_prep_share = None else: return (Rejected(), None) return Vdaf.ping_pong_transition( agg_param, prep_msg, peer_prep_share, state.prep_state, ) ]]> (The auxiliary function ping_pong_transition() is defined at the end of this section.) The input inbound denotes the last message received from the Helper. This parameter is optional since initially there is no inbound message. Likewise, the Helper computes each state transition according to the following algorithm: (State, Optional[bytes]): if inbound.type == 0: # initialize prep_msg = None peer_prep_share = inbound.prep_share elif inbound.type == 1: # continue prep_msg = inbound.prep_msg peer_prep_share = inbound.prep_share else: # finish prep_msg = inbound.prep_msg peer_prep_share = None return Vdaf.ping_pong_transition( agg_param, prep_msg, peer_prep_share, state.prep_state, ) ]]> At the start of each request/response cycle, the Leader runs: with state == Continued(leader_prep_state) and, if outbound != None, sends outbound to the Helper. For the initial request, inbound == None. To respond to the Leader, the Helper runs with state == Continued(helper_prep_state), where inbound is the message it received from the Leader, and sends outbound to the Leader. If state == Finished(out_share) at the end of a request/response cycle, then processing is complete. Note that, depending on the number of rounds of preparation that are required, there may be one more message to send before the peer can also finish processing (i.e., outbound != None). The core state transition logic is the same for both Aggregators: (State, Optional[Message]): try: # If `prep_msg == None` then this is the start of the # first round. Otherwise, `prep_msg` is the prep message # from the end of the previous round. out = Vdaf.prep_next(host_prep_state, prep_msg) if type(out) == Vdaf.OutShare: return (Finished(out), None) (host_prep_state, host_prep_share) = out if peer_prep_share != None: prep_shares = [peer_prep_share, host_prep_share] if is_leader: prep_shares.reverse() prep_msg = Vdaf.prep_shares_to_prep( agg_param, prep_shares, ) out = Vdaf.prep_next(host_prep_state, prep_msg) if type(out) == Vdaf.OutShare: outbound = Message.finish(prep_msg) return (Finished(out), outbound) (host_prep_state, host_prep_share) = out outbound = Message.continue(prep_msg, host_prep_share) else: outbound = Message.initialize(host_prep_share) return (Continued(host_prep_state), outbound) except: return (Rejected(), None) ]]>

Star Topology (Any Number of Aggregators) The ping-pong topology of the previous section is only suitable for VDAFs involving exactly two Aggregators. If more Aggregators are required, the star topology described in this section can be used instead.

TODO Describe the Leader-emulated broadcast channel architecture that was originally envisioned for DAP. (As of DAP-05 we are going with the ping pong architecture described in the previous section.)

Preliminaries This section describes the primitives that are common to the VDAFs specified in this document.

Finite Fields Both Prio3 and Poplar1 use finite fields of prime order. Finite field elements are represented by a class Field with the following associated parameters:

MODULUS: Unsigned is the prime modulus that defines the field.
ENCODED_SIZE: Unsigned is the number of bytes used to encode a field element as a byte string.

A concrete Field also implements the following class methods:

Field.zeros(length: Unsigned) -> output: Vec[Field] returns a vector of zeros. The length of output MUST be length.
Field.rand_vec(length: Unsigned) -> output: Vec[Field] returns a vector of random field elements. The length of output MUST be length.

A field element is an instance of a concrete Field. The concrete class defines the usual arithmetic operations on field elements. In addition, it defines the following instance method for converting a field element to an unsigned integer:

elem.as_unsigned() -> Unsigned returns the integer representation of field element elem.

Likewise, each concrete Field implements a constructor for converting an unsigned integer into a field element:

Field(integer: Unsigned) returns integer represented as a field element. The value of integer MUST be less than Field.MODULUS.

Finally, each concrete Field has two derived class methods, one for encoding a vector of field elements as a byte string and another for decoding a vector of field elements.

Derived class methods for finite fields. Bytes: encoded = Bytes() for x in data: encoded += to_le_bytes(x.as_unsigned(), Field.ENCODED_SIZE) return encoded def decode_vec(Field, encoded: Bytes) -> Vec[Field]: L = Field.ENCODED_SIZE if len(encoded) % L != 0: raise ERR_DECODE vec = [] for i in range(0, len(encoded), L): encoded_x = encoded[i:i+L] x = from_le_bytes(encoded_x) if x >= Field.MODULUS: raise ERR_DECODE # Integer is larger than modulus vec.append(Field(x)) return vec ]]>

Auxiliary Functions The following auxiliary functions on vectors of field elements are used in the remainder of this document. Note that an exception is raised by each function if the operands are not the same length.

Common functions for finite fields.

FFT-Friendly Fields Some VDAFs require fields that are suitable for efficient computation of the discrete Fourier transform, as this allows for fast polynomial interpolation. (One example is Prio3 () when instantiated with the generic FLP of .) Specifically, a field is said to be "FFT-friendly" if, in addition to satisfying the interface described in , it implements the following method:

Field.gen() -> Field returns the generator of a large subgroup of the multiplicative group. To be FFT-friendly, the order of this subgroup MUST be a power of 2. In addition, the size of the subgroup dictates how large interpolated polynomials can be. It is RECOMMENDED that a generator is chosen with order at least 2^20.

FFT-friendly fields also define the following parameter:

GEN_ORDER: Unsigned is the order of a multiplicative subgroup generated by Field.gen().

Parameters The tables below define finite fields used in the remainder of this document. Parameters for the finite fields used in this document.

Parameter	Field64	Field128	Field255
MODULUS	2^32 * 4294967295 + 1	2^66 * 4611686018427387897 + 1	2^255 - 19
ENCODED_SIZE	8	16	32
Generator	7^4294967295	7^4611686018427387897	n/a
GEN_ORDER	2^32	2^66	n/a

Pseudorandom Generators A pseudorandom generator (PRG) is used to expand a short, (pseudo)random seed into a long string of pseudorandom bits. A PRG suitable for this document implements the interface specified in this section. PRGs are defined by a class Prg with the following associated parameter:

SEED_SIZE: Unsigned is the size (in bytes) of a seed.

A concrete Prg implements the following class method:

Prg(seed: Bytes[Prg.SEED_SIZE], dst: Bytes, binder: Bytes) constructs an instance of Prg from the given seed, domain separation tag, and binder string. (See below for definitions of these.) The seed MUST be of length SEED_SIZE and MUST be generated securely (i.e., it is either the output of gen_rand or a previous invocation of the PRG).
prg.next(length: Unsigned) returns the next length bytes of output of PRG. If the seed was securely generated, the output can be treated as pseudorandom.

Each Prg has two derived class methods. The first is used to derive a fresh seed from an existing one. The second is used to compute a sequence of pseudorandom field elements. For each method, the seed MUST be of length SEED_SIZE and MUST be generated securely (i.e., it is either the output of gen_rand or a previous invocation of the PRG).

Derived class methods for PRGs.

PrgSha3 This section describes PrgSha3, a PRG based on the Keccak permutation of SHA-3 . Keccak is used in the cSHAKE128 mode of operation . This Prg is RECOMMENDED for all use cases within VDAFs.

Definition of PRG PrgSha3. Bytes: self.l += length # Function `cSHAKE128(x, l, n, s)` is as defined in # [SP800-185, Section 3.3]. # # Implementation note: Rather than re-generate the output # stream each time `next()` is invoked, most implementations # of SHA-3 will expose an "absorb-then-squeeze" API that # allows stateful handling of the stream. stream = cSHAKE128(self.x, self.l, b'', self.s) return stream[-length:] ]]>

PrgFixedKeyAes128 While PrgSha3 as described above can be securely used in all cases where a Prg is needed in the VDAFs described in this document, there are some cases where a more efficient instantiation based on fixed-key AES is possible. For now, this is limited to the Prg used inside the Idpf implementation in Poplar1 . It is NOT RECOMMENDED to use this Prg anywhere else. See Security Considerations for a more detailed discussion. Bytes: offset = self.length_consumed % 16 new_length = self.length_consumed + length block_range = range( int(self.length_consumed / 16), int(new_length / 16) + 1) self.length_consumed = new_length hashed_blocks = [ self.hash_block(xor(self.seed, to_le_bytes(i, 16))) \ for i in block_range ] return concat(hashed_blocks)[offset:offset+length] def hash_block(self, block): """ The multi-instance tweakable circular correlation-robust hash function of [GKWWY20] (Section 4.2). The tweak here is the key that stays constant for all PRG evaluations of the same Client, but differs between Clients. Function `AES128(key, block)` is the AES-128 blockcipher. """ lo, hi = block[:8], block[8:] sigma_block = concat([hi, xor(hi, lo)]) return xor(AES128(self.fixed_key, sigma_block), sigma_block) ]]>

The Domain Separation Tag and Binder String PRGs are used to map a seed to a finite domain, e.g., a fresh seed or a vector of field elements. To ensure domain separation, the derivation is needs to be bound to some distinguished domain separation tag. The domain separation tag encodes the following values:

The document version (i.e.,VERSION);
The "class" of the algorithm using the output (e.g., VDAF);
A unique identifier for the algorithm; and
Some indication of how the output is used (e.g., for deriving the measurement shares in Prio3 ).

The following algorithm is used in the remainder of this document in order to format the domain separation tag: Bytes: """Format PRG domain separation tag for use within a (V)DAF.""" return concat([ to_be_bytes(VERSION, 1), to_be_bytes(algo_class, 1), to_be_bytes(algo, 4), to_be_bytes(usage, 2), ]) ]]> It is also sometimes necessary to bind the output to some ephemeral value that multiple parties need to agree on. We call this input the "binder string".

Prio3 This section describes Prio3, a VDAF for Prio . Prio is suitable for a wide variety of aggregation functions, including (but not limited to) sum, mean, standard deviation, estimation of quantiles (e.g., median), and linear regression. In fact, the scheme described in this section is compatible with any aggregation function that has the following structure:

Each measurement is encoded as a vector over some finite field.
Input validity is determined by an arithmetic circuit evaluated over the encoded input. (An "arithmetic circuit" is a function comprised of arithmetic operations in the field.) The circuit's output is a single field element: if zero, then the input is said to be "valid"; otherwise, if the output is non-zero, then the input is said to be "invalid".
The aggregate result is obtained by summing up the encoded input vectors and computing some function of the sum.

At a high level, Prio3 distributes this computation as follows. Each Client first shards its measurement by first encoding it, then splitting the vector into secret shares and sending a share to each Aggregator. Next, in the preparation phase, the Aggregators carry out a multi-party computation to determine if their shares correspond to a valid input (as determined by the arithmetic circuit). This computation involves a "proof" of validity generated by the Client. Next, each Aggregator sums up its shares locally. Finally, the Collector sums up the aggregate shares and computes the aggregate result. This VDAF does not have an aggregation parameter. Instead, the output share is derived from the input share by applying a fixed map. See for an example of a VDAF that makes meaningful use of the aggregation parameter. As the name implies, Prio3 is a descendant of the original Prio construction. A second iteration was deployed in the system, and like the VDAF described here, the ENPA system was built from techniques introduced in that significantly improve communication cost. That system was specialized for a particular aggregation function; the goal of Prio3 is to provide the same level of generality as the original construction. The core component of Prio3 is a "Fully Linear Proof (FLP)" system. Introduced by , the FLP encapsulates the functionality required for encoding and validating inputs. Prio3 can be thought of as a transformation of a particular class of FLPs into a VDAF. The remainder of this section is structured as follows. The syntax for FLPs is described in . The generic transformation of an FLP into Prio3 is specified in . Next, a concrete FLP suitable for any validity circuit is specified in . Finally, instantiations of Prio3 for various types of measurements are specified in . Test vectors can be found in .

Fully Linear Proof (FLP) Systems Conceptually, an FLP is a two-party protocol executed by a prover and a verifier. In actual use, however, the prover's computation is carried out by the Client, and the verifier's computation is distributed among the Aggregators. The Client generates a "proof" of its input's validity and distributes shares of the proof to the Aggregators. Each Aggregator then performs some a computation on its input share and proof share locally and sends the result to the other Aggregators. Combining the exchanged messages allows each Aggregator to decide if it holds a share of a valid input. (See for details.) As usual, we will describe the interface implemented by a concrete FLP in terms of an abstract base class Flp that specifies the set of methods and parameters a concrete FLP must provide. The parameters provided by a concrete FLP are listed in . Constants and types defined by a concrete FLP.

Parameter	Description
`PROVE_RAND_LEN`	Length of the prover randomness, the number of random field elements consumed by the prover when generating a proof
`QUERY_RAND_LEN`	Length of the query randomness, the number of random field elements consumed by the verifier
`JOINT_RAND_LEN`	Length of the joint randomness, the number of random field elements consumed by both the prover and verifier
`INPUT_LEN`	Length of the encoded measurement ()
`OUTPUT_LEN`	Length of the aggregatable output ()
`PROOF_LEN`	Length of the proof
`VERIFIER_LEN`	Length of the verifier message generated by querying the input and proof
`Measurement`	Type of the measurement
`AggResult`	Type of the aggregate result
`Field`	As defined in ()

An FLP specifies the following algorithms for generating and verifying proofs of validity (encoding is described below in ):

Flp.prove(input: Vec[Field], prove_rand: Vec[Field], joint_rand: Vec[Field]) -> Vec[Field] is the deterministic proof-generation algorithm run by the prover. Its inputs are the encoded input, the "prover randomness" prove_rand, and the "joint randomness" joint_rand. The prover randomness is used only by the prover, but the joint randomness is shared by both the prover and verifier.
Flp.query(input: Vec[Field], proof: Vec[Field], query_rand: Vec[Field], joint_rand: Vec[Field], num_shares: Unsigned) -> Vec[Field] is the query-generation algorithm run by the verifier. This is used to "query" the input and proof. The result of the query (i.e., the output of this function) is called the "verifier message". In addition to the input and proof, this algorithm takes as input the query randomness query_rand and the joint randomness joint_rand. The former is used only by the verifier. num_shares specifies how many input and proof shares were generated.
Flp.decide(verifier: Vec[Field]) -> Bool is the deterministic decision algorithm run by the verifier. It takes as input the verifier message and outputs a boolean indicating if the input from which it was generated is valid.

Our application requires that the FLP is "fully linear" in the sense defined in . As a practical matter, what this property implies is that, when run on a share of the input and proof, the query-generation algorithm outputs a share of the verifier message. Furthermore, the privacy property of the FLP system ensures that the verifier message reveals nothing about the input's validity. Therefore, to decide if an input is valid, the Aggregators will run the query-generation algorithm locally, exchange verifier shares, combine them to recover the verifier message, and run the decision algorithm. The query-generation algorithm includes a parameter num_shares that specifies the number of shares of the input and proof that were generated. If these data are not secret shared, then num_shares == 1. This parameter is useful for certain FLP constructions. For example, the FLP in is defined in terms of an arithmetic circuit; when the circuit contains constants, it is sometimes necessary to normalize those constants to ensure that the circuit's output, when run on a valid input, is the same regardless of the number of shares. An FLP is executed by the prover and verifier as follows:

Execution of an FLP. The proof system is constructed so that, if inp is a valid input, then run_flp(Flp, inp, 1) always returns True. On the other hand, if inp is invalid, then as long as joint_rand and query_rand are generated uniform randomly, the output is False with overwhelming probability. We remark that defines a much larger class of fully linear proof systems than we consider here. In particular, what is called an "FLP" here is called a 1.5-round, public-coin, interactive oracle proof system in their paper.

Encoding the Input The type of measurement being aggregated is defined by the FLP. Hence, the FLP also specifies a method of encoding raw measurements as a vector of field elements:

Flp.encode(measurement: Measurement) -> Vec[Field] encodes a raw measurement as a vector of field elements. The return value MUST be of length INPUT_LEN.

For some FLPs, the encoded input also includes redundant field elements that are useful for checking the proof, but which are not needed after the proof has been checked. An example is the "integer sum" data type from in which an integer in range [0, 2^k) is encoded as a vector of k field elements, each representing a bit of the integer (this type is also defined in ). After consuming this vector, all that is needed is the integer it represents. Thus the FLP defines an algorithm for truncating the input to the length of the aggregated output:

Flp.truncate(input: Vec[Field]) -> Vec[Field] maps an encoded input (e.g., the bit-encoding of the input) to an aggregatable output (e.g., the singleton vector containing the input). The length of the input MUST be INPUT_LEN and the length of the output MUST be OUTPUT_LEN.

Once the aggregate shares have been computed and combined together, their sum can be converted into the aggregate result. This could be a projection from the FLP's field to the integers, or it could include additional post-processing.

Flp.decode(output: Vec[Field], num_measurements: Unsigned) -> AggResult maps a sum of aggregate shares to an aggregate result. The length of the input MUST be OUTPUT_LEN. num_measurements is the number of measurements that contributed to the aggregated output.

We remark that, taken together, these three functionalities correspond roughly to the notion of "Affine-aggregatable encodings (AFEs)" from .

Construction This section specifies Prio3, an implementation of the Vdaf interface (). It has two generic parameters: an Flp () and a Prg (). The associated constants and types required by the Vdaf interface are defined in . The methods required for sharding, preparation, aggregation, and unsharding are described in the remaining subsections. These methods refer to constants enumerated in . VDAF parameters for Prio3.

Parameter	Value
`VERIFY_KEY_SIZE`	`Prg.SEED_SIZE`
`RAND_SIZE`	`Prg.SEED_SIZE * (1 + 2 * (SHARES - 1)) if Flp.JOINT_RAND_LEN == 0 else Prg.SEED_SIZE * (1 + 2 * (SHARES - 1) + SHARES)`
`NONCE_SIZE`	`16`
`ROUNDS`	`1`
`SHARES`	in `[2, 256)`
`Measurement`	`Flp.Measurement`
`AggParam`	`None`
`Prep`	`Tuple[Vec[Flp.Field], Optional[Bytes], Bytes]`
`OutShare`	`Vec[Flp.Field]`
`AggResult`	`Flp.AggResult`

Constants used by Prio3.

Variable	Value
`USAGE_MEASUREMENT_SHARE: Unsigned`	1
`USAGE_PROOF_SHARE: Unsigned`	2
`USAGE_JOINT_RANDOMNESS: Unsigned`	3
`USAGE_PROVE_RANDOMNESS: Unsigned`	4
`USAGE_QUERY_RANDOMNESS: Unsigned`	5
`USAGE_JOINT_RAND_SEED: Unsigned`	6
`USAGE_JOINT_RAND_PART: Unsigned`	7

Sharding Recall from that the FLP syntax calls for "joint randomness" shared by the prover (i.e., the Client) and the verifier (i.e., the Aggregators). VDAFs have no such notion. Instead, the Client derives the joint randomness from its input in a way that allows the Aggregators to reconstruct it from their input shares. (This idea is based on the Fiat-Shamir heuristic and is described in Section 6.2.3 of .) The sharding algorithm involves the following steps:

Encode the Client's raw measurement as an input for the FLP
Shard the measurement into a sequence of measurement shares
Derive the joint randomness from the measurement shares and nonce
Run the FLP proof-generation algorithm using the derived joint randomness
Shard the proof into a sequence of proof shares
Return the public share, consisting of the joint randomness parts, and the input shares, each consisting of the measurement share, proof share, and blind of one of the Aggregators

The algorithm is specified below. Notice that only one set of input and proof shares (called the "leader" shares below) are vectors of field elements. The other shares (called the "helper" shares) are represented instead by PRG seeds, which are expanded into vectors of field elements. The definitions of constants and a few auxiliary functions are defined in .

Input-distribution algorithm for Prio3. 0 # Split the random input into the various seeds we'll need. if len(rand) != Prio3.RAND_SIZE: raise ERR_INPUT # unexpected length for random input seeds = [rand[i:i+l] for i in range(0,Prio3.RAND_SIZE,l)] if use_joint_rand: k_helper_seeds, seeds = front((Prio3.SHARES-1) * 3, seeds) k_helper_meas_shares = [ k_helper_seeds[i] for i in range(0, (Prio3.SHARES-1) * 3, 3) ] k_helper_proof_shares = [ k_helper_seeds[i] for i in range(1, (Prio3.SHARES-1) * 3, 3) ] k_helper_blinds = [ k_helper_seeds[i] for i in range(2, (Prio3.SHARES-1) * 3, 3) ] (k_leader_blind,), seeds = front(1, seeds) else: k_helper_seeds, seeds = front((Prio3.SHARES-1) * 2, seeds) k_helper_meas_shares = [ k_helper_seeds[i] for i in range(0, (Prio3.SHARES-1) * 2, 2) ] k_helper_proof_shares = [ k_helper_seeds[i] for i in range(1, (Prio3.SHARES-1) * 2, 2) ] k_helper_blinds = [None] * (Prio3.SHARES-1) k_leader_blind = None (k_prove,), seeds = front(1, seeds) # Finish measurement shares and joint randomness parts. inp = Prio3.Flp.encode(measurement) leader_meas_share = inp k_joint_rand_parts = [] for j in range(Prio3.SHARES-1): helper_meas_share = Prio3.Prg.expand_into_vec( Prio3.Flp.Field, k_helper_meas_shares[j], Prio3.domain_separation_tag(USAGE_MEASUREMENT_SHARE), byte(j+1), Prio3.Flp.INPUT_LEN ) leader_meas_share = vec_sub(leader_meas_share, helper_meas_share) if use_joint_rand: encoded = Prio3.Flp.Field.encode_vec(helper_meas_share) k_joint_rand_part = Prio3.Prg.derive_seed( k_helper_blinds[j], Prio3.domain_separation_tag(USAGE_JOINT_RAND_PART), byte(j+1) + nonce + encoded, ) k_joint_rand_parts.append(k_joint_rand_part) # Finish joint randomness. if use_joint_rand: encoded = Prio3.Flp.Field.encode_vec(leader_meas_share) k_joint_rand_part = Prio3.Prg.derive_seed( k_leader_blind, Prio3.domain_separation_tag(USAGE_JOINT_RAND_PART), byte(0) + nonce + encoded, ) k_joint_rand_parts.insert(0, k_joint_rand_part) joint_rand = Prio3.Prg.expand_into_vec( Prio3.Flp.Field, Prio3.joint_rand(k_joint_rand_parts), Prio3.domain_separation_tag(USAGE_JOINT_RANDOMNESS), b'', Prio3.Flp.JOINT_RAND_LEN, ) else: joint_rand = [] # Finish the proof shares. prove_rand = Prio3.Prg.expand_into_vec( Prio3.Flp.Field, k_prove, Prio3.domain_separation_tag(USAGE_PROVE_RANDOMNESS), b'', Prio3.Flp.PROVE_RAND_LEN, ) proof = Prio3.Flp.prove(inp, prove_rand, joint_rand) leader_proof_share = proof for j in range(Prio3.SHARES-1): helper_proof_share = Prio3.Prg.expand_into_vec( Prio3.Flp.Field, k_helper_proof_shares[j], Prio3.domain_separation_tag(USAGE_PROOF_SHARE), byte(j+1), Prio3.Flp.PROOF_LEN, ) leader_proof_share = vec_sub(leader_proof_share, helper_proof_share) # Each Aggregator's input share contains its measurement share, # proof share, and blind. The public share contains the # Aggregators' joint randomness parts. input_shares = [] input_shares.append(Prio3.encode_leader_share( leader_meas_share, leader_proof_share, k_leader_blind, )) for j in range(Prio3.SHARES-1): input_shares.append(Prio3.encode_helper_share( k_helper_meas_shares[j], k_helper_proof_shares[j], k_helper_blinds[j], )) public_share = Prio3.encode_public_share(k_joint_rand_parts) return (public_share, input_shares) ]]>

Preparation This section describes the process of recovering output shares from the input shares. The high-level idea is that each Aggregator first queries its input and proof share locally, then exchanges its verifier share with the other Aggregators. The verifier shares are then combined into the verifier message, which is used to decide whether to accept. In addition, the Aggregators must ensure that they have all used the same joint randomness for the query-generation algorithm. The joint randomness is generated by a PRG seed. Each Aggregator derives a "part" of this seed from its input share and the "blind" generated by the Client. The seed is derived by hashing together the parts, so before running the query-generation algorithm, it must first gather the parts derived by the other Aggregators. In order to avoid extra round of communication, the Client sends each Aggregator a "hint" consisting of the other Aggregators' parts of the joint randomness seed. This leaves open the possibility that the Client cheated by, say, forcing the Aggregators to use joint randomness that biases the proof check procedure some way in its favor. To mitigate this, the Aggregators also check that they have all computed the same joint randomness seed before accepting their output shares. To do so, they exchange their parts of the joint randomness along with their verifier shares. The definitions of constants and a few auxiliary functions are defined in .

Preparation state for Prio3. 0: encoded = Prio3.Flp.Field.encode_vec(meas_share) k_joint_rand_part = Prio3.Prg.derive_seed(k_blind, Prio3.domain_separation_tag(USAGE_JOINT_RAND_PART), byte(agg_id) + nonce + encoded) k_joint_rand_parts[agg_id] = k_joint_rand_part k_corrected_joint_rand = Prio3.joint_rand(k_joint_rand_parts) joint_rand = Prio3.Prg.expand_into_vec( Prio3.Flp.Field, k_corrected_joint_rand, Prio3.domain_separation_tag(USAGE_JOINT_RANDOMNESS), b'', Prio3.Flp.JOINT_RAND_LEN, ) # Query the measurement and proof share. query_rand = Prio3.Prg.expand_into_vec( Prio3.Flp.Field, verify_key, Prio3.domain_separation_tag(USAGE_QUERY_RANDOMNESS), nonce, Prio3.Flp.QUERY_RAND_LEN, ) verifier_share = Prio3.Flp.query(meas_share, proof_share, query_rand, joint_rand, Prio3.SHARES) prep_msg = Prio3.encode_prep_share(verifier_share, k_joint_rand_part) return (out_share, k_corrected_joint_rand, prep_msg) def prep_next(Prio3, prep, inbound): (out_share, k_corrected_joint_rand, prep_msg) = prep if inbound is None: return (prep, prep_msg) k_joint_rand_check = Prio3.decode_prep_msg(inbound) if k_joint_rand_check != k_corrected_joint_rand: raise ERR_VERIFY # joint randomness check failed return out_share def prep_shares_to_prep(Prio3, _agg_param, prep_shares): verifier = Prio3.Flp.Field.zeros(Prio3.Flp.VERIFIER_LEN) k_joint_rand_parts = [] for encoded in prep_shares: (verifier_share, k_joint_rand_part) = \ Prio3.decode_prep_share(encoded) verifier = vec_add(verifier, verifier_share) if Prio3.Flp.JOINT_RAND_LEN > 0: k_joint_rand_parts.append(k_joint_rand_part) if not Prio3.Flp.decide(verifier): raise ERR_VERIFY # proof verifier check failed k_joint_rand_check = None if Prio3.Flp.JOINT_RAND_LEN > 0: k_joint_rand_check = Prio3.joint_rand(k_joint_rand_parts) return Prio3.encode_prep_msg(k_joint_rand_check) ]]>

Validity of Aggregation Parameters Every input share MUST only be used once, regardless of the aggregation parameters used.

Validity of aggregation parameters for Prio3.

Aggregation Aggregating a set of output shares is simply a matter of adding up the vectors element-wise.

Aggregation algorithm for Prio3.

Unsharding To unshard a set of aggregate shares, the Collector first adds up the vectors element-wise. It then converts each element of the vector into an integer.

Computation of the aggregate result for Prio3.

Auxiliary Functions This section defines a number of auxiliary functions referenced by the main algorithms for Prio3 in the preceding sections. The following method is called by the sharding and preparation algorithms to derive the joint randomness.

Message Serialization The following methods are used for encoding and decoding the leader's (i.e., the Aggregator with ID 0) VDAF input share. The leader's share consists of the full-length measurement and proof shares. 0: encoded += k_blind return encoded def decode_leader_share(Prio3, encoded): l = Prio3.Flp.Field.ENCODED_SIZE * Prio3.Flp.INPUT_LEN encoded_meas_share, encoded = encoded[:l], encoded[l:] meas_share = Prio3.Flp.Field.decode_vec(encoded_meas_share) l = Prio3.Flp.Field.ENCODED_SIZE * Prio3.Flp.PROOF_LEN encoded_proof_share, encoded = encoded[:l], encoded[l:] proof_share = Prio3.Flp.Field.decode_vec(encoded_proof_share) l = Prio3.Prg.SEED_SIZE if Prio3.Flp.JOINT_RAND_LEN == 0: if len(encoded) != 0: raise ERR_DECODE return (meas_share, proof_share, None) k_blind, encoded = encoded[:l], encoded[l:] if len(encoded) != 0: raise ERR_DECODE return (meas_share, proof_share, k_blind) ]]> Next, the methods below are used for encoding and decoding the helpers' (i.e., non-leader) VDAF input shares. Each consists of PRG seeds that are expanded into the measurement and proof shares. 0: encoded += k_blind return encoded def decode_helper_share(Prio3, agg_id, encoded): c_meas_share = Prio3.domain_separation_tag(USAGE_MEASUREMENT_SHARE) c_proof_share = Prio3.domain_separation_tag(USAGE_PROOF_SHARE) l = Prio3.Prg.SEED_SIZE k_meas_share, encoded = encoded[:l], encoded[l:] meas_share = Prio3.Prg.expand_into_vec(Prio3.Flp.Field, k_meas_share, c_meas_share, byte(agg_id), Prio3.Flp.INPUT_LEN) k_proof_share, encoded = encoded[:l], encoded[l:] proof_share = Prio3.Prg.expand_into_vec(Prio3.Flp.Field, k_proof_share, c_proof_share, byte(agg_id), Prio3.Flp.PROOF_LEN) if Prio3.Flp.JOINT_RAND_LEN == 0: if len(encoded) != 0: raise ERR_DECODE return (meas_share, proof_share, None) k_blind, encoded = encoded[:l], encoded[l:] if len(encoded) != 0: raise ERR_DECODE return (meas_share, proof_share, k_blind) ]]> Next, the methods below are used for encoding and decoding the VDAF public share. 0: encoded += concat(k_joint_rand_parts) return encoded def decode_public_share(Prio3, encoded): l = Prio3.Prg.SEED_SIZE if Prio3.Flp.JOINT_RAND_LEN == 0: if len(encoded) != 0: raise ERR_DECODE return None k_joint_rand_parts = [] for i in range(Prio3.SHARES): k_joint_rand_part, encoded = encoded[:l], encoded[l:] k_joint_rand_parts.append(k_joint_rand_part) if len(encoded) != 0: raise ERR_DECODE return k_joint_rand_parts ]]> Finally, the methods below are used for encoding and decoding the values transmitted during VDAF preparation. 0: encoded += k_joint_rand return encoded def decode_prep_share(Prio3, encoded): l = Prio3.Flp.Field.ENCODED_SIZE * Prio3.Flp.VERIFIER_LEN encoded_verifier, encoded = encoded[:l], encoded[l:] verifier = Prio3.Flp.Field.decode_vec(encoded_verifier) if Prio3.Flp.JOINT_RAND_LEN == 0: if len(encoded) != 0: raise ERR_DECODE return (verifier, None) l = Prio3.Prg.SEED_SIZE k_joint_rand, encoded = encoded[:l], encoded[l:] if len(encoded) != 0: raise ERR_DECODE return (verifier, k_joint_rand) def encode_prep_msg(Prio3, k_joint_rand_check): encoded = Bytes() if Prio3.Flp.JOINT_RAND_LEN > 0: encoded += k_joint_rand_check return encoded def decode_prep_msg(Prio3, encoded): if Prio3.Flp.JOINT_RAND_LEN == 0: if len(encoded) != 0: raise ERR_DECODE return None l = Prio3.Prg.SEED_SIZE k_joint_rand_check, encoded = encoded[:l], encoded[l:] if len(encoded) != 0: raise ERR_DECODE return k_joint_rand_check ]]>

A General-Purpose FLP This section describes an FLP based on the construction from in , Section 4.2. We begin in with an overview of their proof system and the extensions to their proof system made here. The construction is specified in .

OPEN ISSUE We're not yet sure if specifying this general-purpose FLP is desirable. It might be preferable to specify specialized FLPs for each data type that we want to standardize, for two reasons. First, clear and concise specifications are likely easier to write for specialized FLPs rather than the general one. Second, we may end up tailoring each FLP to the measurement type in a way that improves performance, but breaks compatibility with the general-purpose FLP. In any case, we can't make this decision until we know which data types to standardize, so for now, we'll stick with the general-purpose construction. The reference implementation can be found at https://github.com/cfrg/draft-irtf-cfrg-vdaf/tree/main/poc.

OPEN ISSUE Chris Wood points out that the this section reads more like a paper than a standard. Eventually we'll want to work this into something that is readily consumable by the CFRG.

Overview In the proof system of , validity is defined via an arithmetic circuit evaluated over the input: If the circuit output is zero, then the input is deemed valid; otherwise, if the circuit output is non-zero, then the input is deemed invalid. Thus the goal of the proof system is merely to allow the verifier to evaluate the validity circuit over the input. For our application (), this computation is distributed among multiple Aggregators, each of which has only a share of the input. Suppose for a moment that the validity circuit C is affine, meaning its only operations are addition and multiplication-by-constant. In particular, suppose the circuit does not contain a multiplication gate whose operands are both non-constant. Then to decide if an input x is valid, each Aggregator could evaluate C on its share of x locally, broadcast the output share to its peers, then combine the output shares locally to recover C(x). This is true because for any SHARES-way secret sharing of x it holds that (Note that, for this equality to hold, it may be necessary to scale any constants in the circuit by SHARES.) However this is not the case if C is not-affine (i.e., it contains at least one multiplication gate whose operands are non-constant). In the proof system of , the proof is designed to allow the (distributed) verifier to compute the non-affine operations using only linear operations on (its share of) the input and proof. To make this work, the proof system is restricted to validity circuits that exhibit a special structure. Specifically, an arithmetic circuit with "G-gates" (see , Definition 5.2) is composed of affine gates and any number of instances of a distinguished gate G, which may be non-affine. We will refer to this class of circuits as 'gadget circuits' and to G as the "gadget". As an illustrative example, consider a validity circuit C that recognizes the set L = set([0], [1]). That is, C takes as input a length-1 vector x and returns 0 if x[0] is in [0,2) and outputs something else otherwise. This circuit can be expressed as the following degree-2 polynomial: This polynomial recognizes L because x[0]^2 = x[0] is only true if x[0] == 0 or x[0] == 1. Notice that the polynomial involves a non-affine operation, x[0]^2. In order to apply , Theorem 4.3, the circuit needs to be rewritten in terms of a gadget that subsumes this non-affine operation. For example, the gadget might be multiplication: The validity circuit can then be rewritten in terms of Mul like so: The proof system of allows the verifier to evaluate each instance of the gadget (i.e., Mul(x[0], x[0]) in our example) using a linear function of the input and proof. The proof is constructed roughly as follows. Let C be the validity circuit and suppose the gadget is arity-L (i.e., it has L input wires.). Let wire[j-1,k-1] denote the value of the jth wire of the kth call to the gadget during the evaluation of C(x). Suppose there are M such calls and fix distinct field elements alpha[0], ..., alpha[M-1]. (We will require these points to have a special property, as we'll discuss in ; but for the moment it is only important that they are distinct.) The prover constructs from wire and alpha a polynomial that, when evaluated at alpha[k-1], produces the output of the kth call to the gadget. Let us call this the "gadget polynomial". Polynomial evaluation is linear, which means that, in the distributed setting, the Client can disseminate additive shares of the gadget polynomial that the Aggregators then use to compute additive shares of each gadget output, allowing each Aggregator to compute its share of C(x) locally. There is one more wrinkle, however: It is still possible for a malicious prover to produce a gadget polynomial that would result in C(x) being computed incorrectly, potentially resulting in an invalid input being accepted. To prevent this, the verifier performs a probabilistic test to check that the gadget polynomial is well-formed. This test, and the procedure for constructing the gadget polynomial, are described in detail in .

Extensions The FLP described in the next section extends the proof system , Section 4.2 in three ways. First, the validity circuit in our construction includes an additional, random input (this is the "joint randomness" derived from the input shares in Prio3; see ). This allows for circuit optimizations that trade a small soundness error for a shorter proof. For example, consider a circuit that recognizes the set of length-N vectors for which each element is either one or zero. A deterministic circuit could be constructed for this language, but it would involve a large number of multiplications that would result in a large proof. (See the discussion in , Section 5.2 for details). A much shorter proof can be constructed for the following randomized circuit: (Note that this is a special case of , Theorem 5.2.) Here inp is the length-N input and r is a random field element. The gadget circuit Range2 is the "range-check" polynomial described above, i.e., Range2(x) = x^2 - x. The idea is that, if inp is valid (i.e., each inp[j] is in [0,2)), then the circuit will evaluate to 0 regardless of the value of r; but if inp[j] is not in [0,2) for some j, the output will be non-zero with high probability. The second extension implemented by our FLP allows the validity circuit to contain multiple gadget types. (This generalization was suggested in , Remark 4.5.) For example, the following circuit is allowed, where Mul and Range2 are the gadgets defined above (the input has length N+1): Finally, , Theorem 4.3 makes no restrictions on the choice of the fixed points alpha[0], ..., alpha[M-1], other than to require that the points are distinct. In this document, the fixed points are chosen so that the gadget polynomial can be constructed efficiently using the Cooley-Tukey FFT ("Fast Fourier Transform") algorithm. Note that this requires the field to be "FFT-friendly" as defined in .

Validity Circuits The FLP described in is defined in terms of a validity circuit Valid that implements the interface described here. A concrete Valid defines the following parameters: Validity circuit parameters.

Parameter	Description
`GADGETS`	A list of gadgets
`GADGET_CALLS`	Number of times each gadget is called
`INPUT_LEN`	Length of the input
`OUTPUT_LEN`	Length of the aggregatable output
`JOINT_RAND_LEN`	Length of the random input
`Measurement`	The type of measurement
`AggResult`	Type of the aggregate result
`Field`	An FFT-friendly finite field as defined in

Each gadget G in GADGETS defines a constant DEGREE that specifies the circuit's "arithmetic degree". This is defined to be the degree of the polynomial that computes it. For example, the Mul circuit in is defined by the polynomial Mul(x) = x * x, which has degree 2. Hence, the arithmetic degree of this gadget is 2. Each gadget also defines a parameter ARITY that specifies the circuit's arity (i.e., the number of input wires). A concrete Valid provides the following methods for encoding a measurement as an input vector, truncating an input vector to the length of an aggregatable output, and converting an aggregated output to an aggregate result:

Valid.encode(measurement: Measurement) -> Vec[Field] returns a vector of length INPUT_LEN representing a measurement.
Valid.truncate(input: Vec[Field]) -> Vec[Field] returns a vector of length OUTPUT_LEN representing an aggregatable output.
Valid.decode(output: Vec[Field], num_measurements: Unsigned) -> AggResult returns an aggregate result.

Finally, the following class methods are derived for each concrete Valid:

Derived methods for validity circuits.

Construction This section specifies FlpGeneric, an implementation of the Flp interface (). It has as a generic parameter a validity circuit Valid implementing the interface defined in .

NOTE A reference implementation can be found in https://github.com/cfrg/draft-irtf-cfrg-vdaf/blob/main/poc/flp_generic.py.

The FLP parameters for FlpGeneric are defined in . The required methods for generating the proof, generating the verifier, and deciding validity are specified in the remaining subsections. In the remainder, we let [n] denote the set {1, ..., n} for positive integer n. We also define the following constants:

Let H = len(Valid.GADGETS)
For each i in [H]:
- Let G_i = Valid.GADGETS[i]
- Let L_i = Valid.GADGETS[i].ARITY
- Let M_i = Valid.GADGET_CALLS[i]
- Let P_i = next_power_of_2(M_i+1)
- Let alpha_i = Field.gen()^(Field.GEN_ORDER / P_i)

FLP Parameters of FlpGeneric.

Parameter	Value
`PROVE_RAND_LEN`	`Valid.prove_rand_len()` (see )
`QUERY_RAND_LEN`	`Valid.query_rand_len()` (see )
`JOINT_RAND_LEN`	`Valid.JOINT_RAND_LEN`
`INPUT_LEN`	`Valid.INPUT_LEN`
`OUTPUT_LEN`	`Valid.OUTPUT_LEN`
`PROOF_LEN`	`Valid.proof_len()` (see )
`VERIFIER_LEN`	`Valid.verifier_len()` (see )
`Measurement`	`Valid.Measurement`
`Field`	`Valid.Field`

Proof Generation On input inp, prove_rand, and joint_rand, the proof is computed as follows:

For each i in [H] create an empty table wire_i.
Partition the prover randomness prove_rand into sub-vectors seed_1, ..., seed_H where len(seed_i) == L_i for all i in [H]. Let us call these the "wire seeds" of each gadget.
Evaluate Valid on input of inp and joint_rand, recording the inputs of each gadget in the corresponding table. Specifically, for every i in [H], set wire_i[j-1,k-1] to the value on the jth wire into the kth call to gadget G_i.
Compute the "wire polynomials". That is, for every i in [H] and j in [L_i], construct poly_wire_i[j-1], the jth wire polynomial for the ith gadget, as follows:
- Let w = [seed_i[j-1], wire_i[j-1,0], ..., wire_i[j-1,M_i-1]].
- Let padded_w = w + Field.zeros(P_i - len(w)).
- NOTE We pad w to the nearest power of 2 so that we can use FFT for interpolating the wire polynomials. Perhaps there is some clever math for picking wire_inp in a way that avoids having to pad.
- Let poly_wire_i[j-1] be the lowest degree polynomial for which poly_wire_i[j-1](alpha_i^k) == padded_w[k] for all k in [P_i].
Compute the "gadget polynomials". That is, for every i in [H]:
- Let poly_gadget_i = G_i(poly_wire_i[0], ..., poly_wire_i[L_i-1]). That is, evaluate the circuit G_i on the wire polynomials for the ith gadget. (Arithmetic is in the ring of polynomials over Field.)

The proof is the vector proof = seed_1 + coeff_1 + ... + seed_H + coeff_H, where coeff_i is the vector of coefficients of poly_gadget_i for each i in [H].

Query Generation On input of inp, proof, query_rand, and joint_rand, the verifier message is generated as follows:

For every i in [H] create an empty table wire_i.
Partition proof into the sub-vectors seed_1, coeff_1, ..., seed_H, coeff_H defined in .
Evaluate Valid on input of inp and joint_rand, recording the inputs of each gadget in the corresponding table. This step is similar to the prover's step (3.) except the verifier does not evaluate the gadgets. Instead, it computes the output of the kth call to G_i by evaluating poly_gadget_i(alpha_i^k). Let v denote the output of the circuit evaluation.
Compute the wire polynomials just as in the prover's step (4.).
Compute the tests for well-formedness of the gadget polynomials. That is, for every i in [H]:
- Let t = query_rand[i]. Check if t^(P_i) == 1: If so, then raise ERR_ABORT and halt. (This prevents the verifier from inadvertently leaking a gadget output in the verifier message.)
- Let y_i = poly_gadget_i(t).
- For each j in [0,L_i) let x_i[j-1] = poly_wire_i[j-1](t).

The verifier message is the vector verifier = [v] + x_1 + [y_1] + ... + x_H + [y_H].

Decision On input of vector verifier, the verifier decides if the input is valid as follows:

Parse verifier into v, x_1, y_1, ..., x_H, y_H as defined in .
Check for well-formedness of the gadget polynomials. For every i in [H]:
- Let z = G_i(x_i). That is, evaluate the circuit G_i on x_i and set z to the output.
- If z != y_i, then return False and halt.
Return True if v == 0 and False otherwise.

Encoding The FLP encoding and truncation methods invoke Valid.encode, Valid.truncate, and Valid.decode in the natural way.

Instantiations This section specifies instantiations of Prio3 for various measurement types. Each uses FlpGeneric as the FLP () and is determined by a validity circuit () and a PRG (). Test vectors for each can be found in .

NOTE Reference implementations of each of these VDAFs can be found in https://github.com/cfrg/draft-irtf-cfrg-vdaf/blob/main/poc/vdaf_prio3.sage.

Prio3Count Our first instance of Prio3 is for a simple counter: Each measurement is either one or zero and the aggregate result is the sum of the measurements. This instance uses PrgSha3 () as its PRG. Its validity circuit, denoted Count, uses Field64 () as its finite field. Its gadget, denoted Mul, is the degree-2, arity-2 gadget defined as The validity circuit is defined as The measurement is encoded and decoded as a singleton vector in the natural way. The parameters for this circuit are summarized below. Parameters of validity circuit Count.

Parameter	Value
`GADGETS`	`[Mul]`
`GADGET_CALLS`	`[1]`
`INPUT_LEN`	`1`
`OUTPUT_LEN`	`1`
`JOINT_RAND_LEN`	`0`
`Measurement`	`Unsigned`, in range `[0,2)`
`AggResult`	`Unsigned`
`Field`	`Field64` ()

Prio3Sum The next instance of Prio3 supports summing of integers in a pre-determined range. Each measurement is an integer in range [0, 2^bits), where bits is an associated parameter. This instance of Prio3 uses PrgSha3 () as its PRG. Its validity circuit, denoted Sum, uses Field128 () as its finite field. The measurement is encoded as a length-bits vector of field elements, where the lth element of the vector represents the lth bit of the summand: measurement or measurement >= 2 ** Sum.INPUT_LEN: raise ERR_INPUT encoded = [] for l in range(Sum.INPUT_LEN): encoded.append(Sum.Field((measurement >> l) & 1)) return encoded def truncate(Sum, inp): decoded = Sum.Field(0) for (l, b) in enumerate(inp): w = Sum.Field(1 << l) decoded += w * b return [decoded] def decode(Sum, output, _num_measurements): return output[0].as_unsigned() ]]> The validity circuit checks that the input consists of ones and zeros. Its gadget, denoted Range2, is the degree-2, arity-1 gadget defined as The validity circuit is defined as Parameters of validity circuit Sum.

Parameter	Value
`GADGETS`	`[Range2]`
`GADGET_CALLS`	`[bits]`
`INPUT_LEN`	`bits`
`OUTPUT_LEN`	`1`
`JOINT_RAND_LEN`	`1`
`Measurement`	`Unsigned`, in range `[0, 2^bits)`
`AggResult`	`Unsigned`
`Field`	`Field128` ()

Prio3Histogram This instance of Prio3 allows for estimating the distribution of some quantity by computing a simple histogram. Each measurement increments one histogram bucket, out of a set of fixed buckets. (Bucket indexing begins at 0.) For example, the buckets might quantize the real numbers, and each measurement would report the bucket that the corresponding client's real-numbered value falls into. The aggregate result counts the number of measurements in each bucket. This instance of Prio3 uses PrgSha3 () as its PRG. Its validity circuit, denoted Histogram, uses Field128 () as its finite field. Let length be the number of histogram buckets. The measurement is encoded as a one-hot vector representing the bucket into which the measurement falls: The validity circuit uses Range2 (see ) as its single gadget. It checks for one-hotness in two steps, as follows: Note that this circuit depends on the number of shares into which the input is sharded. This is provided to the FLP by Prio3. Parameters of validity circuit Histogram.

Parameter	Value
`GADGETS`	`[Range2]`
`GADGET_CALLS`	`[length]`
`INPUT_LEN`	`length`
`OUTPUT_LEN`	`length`
`JOINT_RAND_LEN`	`2`
`Measurement`	`Unsigned`
`AggResult`	`Vec[Unsigned]`
`Field`	`Field128` ()

Poplar1 This section specifies Poplar1, a VDAF for the following task. Each Client holds a string of length BITS and the Aggregators hold a set of l-bit strings, where l <= BITS. We will refer to the latter as the set of "candidate prefixes". The Aggregators' goal is to count how many inputs are prefixed by each candidate prefix. This functionality is the core component of the Poplar protocol , which was designed to compute the heavy hitters over a set of input strings. At a high level, the protocol works as follows.

Each Client splits its input string into input shares and sends one share to each Aggregator.
The Aggregators agree on an initial set of candidate prefixes, say 0 and 1.
The Aggregators evaluate the VDAF on each set of input shares and aggregate the recovered output shares. The aggregation parameter is the set of candidate prefixes.
The Aggregators send their aggregate shares to the Collector, who combines them to recover the counts of each candidate prefix.
Let H denote the set of prefixes that occurred at least t times. If the prefixes all have length BITS, then H is the set of t-heavy-hitters. Otherwise compute the next set of candidate prefixes, e.g., for each p in H, add p || 0 and p || 1 to the set. Repeat step 3 with the new set of candidate prefixes.

Poplar1 is constructed from an "Incremental Distributed Point Function (IDPF)", a primitive described by that generalizes the notion of a Distributed Point Function (DPF) . Briefly, a DPF is used to distribute the computation of a "point function", a function that evaluates to zero on every input except at a programmable "point". The computation is distributed in such a way that no one party knows either the point or what it evaluates to. An IDPF generalizes this "point" to a path on a full binary tree from the root to one of the leaves. It is evaluated on an "index" representing a unique node of the tree. If the node is on the programmed path, then the function evaluates to a non-zero value; otherwise it evaluates to zero. This structure allows an IDPF to provide the functionality required for the above protocol: To compute the hit count for an index, just evaluate each set of IDPF shares at that index and add up the results. Consider the sub-tree constructed from a set of input strings and a target threshold t by including all indices that prefix at least t of the input strings. We shall refer to this structure as the "prefix tree" for the batch of inputs and target threshold. To compute the t-heavy hitters for a set of inputs, the Aggregators and Collector first compute the prefix tree, then extract the heavy hitters from the leaves of this tree. (Note that the prefix tree may leak more information about the set than the heavy hitters themselves; see for details.) Poplar1 composes an IDPF with the "secure sketching" protocol of . This protocol ensures that evaluating a set of input shares on a unique set of candidate prefixes results in shares of a "one-hot" vector, i.e., a vector that is zero everywhere except for one element, which is equal to one. The remainder of this section is structured as follows. IDPFs are defined in ; a concrete instantiation is given . The Poplar1 VDAF is defined in in terms of a generic IDPF. Finally, a concrete instantiation of Poplar1 is specified in ; test vectors can be found in .

Incremental Distributed Point Functions (IDPFs) An IDPF is defined over a domain of size 2^BITS, where BITS is constant defined by the IDPF. Indexes into the IDPF tree are encoded as integers in range [0, 2^BITS). The Client specifies an index alpha and a vector of values beta, one for each "level" L in range [0, BITS). The key generation algorithm generates one IDPF "key" for each Aggregator. When evaluated at level L and index 0 <= prefix < 2^L, each IDPF key returns an additive share of beta[L] if prefix is the L-bit prefix of alpha and shares of zero otherwise. An index x is defined to be a prefix of another index y as follows. Let LSB(x, N) denote the least significant N bits of positive integer x. By definition, a positive integer 0 <= x < 2^L is said to be the length-L prefix of positive integer 0 <= y < 2^BITS if LSB(x, L) is equal to the most significant L bits of LSB(y, BITS), For example, 6 (110 in binary) is the length-3 prefix of 25 (11001), but 7 (111) is not. Each of the programmed points beta is a vector of elements of some finite field. We distinguish two types of fields: One for inner nodes (denoted Idpf.FieldInner), and one for leaf nodes (Idpf.FieldLeaf). (Our instantiation of Poplar1 () will use a much larger field for leaf nodes than for inner nodes. This is to ensure the IDPF is "extractable" as defined in , Definition 1.) A concrete IDPF defines the types and constants enumerated in . In the remainder we write Idpf.Vec as shorthand for the type Union[Vec[Vec[Idpf.FieldInner]], Vec[Vec[Idpf.FieldLeaf]]]. (This type denotes either a vector of inner node field elements or leaf node field elements.) The scheme is comprised of the following algorithms:

Idpf.gen(alpha: Unsigned, beta_inner: Vec[Vec[Idpf.FieldInner]], beta_leaf: Vec[Idpf.FieldLeaf], binder: Bytes, rand: Bytes["Idpf.RAND_SIZE"]) -> Tuple[ Bytes, Vec[Bytes]] is the randomized IDPF-key generation algorithm. (Input rand consists of the random bytes it consumes.) Its inputs are the index alpha the values beta, and a binder string. The value of alpha MUST be in range [0, 2^BITS). The output is a public part that is sent to all Aggregators and a vector of private IDPF keys, one for each aggregator.
Idpf.eval(agg_id: Unsigned, public_share: Bytes, key: Bytes, level: Unsigned, prefixes: Tuple[Unsigned, ...], binder: Bytes) -> Idpf.Vec is the deterministic, stateless IDPF-key evaluation algorithm run by each Aggregator. Its inputs are the Aggregator's unique identifier, the public share distributed to all of the Aggregators, the Aggregator's IDPF key, the "level" at which to evaluate the IDPF, the sequence of candidate prefixes, and a binder string. It returns the share of the value corresponding to each candidate prefix. The output type depends on the value of level: If level < Idpf.BITS-1, the output is the value for an inner node, which has type Vec[Vec[Idpf.FieldInner]]; otherwise, if level == Idpf.BITS-1, then the output is the value for a leaf node, which has type Vec[Vec[Idpf.FieldLeaf]]. The value of level MUST be in range [0, BITS). The indexes in prefixes MUST all be distinct and in range [0, 2^level). Applications MUST ensure that the Aggregator's identifier is equal to the integer in range [0, SHARES) that matches the index of key in the sequence of IDPF keys output by the Client.

In addition, the following method is derived for each concrete Idpf: Finally, an implementation note. The interface for IDPFs specified here is stateless, in the sense that there is no state carried between IDPF evaluations. This is to align the IDPF syntax with the VDAF abstraction boundary, which does not include shared state across across VDAF evaluations. In practice, of course, it will often be beneficial to expose a stateful API for IDPFs and carry the state across evaluations. See for details. Constants and types defined by a concrete IDPF.

Parameter	Description
SHARES	Number of IDPF keys output by IDPF-key generator
BITS	Length in bits of each input string
VALUE_LEN	Number of field elements of each output value
RAND_SIZE	Size of the random string consumed by the IDPF-key generator. Equal to twice the PRG's seed size.
KEY_SIZE	Size in bytes of each IDPF key
FieldInner	Implementation of `Field` () used for values of inner nodes
FieldLeaf	Implementation of `Field` used for values of leaf nodes

Construction This section specifies Poplar1, an implementation of the Vdaf interface (). It is defined in terms of any Idpf () for which Idpf.SHARES == 2 and Idpf.VALUE_LEN == 2 and an implementation of Prg (). The associated constants and types required by the Vdaf interface are defined in . The methods required for sharding, preparation, aggregation, and unsharding are described in the remaining subsections. These methods make use of constants defined in . VDAF parameters for Poplar1.

Parameter	Value
`VERIFY_KEY_SIZE`	`Prg.SEED_SIZE`
`RAND_SIZE`	`Prg.SEED_SIZE * 3 + Idpf.RAND_SIZE`
`NONCE_SIZE`	`16`
`ROUNDS`	`2`
`SHARES`	`2`
`Measurement`	`Unsigned`
`AggParam`	`Tuple[Unsigned, Tuple[Unsigned, ...]]`
`Prep`	`Tuple[Bytes, Unsigned, Idpf.Vec]`
`OutShare`	`Idpf.Vec`
`AggResult`	`Vec[Unsigned]`

Constants used by Poplar1.

Variable	Value
USAGE_SHARD_RAND: Unsigned	1
USAGE_CORR_INNER: Unsigned	2
USAGE_CORR_LEAF: Unsigned	3
USAGE_VERIFY_RAND: Unsigned	4

Client The Client's input is an IDPF index, denoted alpha. The programmed IDPF values are pairs of field elements (1, k) where each k is chosen at random. This random value is used as part of the secure sketching protocol of , Appendix C.4. After evaluating their IDPF key shares on a given sequence of candidate prefixes, the sketching protocol is used by the Aggregators to verify that they hold shares of a one-hot vector. In addition, for each level of the tree, the prover generates random elements a, b, and c and computes and sends additive shares of a, b, c, A and B to the Aggregators. Putting everything together, the sharding algorithm is defined as follows. Function encode_input_shares is defined in .

The sharding algorithm for Poplar1.

Preparation The aggregation parameter encodes a sequence of candidate prefixes. When an Aggregator receives an input share from the Client, it begins by evaluating its IDPF share on each candidate prefix, recovering a data_share and auth_share for each. The Aggregators use these and the correlation shares provided by the Client to verify that the sequence of data_share values are additive shares of a one-hot vector. Aggregators MUST ensure the candidate prefixes are all unique and appear in lexicographic order. (This is enforced in the definition of prep_init() below.) Uniqueness is necessary to ensure the refined measurement (i.e., the sum of the output shares) is in fact a one-hot vector. Otherwise, sketch verification might fail, causing the Aggregators to erroneously reject a report that is actually valid. Note that enforcing the order is not strictly necessary, but this does allow uniqueness to be determined more efficiently. The algorithms below make use of the auxiliary function decode_input_share() defined in .

Preparation state for Poplar1. = prefixes[i]: raise ERR_INPUT # out-of-order prefix # Evaluate the IDPF key at the given set of prefixes. value = Poplar1.Idpf.eval( agg_id, public_share, key, level, prefixes) # Get shares of the correlated randomness for computing the # Aggregator's share of the sketch for the given level of the IDPF # tree. if level < Poplar1.Idpf.BITS - 1: corr_prg = Poplar1.Prg( corr_seed, Poplar1.domain_separation_tag(USAGE_CORR_INNER), byte(agg_id) + nonce, ) # Fast-forward the PRG state to the current level. corr_prg.next_vec(Field, 3 * level) else: corr_prg = Poplar1.Prg( corr_seed, Poplar1.domain_separation_tag(USAGE_CORR_LEAF), byte(agg_id) + nonce, ) (a_share, b_share, c_share) = corr_prg.next_vec(Field, 3) (A_share, B_share) = corr_inner[2*level:2*(level+1)] \ if level < Poplar1.Idpf.BITS - 1 else corr_leaf # Compute the Aggregator's first round of the sketch. These are # called the "masked input values" [BBCGGI21, Appendix C.4]. verify_rand_prg = Poplar1.Prg( verify_key, Poplar1.domain_separation_tag(USAGE_VERIFY_RAND), nonce + to_be_bytes(level, 2), ) verify_rand = verify_rand_prg.next_vec(Field, len(prefixes)) sketch_share = [a_share, b_share, c_share] out_share = [] for (i, r) in enumerate(verify_rand): (data_share, auth_share) = value[i] sketch_share[0] += data_share * r sketch_share[1] += data_share * r ** 2 sketch_share[2] += auth_share * r out_share.append(data_share) prep_mem = sketch_share \ + [A_share, B_share, Field(agg_id)] \ + out_share return (b'ready', level, prep_mem) def prep_next(Poplar1, prep_state, opt_sketch): (step, level, prep_mem) = prep_state Field = Poplar1.Idpf.current_field(level) # Aggregators exchange masked input values (step (3.) # of [BBCGGI21, Appendix C.4]). if step == b'ready' and opt_sketch == None: sketch_share, prep_mem = prep_mem[:3], prep_mem[3:] return ((b'sketch round 1', level, prep_mem), Field.encode_vec(sketch_share)) # Aggregators exchange evaluated shares (step (4.)). elif step == b'sketch round 1' and opt_sketch != None: prev_sketch = Field.decode_vec(opt_sketch) if len(prev_sketch) == 0: prev_sketch = Field.zeros(3) elif len(prev_sketch) != 3: raise ERR_INPUT # prep message malformed (A_share, B_share, agg_id), prep_mem = \ prep_mem[:3], prep_mem[3:] sketch_share = [ agg_id * (prev_sketch[0] ** 2 - prev_sketch[1] - prev_sketch[2]) + A_share * prev_sketch[0] + B_share ] return ((b'sketch round 2', level, prep_mem), Field.encode_vec(sketch_share)) elif step == b'sketch round 2' and opt_sketch != None: if len(opt_sketch) == 0: return prep_mem # Output shares else: raise ERR_INPUT # prep message malformed raise ERR_INPUT # unexpected input def prep_shares_to_prep(Poplar1, agg_param, prep_shares): if len(prep_shares) != 2: raise ERR_INPUT # unexpected number of prep shares (level, _) = agg_param Field = Poplar1.Idpf.current_field(level) sketch = vec_add(Field.decode_vec(prep_shares[0]), Field.decode_vec(prep_shares[1])) if len(sketch) == 3: return Field.encode_vec(sketch) elif len(sketch) == 1: if sketch == Field.zeros(1): # In order to reduce communication overhead, let the # empty string denote a successful sketch verification. return b'' else: raise ERR_VERIFY # sketch verification failed else: return ERR_INPUT # unexpected input length ]]>

Validity of Aggregation Parameters Aggregation parameters are valid for a given input share if no aggregation parameter with the same level has been used with the same input share before. The whole preparation phase MUST NOT be run more than once for a given combination of input share and level.

Validity of aggregation parameters for Poplar1.

Aggregation Aggregation involves simply adding up the output shares.

Aggregation algorithm for Poplar1.

Unsharding Finally, the Collector unshards the aggregate result by adding up the aggregate shares.

Computation of the aggregate result for Poplar1.

Auxiliary Functions

Message Serialization This section defines methods for serializing input shares, as required by the Vdaf interface. Optional serialization of the aggregation parameter is also specified below. Implementation note: The aggregation parameter includes the level of the IDPF tree and the sequence of indices to evaluate. For implementations that perform per-report caching across executions of the VDAF, this may be more information than is strictly needed. In particular, it may be sufficient to convey which indices from the previous execution will have their children included in the next. This would help reduce communication overhead. 2 ** 16 - 1: raise ERR_INPUT # level too deep if len(prefixes) > 2 ** 32 - 1: raise ERR_INPUT # too many prefixes encoded = Bytes() encoded += to_be_bytes(level, 2) encoded += to_be_bytes(len(prefixes), 4) packed = 0 for (i, prefix) in enumerate(prefixes): packed |= prefix << ((level+1) * i) l = ((level+1) * len(prefixes) + 7) // 8 encoded += to_be_bytes(packed, l) return encoded def decode_agg_param(Poplar1, encoded): encoded_level, encoded = encoded[:2], encoded[2:] level = from_be_bytes(encoded_level) encoded_prefix_count, encoded = encoded[:4], encoded[4:] prefix_count = from_be_bytes(encoded_prefix_count) l = ((level+1) * prefix_count + 7) // 8 encoded_packed, encoded = encoded[:l], encoded[l:] packed = from_be_bytes(encoded_packed) prefixes = [] m = 2 ** (level+1) - 1 for i in range(prefix_count): prefixes.append(packed >> ((level+1) * i) & m) if len(encoded) != 0: raise ERR_INPUT return (level, tuple(prefixes)) ]]>

The IDPF scheme of In this section we specify a concrete IDPF, called IdpfPoplar, suitable for instantiating Poplar1. The scheme gets its name from the name of the protocol of .

TODO We should consider giving IdpfPoplar a more distinctive name.

The constant and type definitions required by the Idpf interface are given in . IdpfPoplar requires a PRG for deriving the output shares, as well as a variety of other artifacts used internally. For performance reasons, we instantiate this object using PrgFixedKeyAes128 (). See for justification of this choice. Constants and type definitions for IdpfPoplar.

Parameter	Value
SHARES	`2`
BITS	any positive integer
VALUE_LEN	any positive integer
KEY_SIZE	`Prg.SEED_SIZE`
FieldInner	`Field64` ()
FieldLeaf	`Field255` ()

Key Generation

TODO Describe the construction in prose, beginning with a gentle introduction to the high level idea.

The description of the IDPF-key generation algorithm makes use of auxiliary functions extend(), convert(), and encode_public_share() defined in . In the following, we let Field2 denote the field GF(2).

IDPF-key generation algorithm of IdpfPoplar. = 2 ** IdpfPoplar.BITS: raise ERR_INPUT # alpha too long if len(beta_inner) != IdpfPoplar.BITS - 1: raise ERR_INPUT # beta_inner vector is the wrong size if len(rand) != IdpfPoplar.RAND_SIZE: raise ERR_INPUT # unexpected length for random input init_seed = [ rand[:PrgFixedKeyAes128.SEED_SIZE], rand[PrgFixedKeyAes128.SEED_SIZE:], ] seed = init_seed.copy() ctrl = [Field2(0), Field2(1)] correction_words = [] for level in range(IdpfPoplar.BITS): Field = IdpfPoplar.current_field(level) keep = (alpha >> (IdpfPoplar.BITS - level - 1)) & 1 lose = 1 - keep bit = Field2(keep) (s0, t0) = IdpfPoplar.extend(seed[0], binder) (s1, t1) = IdpfPoplar.extend(seed[1], binder) seed_cw = xor(s0[lose], s1[lose]) ctrl_cw = ( t0[0] + t1[0] + bit + Field2(1), t0[1] + t1[1] + bit, ) x0 = xor(s0[keep], ctrl[0].conditional_select(seed_cw)) x1 = xor(s1[keep], ctrl[1].conditional_select(seed_cw)) (seed[0], w0) = IdpfPoplar.convert(level, x0, binder) (seed[1], w1) = IdpfPoplar.convert(level, x1, binder) ctrl[0] = t0[keep] + ctrl[0] * ctrl_cw[keep] ctrl[1] = t1[keep] + ctrl[1] * ctrl_cw[keep] b = beta_inner[level] if level < IdpfPoplar.BITS-1 \ else beta_leaf if len(b) != IdpfPoplar.VALUE_LEN: raise ERR_INPUT # beta too long or too short w_cw = vec_add(vec_sub(b, w0), w1) # Implementation note: Here we negate the correction word if # the control bit `ctrl[1]` is set. We avoid branching on the # value in order to reduce leakage via timing side channels. mask = Field(1) - Field(2) * Field(ctrl[1].as_unsigned()) for i in range(len(w_cw)): w_cw[i] *= mask correction_words.append((seed_cw, ctrl_cw, w_cw)) public_share = IdpfPoplar.encode_public_share(correction_words) return (public_share, init_seed) ]]>

Key Evaluation

TODO Describe in prose how IDPF-key evaluation algorithm works.

The description of the IDPF-evaluation algorithm makes use of auxiliary functions extend(), convert(), and decode_public_share() defined in .

IDPF-evaluation generation algorithm of IdpfPoplar. = IdpfPoplar.SHARES: raise ERR_INPUT # invalid aggregator ID if level >= IdpfPoplar.BITS: raise ERR_INPUT # level too deep if len(set(prefixes)) != len(prefixes): raise ERR_INPUT # candidate prefixes are non-unique correction_words = IdpfPoplar.decode_public_share(public_share) out_share = [] for prefix in prefixes: if prefix >= 2 ** (level+1): raise ERR_INPUT # prefix too long # The Aggregator's output share is the value of a node of # the IDPF tree at the given `level`. The node's value is # computed by traversing the path defined by the candidate # `prefix`. Each node in the tree is represented by a seed # (`seed`) and a set of control bits (`ctrl`). seed = init_seed ctrl = Field2(agg_id) for current_level in range(level+1): bit = (prefix >> (level - current_level)) & 1 # Implementation note: Typically the current round of # candidate prefixes would have been derived from # aggregate results computed during previous rounds. For # example, when using `IdpfPoplar` to compute heavy # hitters, a string whose hit count exceeded the given # threshold in the last round would be the prefix of each # `prefix` in the current round. (See [BBCGGI21, # Section 5.1].) In this case, part of the path would # have already been traversed. # # Re-computing nodes along previously traversed paths is # wasteful. Implementations can eliminate this added # complexity by caching nodes (i.e., `(seed, ctrl)` # pairs) output by previous calls to `eval_next()`. (seed, ctrl, y) = IdpfPoplar.eval_next( seed, ctrl, correction_words[current_level], current_level, bit, binder, ) out_share.append(y if agg_id == 0 else vec_neg(y)) return out_share def eval_next(IdpfPoplar, prev_seed, prev_ctrl, correction_word, level, bit, binder): """ Compute the next node in the IDPF tree along the path determined by a candidate prefix. The next node is determined by `bit`, the bit of the prefix corresponding to the next level of the tree. TODO Consider implementing some version of the optimization discussed at the end of [BBCGGI21, Appendix C.2]. This could on average reduce the number of AES calls by a constant factor. """ Field = IdpfPoplar.current_field(level) (seed_cw, ctrl_cw, w_cw) = correction_word (s, t) = IdpfPoplar.extend(prev_seed, binder) s[0] = xor(s[0], prev_ctrl.conditional_select(seed_cw)) s[1] = xor(s[1], prev_ctrl.conditional_select(seed_cw)) t[0] += ctrl_cw[0] * prev_ctrl t[1] += ctrl_cw[1] * prev_ctrl next_ctrl = t[bit] (next_seed, y) = IdpfPoplar.convert(level, s[bit], binder) # Implementation note: Here we add the correction word to the # output if `next_ctrl` is set. We avoid branching on the value of # the control bit in order to reduce side channel leakage. mask = Field(next_ctrl.as_unsigned()) for i in range(len(y)): y[i] += w_cw[i] * mask return (next_seed, next_ctrl, y) ]]>

Auxiliary Functions

Helper functions for IdpfPoplar. > 1) & 1)] return (s, t) def convert(IdpfPoplar, level, seed, binder): prg = PrgFixedKeyAes128(seed, format_dst(1, 0, 1), binder) next_seed = prg.next(PrgFixedKeyAes128.SEED_SIZE) Field = IdpfPoplar.current_field(level) w = prg.next_vec(Field, IdpfPoplar.VALUE_LEN) return (next_seed, w) def encode_public_share(IdpfPoplar, correction_words): encoded = Bytes() control_bits = list(itertools.chain.from_iterable( cw[1] for cw in correction_words )) encoded += pack_bits(control_bits) for (level, (seed_cw, _, w_cw)) \ in enumerate(correction_words): Field = IdpfPoplar.current_field(level) encoded += seed_cw encoded += Field.encode_vec(w_cw) return encoded def decode_public_share(IdpfPoplar, encoded): l = (2*IdpfPoplar.BITS + 7) // 8 encoded_ctrl, encoded = encoded[:l], encoded[l:] control_bits = unpack_bits(encoded_ctrl, 2 * IdpfPoplar.BITS) correction_words = [] for level in range(IdpfPoplar.BITS): Field = IdpfPoplar.current_field(level) ctrl_cw = ( control_bits[level * 2], control_bits[level * 2 + 1], ) l = PrgFixedKeyAes128.SEED_SIZE seed_cw, encoded = encoded[:l], encoded[l:] l = Field.ENCODED_SIZE * IdpfPoplar.VALUE_LEN encoded_w_cw, encoded = encoded[:l], encoded[l:] w_cw = Field.decode_vec(encoded_w_cw) correction_words.append((seed_cw, ctrl_cw, w_cw)) if len(encoded) != 0: raise ERR_DECODE return correction_words ]]> Here, pack_bits() takes a list of bits, packs each group of eight bits into a byte, in LSB to MSB order, padding the most significant bits of the last byte with zeros as necessary, and returns the byte array. unpack_bits() performs the reverse operation: it takes in a byte array and a number of bits, and returns a list of bits, extracting eight bits from each byte in turn, in LSB to MSB order, and stopping after the requested number of bits. If the byte array has an incorrect length, or if unused bits in the last bytes are not zero, it throws an error.

Instantiation By default, Poplar1 is instantiated with IdpfPoplar (VALUE_LEN == 2) and PrgSha3 (). This VDAF is suitable for any positive value of BITS. Test vectors can be found in .

Security Considerations VDAFs have two essential security goals:

Privacy: An attacker that controls the network, the Collector, and a subset of Clients and Aggregators learns nothing about the measurements of honest Clients beyond what it can deduce from the aggregate result.
Robustness: An attacker that controls the network and a subset of Clients cannot cause the Collector to compute anything other than the aggregate of the measurements of honest Clients.

Formal definitions of privacy and robustness can be found in . A VDAF is the core cryptographic primitive of a protocol that achieves the above privacy and robustness goals. It is not sufficient on its own, however. The application will need to assure a few security properties, for example:

Securely distributing the long-lived parameters, in particular the verification key.
Establishing secure channels:
- Confidential and authentic channels among Aggregators, and between the Aggregators and the Collector; and
- Confidential and Aggregator-authenticated channels between Clients and Aggregators.
Enforcing the non-collusion properties required of the specific VDAF in use.

In such an environment, a VDAF provides the high-level privacy property described above: The Collector learns only the aggregate measurement, and nothing about individual measurements aside from what can be inferred from the aggregate result. The Aggregators learn neither individual measurements nor the aggregate result. The Collector is assured that the aggregate statistic accurately reflects the inputs as long as the Aggregators correctly executed their role in the VDAF. On their own, VDAFs do not mitigate Sybil attacks . In this attack, the adversary observes a subset of input shares transmitted by a Client it is interested in. It allows the input shares to be processed, but corrupts and picks bogus measurements for the remaining Clients. Applications can guard against these risks by adding additional controls on report submission, such as Client authentication and rate limits. VDAFs do not inherently provide differential privacy . The VDAF approach to private measurement can be viewed as complementary to differential privacy, relying on non-collusion instead of statistical noise to protect the privacy of the inputs. It is possible that a future VDAF could incorporate differential privacy features, e.g., by injecting noise before the sharding stage and removing it after unsharding.

Requirements for the Verification Key The Aggregators are responsible for exchanging the verification key in advance of executing the VDAF. Any procedure is acceptable as long as the following conditions are met:

To ensure robustness of the computation, the Aggregators MUST NOT reveal the verification key to the Clients. Otherwise, a malicious Client might be able to exploit knowledge of this key to craft an invalid report that would be accepted by the Aggregators.
To ensure privacy of the measurements, the Aggregators MUST commit to the verification key prior to processing reports generated by Clients. Otherwise, a malicious Aggregator may be able to craft a verification key that, for a given report, causes an honest Aggregator to leak information about the measurement during preparation.

Meeting these conditions is required in order to leverage security analysis in the framework of . Their definition of robustness allows the attacker, playing the role of a cohort of malicious Clients, to submit arbitrary reports to the Aggregators and eavesdrop on their communications as they process them. Security in this model is achievable as long as the verification key is kept secret from the attacker. The privacy definition of considers an active attacker that controls the network and a subset of Aggregators; in addition, the attacker is allowed to choose the verification key used by each honest Aggregator over the course of the experiment. Security is achievable in this model as long as the key is picked at the start of the experiment, prior to any reports being generated. (The model also requires nonces to be generated at random; see below.) Meeting these requirements is relatively straightforward. For example, the Aggregators may designate one of their peers to generate the verification key and distribute it to the others. To assure Clients of key commitment, the Clients and (honest) Aggregators could bind reports to a shared context string derived from the key. For instance, the "task ID" of DAP could be set to the hash of the verification key; then as long as honest Aggregators only consume reports for the task indicated by the Client, forging a new key after the fact would reduce to finding collisions in the underlying hash function. (Keeping the key secret from the Clients would require the hash function to be one-way.) However, since rotating the key implies rotating the task ID, this scheme would not allow key rotation over the lifetime of a task.

Requirements for the Nonce The sharding and preparation steps of VDAF execution depend on a nonce associated with the Client's report. To ensure privacy of the underlying measurement, the Client MUST generate this nonce using a CSPRNG. This is required in order to leverage security analysis for the privacy definition of , which assumes the nonce is chosen at random prior to generating the report. Other security considerations may require the nonce to be non-repeating. For example, to achieve differential privacy it is necessary to avoid "over exposing" a measurement by including it too many times in a single batch or across multiple batches. It is RECOMMENDED that the nonce generated by the Client be used by the Aggregators for replay protection.

Requirements for the Aggregation Parameters As described in and respectively, DAFs and VDAFs may impose restrictions on the re-use of input shares. This is to ensure that correlated randomness provided by the Client through the input share is not used more than once, which might compromise confidentiality of the Client's measurements. Protocols that make use of VDAFs therefore MUST call Vdaf.is_valid on the set of all aggregation parameters used for a Client's input share, and only proceed with the preparation and aggregation phases if that function call returns True.

Additional Privacy Considerations Aggregating a batch of reports multiple times, each time with a different aggregation parameter, could result in information leakage beyond what is used by the application. For example, when Poplar1 is used for heavy hitters, the Aggregators learn not only the heavy hitters themselves, but also the prefix tree (as defined in ) computed along the way. Indeed, this leakage is inherent to any construction that uses an IDPF () in the same way. Depending on the distribution of the measurements, the prefix tree can leak a significant amount of information about unpopular inputs. For instance, it is possible (though perhaps unlikely) for a large set of non-heavy-hitter values to share a common prefix, which would be leaked by a prefix tree with a sufficiently small threshold. The only known, general-purpose approach to mitigating this leakage is via differential privacy.

TODO(issue #94) Describe (or point to some description of) the central DP mechanism for Poplar described in .

Pseudorandom Generators and Random Oracles The objects we describe in share a common interface, which we have called Prg. However, these are not necessarily all modeled as cryptographic Pseudorandom Generators in the security analyses of our protocols. Instead, most of them are modeled as random oracles. For these use cases, we want to be conservative in our assumptions, and hence prescribe PrgSha3 as the only RECOMMENDED Prg instantiation. The one exception is the PRG used in the Idpf implementation IdpfPoplar . Here, a random oracle is not needed to prove security, and hence a construction based on fixed-key AES can be used. However, as PrgFixedKeyAes128 has been shown to be differentiable from a random oracle , it is NOT RECOMMENDED to use it anywhere else.

OPEN ISSUE: We may want to drop the common interface for PRGs and random oracles. See issue #159.

IANA Considerations A codepoint for each (V)DAF in this document is defined in the table below. Note that 0xFFFF0000 through 0xFFFFFFFF are reserved for private use. Unique identifiers for (V)DAFs.

Value	Scheme	Type	Reference
`0x00000000`	Prio3Count	VDAF
`0x00000001`	Prio3Sum	VDAF
`0x00000002`	Prio3Histogram	VDAF
`0x00000003` to `0x00000FFF`	reserved for Prio3	VDAF	n/a
`0x00001000`	Poplar1	VDAF
`0xFFFF0000` to `0xFFFFFFFF`	reserved	n/a	n/a

TODO Add IANA considerations for the codepoints summarized in .

References Normative References SHA-3 Derived Functions: cSHAKE, KMAC, TupleHash and ParallelHash SHA-3 Standard: Permutation-Based Hash and Extendable-Output Functions Key words for use in RFCs to Indicate Requirement Levels In many standards track documents several words are used to signify the requirements in the specification. These words are often capitalized. This document defines these words as they should be interpreted in IETF documents. This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements. Ambiguity of Uppercase vs Lowercase in RFC 2119 Key Words RFC 2119 specifies common key words that may be used in protocol specifications. This document aims to reduce the ambiguity by clarifying that only UPPERCASE usage of the key words have the defined special meanings. The Transport Layer Security (TLS) Protocol Version 1.3 This document specifies version 1.3 of the Transport Layer Security (TLS) protocol. TLS allows client/server applications to communicate over the Internet in a way that is designed to prevent eavesdropping, tampering, and message forgery. This document updates RFCs 5705 and 6066, and obsoletes RFCs 5077, 5246, and 6961. This document also specifies new requirements for TLS 1.2 implementations. Informative References Prio+: Privacy Preserving Aggregate Statistics via Boolean Shares Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs Lightweight Techniques for Private Heavy Hitters Prio: Private, Robust, and Scalable Computation of Aggregate Statistics The Sybil Attack Verifiable Distributed Aggregation Functions n.d. Differential Privacy RAPPOR: Randomized Aggregatable Privacy-Preserving Ordinal Response Exposure Notification Privacy-preserving Analytics (ENPA) White Paper Distributed Point Functions and Their Applications Better concrete security for half-gates garbling (in the multi-instance setting) Origin Telemetry Distributed Aggregation Protocol for Privacy Preserving Measurement ISRG Cloudflare Mozilla Cloudflare There are many situations in which it is desirable to take measurements of data which people consider sensitive. In these cases, the entity taking the measurement is usually not interested in people's individual responses but rather in aggregated data. Conventional methods require collecting individual responses and then aggregating them, thus representing a threat to user privacy and rendering many such measurements difficult and impractical. This document describes a multi-party distributed aggregation protocol (DAP) for privacy preserving measurement (PPM) which can be used to collect aggregate data without revealing any individual user's data.

Acknowledgments The security considerations in are based largely on the security analysis of . Thanks to Hannah Davis and Mike Rosulek, who lent their time to developing definitions and security proofs. Thanks to Henry Corrigan-Gibbs, Armando Faz-Hernández, Simon Friedberger, Tim Geoghegan, Brandon Pitman, Mariana Raykova, Jacob Rothstein, Xiao Wang, and Christopher Wood for useful feedback on and contributions to the spec.

Test Vectors

NOTE Machine-readable test vectors can be found at https://github.com/cfrg/draft-irtf-cfrg-vdaf/tree/main/poc/test_vec.

Test vectors cover the generation of input shares and the conversion of input shares into output shares. Vectors specify the verification key, measurements, aggregation parameter, and any parameters needed to construct the VDAF. (For example, for Prio3Sum, the user specifies the number of bits for representing each summand.) Byte strings are encoded in hexadecimal. To make the tests deterministic, the random inputs of randomized algorithms were fixed to the byte sequence starting with 0, incrementing by 1, and wrapping at 256:

Prio3Count - input_share_0: >- 3ead59ec98fe1c4f70171b7a5f0b5c731ae0c48b62f687b98e981a811540934d76db 271df5a3a6e97105856c18576573 input_share_1: >- 000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f round_0: prep_share_0: >- 4c151ee49ef43488213d8945b7aff36fc979166c714bd4b07676eea77634a432 prep_share_1: >- b5eae11b600bcb77827a46303c1e0f073ebc46fcdc9c3fe9aeeb4a5f09e9c163 prep_message: >- out_share_0: - 3ead59ec98fe1c4f out_share_1: - c452a6136601e3b0 agg_share_0: >- 3ead59ec98fe1c4f agg_share_1: >- c452a6136601e3b0 agg_result: 1 ]]>

Prio3Sum - d6ba304b5e6fb668b98629cbaa51b5e780000a045a98af5f34a4d71abb6b7885 input_share_0: >- c61ac8678ff4456241ff7d9f2182d8b4d007ae72f80d4e7fba171b7f17cfa14aedfd 10de4bb9180493872144743b8ac975d273e07b0a347f5f9af84a1573bcaa610f093d 013ead7503e6ac003975ae0d840333d65e7f62c70d271360bd404b17d4116ba46a3e 71edbddd6abc15c8aaedb1b8931350544a138497d10eaf77733800be917b08d87ed5 38e3812cd447335f46fb984e2779b3324bc602c31fe4745c34c7c5251f13dc402760 ce65c9a16fce5f171b98a1f3c33d8e44ea7ad1f02ab5fe7acc05187f160ef5692369 a105f9a6339249936563891682f8ffa5690a479f9876c49a753e3e982c7186f74a19 16ad2ad2b2f926fc47e6c9d1bdd5584e46d3b5d72f8f5a81b2a3fe181670bc75aafa c4c56c189c913b3b32cb6d21b246738301568c7d5c323a7b0aaa28747364b1d1b42f f9a01a13b40c1af75d7e965ec20e18ca729419dcb88b0428b329447ff0ab30337525 a58e2a28ea47579fa7b44d490c3d050ad253e8633fe972c689259a7807d7d149b231 69a26879be85183a23c00b58060fb09672a8d1197e30065d403d8578110ce5d9608f cc2479f61a94e83d66e1493f77963700f4660aa8d16a51b47920c1e7b9b39ede9dc1 c4acad858bc1c66d2b813e2955a4a57106c7905cffd73cea619a58d339bd3e582280 9d154d0f9343f49d14c755cecbb770f38b18cdc6928bba24f5f5409527de57bb249e fb5f673c18bd0481d87876e80b59a8805ff95d4d826162c511b54c91d62824c5af0d c0ec1bf8debfec0e5ba26682ba7179ec7e68806170fb04821f6625063d6b1a12a6a8 423a6ee4b4561759978de0adce61db70a131840d3d52c1dd6c0e709c9c91236c15da 49b468ffbc4ebf0505756aced52055d811753e463e2f0fdceb0bcbfa303132333435 363738393a3b3c3d3e3f input_share_1: >- 000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f2021 22232425262728292a2b2c2d2e2f round_0: prep_share_0: >- 5879339d691b9230058dd5b6fdcf804306454c963883a700ed8251ead70e6a6ddf 5c02433a304d03f0280080a6eab201d6ba304b5e6fb668b98629cbaa51b5e7 prep_share_1: >- a986cc6296e46dcfde722a4902307fbcba25e7e7175787207014a8a1972756b0af e901f95ba76723b68531c445e83d7680000a045a98af5f34a4d71abb6b7885 prep_message: >- f6011479e21b4ef3146e0b849423e360 out_share_0: - 6de9984430d882b37f9eb596feeee52e out_share_1: - f81667bbcf277d4c64614a6901111ad1 agg_share_0: >- 6de9984430d882b37f9eb596feeee52e agg_share_1: >- f81667bbcf277d4c64614a6901111ad1 agg_result: 100 ]]>

Prio3Histogram - 1a84cd1f7c84b403ef8471cc15158c84b21b5733b6f53176ed5b8d8174a288e9 input_share_0: >- fb788fb4dd1ada7c27fa1c6bd2f3ba3de3ea9c976900e67a80152e8d81603d516d08 98cddce70a38bc5e6228b1bc4b67b0c779b2b93e73b4da90cab872f0f51ccf5b5bbc e30773cb5b0227b1c52cb2de52087f365317fa8bb1e6c15c809096b02104cc2a4680 88ec6c8ad9dd1289a98e750ee469d1c78fbc1796d9b7d225f7b9410596d0bf27a093 14d240d91f8bd194d24fff76524c5044d0939b53ceb724b49d417fe853d707617baa 0c75e2d107bfa90725d50bbd691ed65e0e93f946091dff046e2cdf2fef9a4586a3f0 d4b69177b290d3e7cbea8f5d70dfc5376537f1952339366a834e97363f8e5a9fb0ab 08ea5902d19e64aa4bef980fb007928cc319fbd2e7254df43c5b803bf0b9656b9484 aa1f4354166af16282ba51722a5768ce718c895f7a0ed3b4cad2c23fe954d62d564f 23f30388da09f1641be3efccff94303132333435363738393a3b3c3d3e3f input_share_1: >- 000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f2021 22232425262728292a2b2c2d2e2f round_0: prep_share_0: >- 960cec2ab69f328cc5e790b8a65852d2bac43ed54fb150d487415d2795383f406f d58ffe957f8ee525b8f2407d3ce5d71a84cd1f7c84b403ef8471cc15158c84 prep_share_1: >- 6bf313d54960cd731e186f4759a7ad2d71916f8a508640739726528e260a458f22 a5cf556e866033059eb5e147c974a8b21b5733b6f53176ed5b8d8174a288e9 prep_message: >- 6af47a4b7d91c14993d2a4d40c8d62d7 out_share_0: - fb788fb4dd1ada7c27fa1c6bd2f3ba3d - e3ea9c976900e67a80152e8d81603d51 - 6d0898cddce70a38bc5e6228b1bc4b67 - b0c779b2b93e73b4da90cab872f0f51c out_share_1: - 0687704b22e52583bc05e3942d0c45c2 - 1e15636896ff198563ead1727e9fc2ae - 95f767322318f5c727a19dd74e43b498 - 5138864d46c18c4b096f35478d0f0ae3 agg_share_0: >- fb788fb4dd1ada7c27fa1c6bd2f3ba3de3ea9c976900e67a80152e8d81603d516d0898 cddce70a38bc5e6228b1bc4b67b0c779b2b93e73b4da90cab872f0f51c agg_share_1: >- 0687704b22e52583bc05e3942d0c45c21e15636896ff198563ead1727e9fc2ae95f767 322318f5c727a19dd74e43b4985138864d46c18c4b096f35478d0f0ae3 agg_result: [0, 0, 1, 0] ]]>

Poplar1

Sharding - cd54d2e61e2c14720170a3d0748e06e0e4c840af1d8e0138ed00fb1de353014616a6 6a90d9354b159ab14f61f09acb60f5d3c1e2377edf5240b0fb106993aeff889dc28d c4f4a46b28bf94d09eae4d50600400ef9f73f2cad7894ab244d99bf5f3c05ab13163 8160e01a201b4ac7e1b18f537d53eccea86864da5d27da48d2bca05bd663abd34490 7e7337ea6211566c41178170957627d356f228061c4c72eca34a3dcacf9cc85721db a1810817f24f1c input_share_0: >- 000102030405060708090a0b0c0d0e0f202122232425262728292a2b2c2d2e2f4b0b a3a61241315702f3cde47fd8b5f4e0db66ed4ff3002ac48fd1fa1b2728e2a014b567 123ae545640b8719bd593ba44157b33f386d83b8f39e10db848e890073eaf40fc1b6 eb4b01d14199c7e0e21a84f33805453858c2c9860fd9a328331729b22e6fc4fa38f2 771ae81091410b3e input_share_1: >- 101112131415161718191a1b1c1d1e1f303132333435363738393a3b3c3d3e3f64d7 572ab3849f73e2ff3ea5657411e5217df4b7b12d19328d71c8dd4e70badc909776eb a6558717ac481ebacce4656d7aaeb7c37c251d5683c7eb83b5a3524801518da879a9 d5e5a22e68d8a3decf69fa10e0ca6aad9f3f539afe6fbd19c924386334e2d237f5d2 390805243ee3cc3e ]]>

Preparation, Aggregation, and Unsharding - 4195a4c56e1260647413dc5fa0f1822844fb8750eea70573 prep_share_1: >- 7e530646b6adb0632367eb0b0eb39d1a79ec88f7bbc98f50 prep_message: >- bfe8aa0b25c010c8977ac76baea42043bde71048aa7195c3 round_1: prep_share_0: >- 24a5193d7d5bf285 prep_share_1: >- dd5ae6c281a40d7a prep_message: >- out_share_0: - e457b2981c956b15 - 79813da9034552cd out_share_1: - 1da84d67e26a94ea - 897ec256fbbaad32 agg_share_0: >- e457b2981c956b1579813da9034552cd agg_share_1: >- 1da84d67e26a94ea897ec256fbbaad32 agg_result: [0, 1] ]]> - dda737bbd51e94c5a8ecd1b3276a402446ddcc2d21bbf6b7 prep_share_1: >- 74baf93771f3714c3b40466cb9cf19f180f48934c1f1db3d prep_message: >- 506231f347120612e22c1820e2395a15c6d15662e2acd2f5 round_1: prep_share_0: >- a30e360c7d7e51fc prep_share_1: >- 5ef1c9f38181ae03 prep_message: >- out_share_0: - 078e84648c4ae70c - ac7a8371234c4540 - 69b3af8cdff3b459 - 91579ac64d319d58 out_share_1: - fa717b9b72b518f3 - 55857c8edbb3babf - 984c50731f0c4ba6 - 71a86539b1ce62a7 agg_share_0: >- 078e84648c4ae70cac7a8371234c454069b3af8cdff3b45991579ac64d319d58 agg_share_1: >- fa717b9b72b518f355857c8edbb3babf984c50731f0c4ba671a86539b1ce62a7 agg_result: [0, 0, 0, 1] ]]> - 675359765228af1fe557ab25196a1ad1399ad4c7c4affc66 prep_share_1: >- c87431627147a136eac6fba1d3f4e6bcb57a9b2449f8fe21 prep_message: >- 2fc88ad8c36f5056ce1ea7c7ed5e018eee1470ec0da8fb88 round_1: prep_share_0: >- 621b1271c1ec7b4a prep_share_1: >- 9fe4ed8e3d1384b5 prep_message: >- out_share_0: - a05be48631d9376b - 66cac23e03c7ca6d - 882152745673ba29 - 1d096863ef00faf5 out_share_1: - 61a41b79cd26c894 - 9b353dc1fb383592 - 79dead8ba88c45d6 - e5f6979c0fff050a agg_share_0: >- a05be48631d9376b66cac23e03c7ca6d882152745673ba291d096863ef00faf5 agg_share_1: >- 61a41b79cd26c8949b353dc1fb38359279dead8ba88c45d6e5f6979c0fff050a agg_result: [0, 0, 0, 1] ]]> - 5d26d73b85e6c726830478fe973d8b4687dffaf324399a3e62962ab71a41841a12 93b70acb36828229dd8ee4fb0d437c2270472054dcef8fba9eb43fb3bb18387cf1 38d5e13f9a4207d7026e112fe3e51e9d88688e4cb3105308ec5a2cdd4364 prep_share_1: >- 9a8537c1e41bd3d693b03ec522278178bda4454014ba800f4bea45d9c500b51330 0a144b10fc37e3e5cfdda0f698519ae6301c8d0b41f623c19b125d6fe35c76143e 6ec8752a598cec3b5316a1782eac1584b8be9e15f93ad4ecd70c4061d77d prep_message: >- f7ab0efd69029bfd16b5b6c3ba640cbf4484403439f31a4ead807090e041392e55 9dcb55db32ba650fad6c85f2a6941609a163ad5f1de6b37b3ac79c229f752ea32f a79d576af3cef3125684b2a71192342141272d62ac4b27f5c3676c3e1b62 round_1: prep_share_0: >- 537a1a1fcdbbb4042dac5afb5c995abef6ffcbf2cb8375a357fd6b4697c84a47 prep_share_1: >- 9a85e5e032444bfbd253a504a366a5410900340d347c8a5ca80294b96837b538 prep_message: >- out_share_0: - 0f33eec522414e75f7094646ee1ca7c22baba5bac4a02ce4ab1e812e21a34211 - 013454e2f0b4046dac7287eac25ae1c398c30e2f1797507b546eaa36bc67a454 - e56e12917baff2b8eb367a2d9fca0fad3dfd86e24f320589202f23ce34816834 - af5d42b895abad21f05f3e73924b4d45533d5f9c63542c71a3343e1bd97fa61b - 5a3348a91fc4111a88528cba84c009228b6a5817b6b541c077edfd801489ec38 - 0a511695baad2eb33150a7e13950e35a19abd5bf1bef81533f0229c9c45f0164 - 7dc5f3900c63255f1418d3af04abb642fc4f92b3cc25325bcc15e11caabf8038 out_share_1: - decc113addbeb18a08f6b9b911e3583dd4545a453b5fd31b54e17ed1de5cbd6e - eccbab1d0f4bfb92538d78153da51e3c673cf1d0e868af84ab9155c943985b2b - 0891ed6e84500d4714c985d26035f052c202791db0cdfa76dfd0dc31cb7e974b - 3ea2bd476a5452de0fa0c18c6db4b2baacc2a0639cabd38e5ccbc1e426805964 - 93ccb756e03beee577ad73457b3ff6dd7495a7e8494abe3f8812027feb761347 - e4aee96a4552d14cceaf581ec6af1ca5e6542a40e4107eacc0fdd6363ba0fe1b - 703a0c6ff39cdaa0ebe72c50fb5449bd03b06d4c33dacda433ea1ee355407f47 agg_share_0: >- 0f33eec522414e75f7094646ee1ca7c22baba5bac4a02ce4ab1e812e21a34211013454 e2f0b4046dac7287eac25ae1c398c30e2f1797507b546eaa36bc67a454e56e12917baf f2b8eb367a2d9fca0fad3dfd86e24f320589202f23ce34816834af5d42b895abad21f0 5f3e73924b4d45533d5f9c63542c71a3343e1bd97fa61b5a3348a91fc4111a88528cba 84c009228b6a5817b6b541c077edfd801489ec380a511695baad2eb33150a7e13950e3 5a19abd5bf1bef81533f0229c9c45f01647dc5f3900c63255f1418d3af04abb642fc4f 92b3cc25325bcc15e11caabf8038 agg_share_1: >- decc113addbeb18a08f6b9b911e3583dd4545a453b5fd31b54e17ed1de5cbd6eeccbab 1d0f4bfb92538d78153da51e3c673cf1d0e868af84ab9155c943985b2b0891ed6e8450 0d4714c985d26035f052c202791db0cdfa76dfd0dc31cb7e974b3ea2bd476a5452de0f a0c18c6db4b2baacc2a0639cabd38e5ccbc1e42680596493ccb756e03beee577ad7345 7b3ff6dd7495a7e8494abe3f8812027feb761347e4aee96a4552d14cceaf581ec6af1c a5e6542a40e4107eacc0fdd6363ba0fe1b703a0c6ff39cdaa0ebe72c50fb5449bd03b0 6d4c33dacda433ea1ee355407f47 agg_result: [0, 0, 0, 0, 0, 1, 0] ]]>