Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
By Jens Groth, Yuval Ishai. 2008
110 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
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
- Srinath T. V. Setty
- Michael Walfish
- Justin Thaler
- Abhi Shelat
- Riad S. Wahby
- Ioanna Tzialla
- Stephanie Bayer
- Jonathan Bootle
In Computational Theory and Mathematics
- Michael Walfish
- Riad S. Wahby
- Abhi Shelat
- Justin Thaler
- Ioanna Tzialla
- Srinath T. V. Setty
- Stephanie Bayer
- Jonathan Bootle
Citations in the corpus
- Efficient Zero-Knowledge Argument for Correctness of a Shuffle (2012, methodology): “In comparison, Groth and Ishai’s argument [GI08] communicates Ω(m2 + n) group elements and all other state of the art shuffle arguments communicate Θ(N) elements.”
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting (2016, background): “To define an argument of knowledge we follow Groth and Ishai [23] that borrowed the term witness-extended emulation from Lindell [29].”
- Doubly-Efficient zkSNARKs Without Trusted Setup (2018, background): “To define this notion formally, we follow Groth and Ishai [54] who borrow the notion of statistical witness-extended emulation from Lindell [68]:”
- Spartan: Efficient and general-purpose zkSNARKs without trusted setup (2020, unknown): “Definition 2.6 (Witness-extended emulation [65]) .”