Yuval Ishai
Artificial Intelligence · 2000–2019
A researcher in the Science corpus: 24 papers; trusts 88 researchers and is trusted by 167 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 256 citations into it; #2,145 of 36,961 by trust here, #2,226 by citations
- Computational Theory and Mathematics — 139 citations into it; #166 of 12,489 by trust here, #162 by citations
- Computer Networks and Communications — 112 citations into it; #2,782 of 9,996 by trust here, #2,940 by citations
- Privacy & Security — 104 citations into it; #115 of 710 by trust here, #143 by citations
- Information Systems — 75 citations into it; #4,187 of 9,233 by trust here, #5,874 by citations
- Computer Vision and Pattern Recognition — 43 citations into it
- Atomic and Molecular Physics, and Optics — 33 citations into it
- Algorithms & Complexity — 18 citations into it
Whom Yuval Ishai trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Eyal Kushilevitz
- Rafail M. Ostrovsky
- Benny Chor
- Ran Canetti
- Pascal Paillier
- Silvio Micali
- Oded Goldreich
- Moni Naor
- Helger Lipmaa
- Amos Beimel
Who trusts Yuval Ishai overall
- Benny Pinkas
- Yehuda Lindell
- Srinath T. V. Setty
- Amos Beimel
- Helger Lipmaa
- Vladimir Kolesnikov
- Eli Ben-Sasson
- David E. Evans
- Thomas Schneider
- Elette Boyle
Papers from Yuval Ishai's perspective
Ordered by how strongly the researchers Yuval Ishai trusts endorse each paper. Same corpus, a different order for every researcher.
- Replication is not needed: single database, computationally-private information retrieval
- Probabilistic Encryption
- New Directions in Cryptography
- Security and Composition of Multiparty Cryptographic Protocols (Journal of Cryptology)
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- How to share a secret
- Computationally Private Information Retrieval with Polylogarithmic Communication
- Random oracles are practical: a paradigm for designing efficient protocols
- Protocols for secure computations
- Fair exchange with a semi-trusted third party (extended abstract)
Their papers
- Ligero: Lightweight Sublinear Arguments Without a Trusted Setup (2017) — 345 citations
- Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs (2019) — 162 citations
- Extending Oblivious Transfers Efficiently (2003) — 853 citations
- Priced Oblivious Transfer: How to Sell Digital Goods (2001) — 432 citations
- Secure multiparty computation of approximations (2001) — 208 citations
- Evaluating Branching Programs on Encrypted Data (2007) — 240 citations
- Founding Cryptography on Oblivious Transfer - Efficiently (2008) — 564 citations
- Efficient Arguments without Short PCPs (2007) — 137 citations
- Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation (2005) — 312 citations
- Reducing the Servers’ Computation in Private Information Retrieval: PIR with Preprocessing (2004) — 231 citations
- Distributed Point Functions and Their Applications (2014) — 270 citations
- Breaking the O(n/sup 1/(2k-1)/) barrier for information-theoretic Private Information Retrieval (2002) — 237 citations
- Function Secret Sharing: Improvements and Extensions (2016) — 417 citations
- Zero-knowledge from secure multiparty computation (2007) — 478 citations
- Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing (2000) — 52 citations
- Information-Theoretic Private Information Retrieval: A Unified Construction (2001) — 143 citations
- Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle (2008) — 110 citations
- Batch codes and their applications (2004) — 286 citations
- Efficient Pseudorandom Correlation Generators: Silent OT Extension and More (2019) — 269 citations
- Can We Access a Database Both Locally and Privately? (2017) — 93 citations