Jonathan Bootle
Artificial Intelligence · 2016–2018
A researcher in the Science corpus: 3 papers; trusts 12 researchers and is trusted by 1 researcher here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 63 citations into it; #32,273 of 35,345 by trust here, #15,866 by citations
- Computational Theory and Mathematics — 29 citations into it
- Information Systems — 23 citations into it; #7,737 of 8,771 by trust here, #2,821 by citations
- Privacy & Security — 19 citations into it; #636 of 709 by trust here, #552 by citations
Whom Jonathan Bootle trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Jens Groth
- Mihir Bellare
- Bodo Möller
- Yehuda Lindell
- Eli Ben-Sasson
- Stephanie Bayer
- Ran Canetti
- Oded Goldreich
- Bryan Parno
- Shafi Goldwasser
Who trusts Jonathan Bootle overall
- Benedikt Bünz
- Eli Ben-Sasson
- Srinath T. V. Setty
- Tiancheng Xie
- Mary Maller
- Riad S. Wahby
- Dan Boneh
- César Sabater
- Jiaheng Zhang
- Sean Bowe
Papers from Jonathan Bootle's perspective
Ordered by how strongly the researchers Jonathan Bootle trusts endorse each paper. Same corpus, a different order for every researcher.
- Random oracles are practical: a paradigm for designing efficient protocols
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
- Blind Signatures for Untraceable Payments
- A note on efficient zero-knowledge proofs and arguments (extended abstract)
- Efficient signature generation by smart cards
- How to Prove Yourself: Practical Solutions to Identification and Signature Problems
- On interactive proofs with a laconic prover
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture
- Short Signatures from the Weil Pairing
Their papers
- Bulletproofs: Short Proofs for Confidential Transactions and More (2018) — 1,327 citations
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting (2016) — 413 citations
- Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability (2017) — 82 citations