Efficient Zero-Knowledge Argument for Correctness of a Shuffle

By Stephanie Bayer, Jens Groth. 2012

249 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

Citations in the corpus

Bulletproofs: Short Proofs for Confidential Transactions and More (2018, background): “Currently the most efficient shuffle [23] has size Op?nq.”
Prio: Private, Robust, and Scalable Computation of Aggregate Statistics (2017, background): “These anonymity systems provide strong privacy properties, but require expensive “verifiable mixing” techniques [8, 95], or require work at the servers that is quadratic in the number of client messages sent through the system [38, 121].”
Riposte: An Anonymous Messaging System Handling Millions of Users (2015, methodology): “For example, the verifiable shuffle protocol of Bayer and Groth [5] is one of the most efficient in the literature.”
Spartan: Efficient and general-purpose zkSNARKs without trusted setup (2020, background): “[30] building on its predecessors [11, 55] provide a zero-knowledge argument for the satisfiability of arithmetic circuits under the hardness of computing discrete logarithms.”
Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation (2019, methodology): “[35], Groth [34] and Lipmaa [39], Gennaro et al. [29] introduced quadratic arithmetic programs (QAPs), which forms the basis of most recent implementations [11,15,19,25,28,43,49] including libSNARK [14].”
Distributed Measurement with Private Set-Union Cardinality (2017, background): “Several protocols for verifiable shuffling have been proposed [2, 23, 27, 40].”
Doubly-Efficient zkSNARKs Without Trusted Setup (2018, methodology): “Bootle et al. [24] give two ZK arguments for AC satisfiability from the hardness of discrete logarithms, building on the work of Groth [52] and of Bayer and Groth [6].”
Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting (2016, methodology): “The basic step in our inner product argument is a 2-move reduction to a smaller statement using techniques similar to [1].”
Stadium: A Distributed Metadata-Private Messaging System (2017, methodology): “In particular, our C++ code implements Bayer and Groth’s verifiable shuffling protocol [3] extended for non-interactive proofs via the Fiat-Shamir Heuristic and instantiated over Bernstein’s Curve25519 elliptic curve group [5].”
Instantaneous Decentralized Poker (2017, methodology): “This protocol uses a proof of knowledge scheme that is slightly faster than [6,7,12], and provides a security proof using the simulation paradigm.”