Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation
By Tiancheng Xie, Jiaheng Zhang, Yupeng Zhang, Charalampos Papamanthou, Dawn Song. 2019
292 citations recorded by the source corpus.
Subfields: Artificial Intelligence, 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 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): “[418] presented Libra, a ZKP system that achieves linear prover complexity but with”
- Transparent SNARKs from DARK Compilers (2020, background): “Another thread of research has produced proof systems that remove trust from the circuit preprocessing step, and instead have a universal (trusted) setup: a one-time trusted setup that can be reused for any computation [43,55,30].”
- Spartan: Efficient and general-purpose zkSNARKs without trusted setup (2020, methodology): “[91], Spartan offers an alternative to Libra [93], a zkSNARK that does not require a per-circuit trusted setup (instead, the trusted setup is for the polynomial commitment scheme); we refer to this variant as Spartankoe.”