A Verifiable Secret Shuffle of Homomorphic Encryptions

203 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.

Bulletproofs: Short Proofs for Confidential Transactions and More (2018, background): “Neff [19] gave a practical implementation of a verifiable shuffle and later work improved on it [21], [22].”
Riposte: An Anonymous Messaging System Handling Millions of Users (2015, background): “), though most e-voting sy stems cannot provide the forward security property that Riposte offers (Section III-C) [1], [19], [33], [46], [47], [66], [70].”
Distributed Measurement with Private Set-Union Cardinality (2017, background): “Several protocols for verifiable shuffling have been proposed [2, 23, 27, 40].”
Efficient Zero-Knowledge Argument for Correctness of a Shuffle (2012, methodology): “Stamer [Sta05] reported on an implementation of Groth’s shuffle [Gro10].”
Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle (2008, methodology): “Our starting point is the honest verifier zero-knowledge shuffle argument by Groth [21], which builds on ideas by Neff [30].”
Proofs of Storage from Homomorphic Identification Protocols (2009, methodology): “(4)A similar approach, based on pseudorandom generators, was proposed in [9] in the context of verifiable shuffles.”