Ligero: Lightweight Sublinear Arguments Without a Trusted Setup
By Scott Ames, Carmit Hazay, Yuval Ishai, Muthuramakrishnan Venkitasubramaniam. 2017
345 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics, Privacy & Security
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
- Martin Jaggi
- Qiang Yang
- Jakub Konecný
- Peter Kairouz
- Peter Richtárik
- Ananda Theertha Suresh
- Jianyu Wang
- Sebastian U. Stich
In Computational Theory and Mathematics
- Sebastian U. Stich
- Adrià Gascón
- Jakub Konecný
- H. Brendan McMahan
- Martin Jaggi
- Daniel Ramage
- Ananda Theertha Suresh
- Badih Ghazi
In Privacy & Security
- Peter Kairouz
- Badih Ghazi
- Rasmus Pagh
- Qiang Yang
- Ziteng Sun
- Adrià Gascón
- H. Brendan McMahan
- Aurélien Bellet
Citations in the corpus
- Advances and Open Problems in Federated Learning (2019, background): “If we relax the requirements for succinctness or non-interactiveness for the construction, there is a large body of constructions that achieve a wide range of efficiency trade-offs, avoid the trusted setup requirement and use more standard cryptographic assumptions [84, 397, 23, 58].”
- Poseidon: A New Hash Function for Zero-Knowledge Proof Systems (2021, background): “In the middle of 2020, the most popular proof systems are ZKSNARKs (Pinocchio [49], Groth16 [35], PLONK [27], Marlin [23] to name a few), Bulletproofs [19], ZK-STARKs [9], and MPC-in-the-head systems [7, 22, 29].”