Iddo Bentov
Artificial Intelligence · 2014–2020
A researcher in the Science corpus: 13 papers; trusts 62 researchers and is trusted by 43 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 170 citations into it; #4,949 of 35,345 by trust here, #5,834 by citations
- Computational Theory and Mathematics — 81 citations into it; #5,978 of 12,182 by trust here, #3,562 by citations
- Information Systems — 80 citations into it; #574 of 8,771 by trust here, #607 by citations
- Privacy & Security — 49 citations into it
- Computer Networks and Communications — 43 citations into it
- Algorithms & Complexity — 17 citations into it
- Program Analysis & Verification — 12 citations into it
- Automated Theorem Proving & Formal Methods — 9 citations into it
Whom Iddo Bentov trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Eli Ben-Sasson
- Ran Canetti
- Ranjit Kumaresan
- Alessandro Chiesa
- Jens Groth
- Silvio Micali
- Srinath T. V. Setty
- Anthony Dewayne Hunt
- Marcin Andrychowicz
- Joe Kilian
Who trusts Iddo Bentov overall
- Ranjit Kumaresan
- Florian Tschorsch
- Eli Ben-Sasson
- Yang Xiao
- Andrew K. Miller
- Björn Scheuermann
- Arka Rai Choudhuri
- Benedikt Bünz
- Giang-Truong Nguyen
- Fan Zhang
Papers from Iddo Bentov's perspective
Ordered by how strongly the researchers Iddo Bentov trusts endorse each paper. Same corpus, a different order for every researcher.
- How to Prove Yourself: Practical Solutions to Identification and Signature Problems
- Pinocchio: Nearly Practical Verifiable Computation
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
- The Knowledge Complexity of Interactive Proof Systems
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Blind Signatures for Untraceable Payments
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- Checking computations in polylogarithmic time
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture
Their papers
- Scalable Zero Knowledge with No Trusted Setup (2019) — 252 citations
- Instantaneous Decentralized Poker (2017) — 65 citations
- Computational Integrity with a Public Random String from Quasi-Linear PCPs (2017) — 74 citations
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity (2017) — 303 citations
- Flash Boys 2.0: Frontrunning, Transaction Reordering, and Consensus Instability in Decentralized Exchanges (2019) — 296 citations
- Flash Boys 2.0: Frontrunning in Decentralized Exchanges, Miner Extractable Value, and Consensus Instability (2020) — 664 citations
- Scalable, transparent, and post-quantum secure computational integrity (2018) — 708 citations
- Tesseract: Real-Time Cryptocurrency Exchange using Trusted Hardware (2017) — 207 citations
- Amortizing Secure Computation with Penalties (2016) — 87 citations
- How to Use Bitcoin to Play Decentralized Poker (2015) — 131 citations
- Proof of Activity: Extending Bitcoin's Proof of Work via Proof of Stake [Extended Abstract]y (2014) — 698 citations
- How to Use Bitcoin to Design Fair Protocols (2014) — 391 citations
- Cryptocurrencies Without Proof of Work (2014) — 399 citations