ALLOSAUR is a pairing-based accumulator with good anonymity properties. This is an implementation of the single-server functionality of ALLOSAUR and a multi-server threshold update process.
-
a single server object to maintain an accumulator and accumulated
-
users to obtain membership witnesses and produce zero-knowledge proofs of membership
-
users and servers to interact to efficiently update a user's witness
Critical features of the ALLOSAUR protocol that are missing from this implementation:
-
multi-party computation of core accumulator functionality
-
interfaces for users and servers to send data to each other
-
constant-time implementations of the underlying cryptography functions
-
accumulator: Code from accumulator-rs which formed the basis of our implementation
-
allosaur: Implementation of the basic functionality of ALLOSAUR
-
benches: Runs all benchmarks
The main functions we implement are:
-
A struct
serverwhich keeps the secret and auxiliary data of an accumulator over many updates. It also implements the main functions:wit,update,add,deletethat the protocol specifies. -
A struct
userthat, similarly, keeps an ID and a witness and implements the functions necessary to produce membership proofs and engage in the update protocol -
A struct
witnessthat contains the secret data for a membership witness, and has static functions to produce and check membership proofs as byte strings
To run the benchmarks, from this directory call
cargo bench
and the results will be output to the terminal.
The benchmarks cover three different methods to anonymously update a user's witness: the original implementation from accumulator-rs with the full batch update polynomials, the split batch updates from the single-server approach of our paper, and ALLOSAUR's multi-party updates.
The parameters to these benchmarks are in benches/updates.rs.
ALLOSAUR is a joint work of Sam Jaques, Mike Lodder, and Hart Montgomery.