Yuval Ishai

Yuval Ishai's AcademicInfluence.com Rankings

Yuval Ishai

Computer Science

#8643

World Rank

#9087

Historical Rank

Database

#5640

World Rank

#5853

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Yuval Ishai's Degrees

PhD Computer Science Weizmann Institute of Science
Masters Computer Science Weizmann Institute of Science

Similar Degrees You Can Earn

Why Is Yuval Ishai Influential?

(Suggest an Edit or Addition)

(See a Problem?)

Yuval Ishai's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Private Circuits: Securing Hardware against Probing Attacks (2003) (874)
Extending Oblivious Transfers Efficiently (2003) (651)
Founding Cryptography on Oblivious Transfer - Efficiently (2008) (552)
Protecting data privacy in private information retrieval schemes (1998) (548)
Priced Oblivious Transfer: How to Sell Digital Goods (2001) (413)
Keyword Search and Oblivious Pseudorandom Functions (2005) (386)
Zero-knowledge from secure multiparty computation (2007) (287)
Randomizing polynomials: A new representation with applications to round-efficient secure computation (2000) (271)
Cryptography in NC0 (2004) (260)
Ligero: Lightweight Sublinear Arguments Without a Trusted Setup (2017) (238)
Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation (2005) (231)
Batch codes and their applications (2004) (219)
Evaluating Branching Programs on Encrypted Data (2007) (206)
Function Secret Sharing (2015) (204)
Succinct Non-Interactive Arguments via Linear Interactive Proofs (2013) (201)
Breaking the O(n/sup 1/(2k-1)/) barrier for information-theoretic Private Information Retrieval (2002) (200)
Secure multiparty computation of approximations (2001) (199)
Founding Cryptography on Tamper-Proof Hardware Tokens (2010) (184)
From Secrecy to Soundness: Efficient Verification via Secure Computation (2010) (181)
Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials (2002) (173)
Private Circuits II: Keeping Secrets in Tamperable Circuits (2006) (173)
Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator (2005) (171)
Function Secret Sharing: Improvements and Extensions (2016) (167)
Non-interactive and non-malleable commitment (1998) (161)
Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography (2010) (157)
Cryptography with constant computational overhead (2008) (151)
COMPUTATIONALLY PRIVATE RANDOMIZING POLYNOMIALS AND THEIR APPLICATIONS (2005) (146)
The round complexity of verifiable secret sharing and secure multicast (2001) (142)
Secure Arithmetic Computation with No Honest Majority (2008) (142)
Distributed Point Functions and Their Applications (2014) (129)
Cryptography from Anonymity (2006) (127)
Scalable Secure Multiparty Computation (2006) (124)
Efficient Arguments without Short PCPs (2007) (124)
Reducing the Servers’ Computation in Private Information Retrieval: PIR with Preprocessing (2004) (121)
Scalable Multiparty Computation with Nearly Optimal Work and Resilience (2008) (118)
Private simultaneous messages protocols with applications (1997) (117)
Bounded Key-Dependent Message Security (2010) (117)
Breaking the Circuit Size Barrier for Secure Computation Under DDH (2016) (112)
Efficient Non-interactive Secure Computation (2011) (112)
Selective private function evaluation with applications to private statistics (2001) (110)
Optimizing Obfuscation: Avoiding Barrington's Theorem (2014) (107)
Information-Theoretic Private Information Retrieval: A Unified Construction (2001) (105)
Efficient Pseudorandom Correlation Generators: Silent OT Extension and More (2019) (100)
Efficient Multi-party Computation over Rings (2003) (99)
Zero-Knowledge Proofs from Secure Multiparty Computation (2009) (97)
Semantic Security under Related-Key Attacks and Applications (2011) (94)
OT-Combiners via Secure Computation (2008) (94)
On the Power of Correlated Randomness in Secure Computation (2013) (93)
Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle (2008) (92)
Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation (2019) (92)
How to Garble Arithmetic Circuits (2011) (91)
General constructions for information-theoretic private information retrieval (2005) (90)
Cryptography with Constant Input Locality (2007) (86)
Circuits resilient to additive attacks with applications to secure computation (2014) (83)
Secure Multi-Party Computation with Identifiable Abort (2014) (80)
Compressing Vector OLE (2018) (76)
Private Large-Scale Databases with Distributed Searchable Symmetric Encryption (2016) (68)
Universal service-providers for database private information retrieval (extended abstract) (1998) (67)
Public-Coin Differing-Inputs Obfuscation and Its Applications (2015) (67)
Black-box constructions for secure computation (2006) (66)
Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing (2000) (66)
Using Fully Homomorphic Hybrid Encryption to Minimize Non-interative Zero-Knowledge Proofs (2015) (66)
Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs (2019) (64)
Homomorphic Secret Sharing: Optimizations and Applications (2017) (64)
One-way functions are essential for single-server private information retrieval (1999) (63)
Non-Interactive Secure Multiparty Computation (2014) (63)
Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation (2017) (61)
On the Cryptographic Complexity of the Worst Functions (2014) (61)
Sufficient Conditions for Collision-Resistant Hashing (2005) (61)
Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography (2010) (60)
On the randomness complexity of efficient sampling (2006) (60)
On Pseudorandom Generators with Linear Stretch in NC0 (2006) (60)
Partial Garbling Schemes and Their Applications (2014) (59)
Trapdoor Hash Functions and Their Applications (2019) (59)
On 2-Round Secure Multiparty Computation (2002) (59)
Low-Complexity Cryptographic Hash Functions (2017) (58)
Improved upper bounds on information-theoretic private information retrieval (extended abstract) (1999) (57)
On the power of nonlinear secret-sharing (2001) (55)
Foundations of Homomorphic Secret Sharing (2018) (54)
Two-Message Witness Indistinguishability and Secure Computation in the Plain Model from New Assumptions (2017) (53)
Secure Arithmetic Computation with Constant Computational Overhead (2017) (52)
Improved upper bounds on information-theoretic private information retrieval (1999) (52)
Share Conversion and Private Information Retrieval (2012) (51)
Lattice-Based SNARGs and Their Application to More Efficient Obfuscation (2017) (50)
Secure Multiparty Computation with Minimal Interaction (2010) (49)
Extracting Correlations (2009) (48)
On the Local Leakage Resilience of Linear Secret Sharing Schemes (2018) (48)
Identifying Cheaters without an Honest Majority (2012) (46)
On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation (2006) (44)
Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys (2013) (44)
Secure Computation with Preprocessing via Function Secret Sharing (2019) (44)
Lightweight Techniques for Private Heavy Hitters (2020) (42)
Efficient Pseudorandom Correlation Generators from Ring-LPN (2020) (42)
Secure Computation with Minimal Interaction, Revisited (2015) (40)
Black-Box Constructions of Protocols for Secure Computation (2011) (40)
Barrier for Information-Theoretic Private Information Retrieval (2002) (39)
Can We Access a Database Both Locally and Privately? (2017) (39)
Constant-Rate Oblivious Transfer from Noisy Channels (2011) (37)
On the Hardness of Information-Theoretic Multiparty Computation (2004) (37)
On Adaptive vs. Non-adaptive Security of Multiparty Protocols (2001) (36)
Efficient Multiparty Protocols via Log-Depth Threshold Formulae (2013) (35)
Bounded Indistinguishability and the Complexity of Recovering Secrets (2016) (35)
Secure Multiparty Computation with General Interaction Patterns (2016) (34)
Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications (2014) (34)
Practical Fully Secure Three-Party Computation via Sublinear Distributed Zero-Knowledge Proofs (2019) (33)
Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits (2015) (33)
On Locally Decodable Codes, Self-correctable Codes, and t -Private PIR (2007) (32)
Function Secret Sharing for Mixed-Mode and Fixed-Point Secure Computation (2020) (32)
On Complete Primitives for Fairness (2010) (32)
Adaptive versus Non-Adaptive Security of Multi-Party Protocols (2004) (32)
Quasi-Optimal SNARGs via Linear Multi-Prover Interactive Proofs (2018) (31)
Reusable Non-Interactive Secure Computation (2019) (31)
Line-Point Zero Knowledge and Its Applications (2020) (30)
Two-Round MPC: Information-Theoretic and Black-Box (2018) (30)
Private computation using a PEZ dispenser (2003) (30)
Basing Weak Public-Key Cryptography on Strong One-Way Functions (2008) (28)
On Efficient Zero-Knowledge PCPs (2012) (27)
On d-Multiplicative Secret Sharing (2010) (27)
Non-Interactive Multiparty Computation Without Correlated Randomness (2017) (26)
How Many Oblivious Transfers Are Needed for Secure Multiparty Computation? (2007) (26)
Breaking the Barrier for Information-Theoretic Private Information Retrieval (2002) (26)
Private Circuits: A Modular Approach (2018) (26)
Robust Pseudorandom Generators (2013) (25)
Probabilistically Checkable Proofs of Proximity with Zero-Knowledge (2014) (25)
Exploring Crypto Dark Matter: - New Simple PRF Candidates and Their Applications (2018) (25)
Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems (2005) (24)
Correlated Pseudorandom Functions from Variable-Density LPN (2020) (23)
LevioSA: Lightweight Secure Arithmetic Computation (2019) (23)
Diogenes: Lightweight Scalable RSA Modulus Generation with a Dishonest Majority (2021) (23)
Randomization Techniques for Secure Computation (2013) (23)
On the Complexity of UC Commitments (2014) (23)
Bounded-Communication Leakage Resilience via Parity-Resilient Circuits (2016) (21)
Compressing Cryptographic Resources (1999) (20)
Secure Protocol Transformations (2016) (19)
The Price of Low Communication in Secure Multi-party Computation (2017) (19)
Affine Determinant Programs: A Framework for Obfuscation and Witness Encryption (2020) (18)
Efficient Fully Secure Computation via Distributed Zero-Knowledge Proofs (2020) (18)
Proximity Gaps for Reed–Solomon Codes (2020) (18)
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature? (2010) (18)
On Zero-Knowledge PCPs : Limitations , Simplifications , and Applications ∗ (2015) (16)
Universal Service-Providers for Private Information Retrieval (2015) (16)
Cryptography with One-Way Communication (2015) (15)
Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys (2015) (14)
Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits (2016) (14)
Function Secret Sharing for PSI-CA: With Applications to Private Contact Tracing (2020) (13)
Binary AMD Circuits from Secure Multiparty Computation (2016) (13)
Valid Generalisation from Approximate Interpolation (1996) (13)
Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model (2017) (13)
Parallel Hashing via List Recoverability (2015) (12)
Best Possible Information-Theoretic MPC (2018) (11)
Unconditionally Secure Computation Against Low-Complexity Leakage (2019) (11)
Shorter and Faster Post-Quantum Designated-Verifier zkSNARKs from Lattices (2021) (11)
Near-Optimal Secret Sharing and Error Correcting Codes in AC0 (2017) (10)
On Invertible Sampling and Adaptive Security (2010) (10)
On Privacy and Partition Arguments (2001) (10)
Ad Hoc PSM Protocols: Secure Computation Without Coordination (2017) (9)
Secure Computation from Leaky Correlated Randomness (2015) (9)
Communication Versus Computation (2004) (9)
Distribution Design (2016) (9)
Single-use ot combiners with near-optimal resilience (2014) (9)
On Succinct Arguments and Witness Encryption from Groups (2020) (9)
On the Message Complexity of Secure Multiparty Computation (2018) (8)
Zero Knowledge LTCs and Their Applications (2013) (7)
Separating Two-Round Secure Computation From Oblivious Transfer (2020) (7)
Limits of Practical Sublinear Secure Computation (2018) (7)
Cryptography in NC/sup 0/ (2004) (7)
Private multiparty sampling and approximation of vector combinations (2007) (7)
On Public Key Encryption from Noisy Codewords (2016) (7)
How to Construct a Leakage-Resilient (Stateless) Trusted Party (2017) (7)
On the Complexity of Decomposable Randomized Encodings, Or: How Friendly Can a Garbling-Friendly PRF Be? (2020) (7)
Statistical Randomized Encodings: A Complexity Theoretic View (2015) (7)
On Pseudorandom Encodings (2020) (6)
On linear-size pseudorandom generators and hardcore functions (2013) (6)
Sublinear GMW-Style Compiler for MPC with Preprocessing (2021) (6)
Lossy Chains and Fractional Secret Sharing (2013) (6)
Minimizing Locality of One-Way Functions via Semi-private Randomized Encodings (2016) (6)
Cryptography from One-Way Communication: On Completeness of Finite Channels (2020) (6)
Information-Theoretic Private Information Retrieval: A Unied Construction (Extended Abstract) (2001) (6)
On Fully Secure MPC with Solitary Output (2019) (5)
On the Download Rate of Homomorphic Secret Sharing (2021) (5)
On Locally Decodable Codes, Self-Correctable Codes, and t-Private PIR (2010) (5)
Secure Computation from One-Way Noisy Communication, or: Anti-correlation via Anti-concentration (2021) (5)
Near-Optimal Secret Sharing and Error Correcting Codes in \mathsf AC^0 AC 0 (2017) (4)
From randomizing polynomials to parallel algorithms (2012) (4)
On the Round Complexity of Black-Box Secure MPC (2021) (4)
MPC-Friendly Symmetric Cryptography from Alternating Moduli: Candidates, Protocols, and Applications (2021) (4)
How to Prove a Secret: Zero-Knowledge Proofs on Distributed Data via Fully Linear PCPs (2019) (4)
Improving Line-Point Zero Knowledge: Two Multiplications for the Price of One (2022) (3)
A Geometric Approach to Homomorphic Secret Sharing (2021) (3)
Outsourcing Private Machine Learning via Lightweight Secure Arithmetic Computation (2018) (3)
Communication vs. Computation (2007) (3)
Private Circuits with Quasilinear Randomness (2022) (3)
Black-Box Constructions for Secure Computation ∗ (extended abstract) (2006) (2)
Secure Multiparty Computation of Approximations (Extended Abstract) (2001) (2)
Programmable Distributed Point Functions (2022) (2)
Refuting the Dream XOR Lemma via Ideal Obfuscation and Resettable MPC (2022) (2)
Generalized Pseudorandom Secret Sharing and Efficient Straggler-Resilient Secure Computation (2021) (2)
LevioSA (2019) (2)
Secure Multiparty Computation with Sublinear Preprocessing (2022) (2)
Theory of cryptography : 8th Theory of Cryptography Conference, TCC 2011, Providence, RI, USA, March 28-30, 2011 : proceedings (2011) (2)
Prote ting Data Priva y in Private Information RetrievalS hemes (2007) (2)
A Unified Approach to Deterministic Encryption : New Constructions and a Connection to Computational Entropy ( Abstract ) (2012) (2)
Share conversion , pseudorandom secret-sharing and applications to secure distributed computing (2005) (2)
Advances in Cryptology – EUROCRYPT 2020: 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10–14, 2020, Proceedings, Part III (2020) (2)
Using Fully Homomorphic Hybrid Encryption to Minimize Non-interative Zero-Knowledge Proofs (2014) (2)
Communication in the presence of replication (2008) (2)
Correlated Pseudorandomness from Expand-Accumulate Codes (2022) (1)
Cryptographic Sensing (2019) (1)
Beyond the Csiszár-Körner Bound: Best-Possible Wiretap Coding via Obfuscation (2022) (1)
Secure Computation and Its Diverse Applications (2010) (1)
Single-Use Oblivious Transfer Combiners (2013) (1)
Authenticated Garbling from Simple Correlations (2022) (1)
Locality-Preserving Hashing for Shifts with Connections to Cryptography (2022) (1)
Is the Classical GMW Paradigm Practical? The Case of Non-Interactive Actively Secure 2PC (2020) (1)
PSI from Ring-OLE (2022) (1)
On Computational Shortcuts for Information-Theoretic PIR (2020) (1)
Tight Bounds on the Randomness Complexity of Secure Multiparty Computation (2022) (1)
Round-Optimal Black-Box Protocol Compilers (2022) (1)
Correction to: Unconditionally Secure Computation Against Low-Complexity Leakage (2021) (1)
On Low-End Obfuscation and Learning (2023) (0)
Secure Multi-Party Computation with Identiable Abort (2016) (0)
On the Hardness of Information-Theoreti Multiparty Computation (2004) (0)
Correction to: Unconditionally Secure Computation Against Low-Complexity Leakage (2021) (0)
Asymptotically Quasi-Optimal Cryptography (2022) (0)
Work (2019) (0)
Response of the human gastric epithelium to sleeve gastrectomy surgery (2022) (0)
Proceedings - 23rd Annual IEEE Conference on Computational Complexity, CCC 2008: Preface (2008) (0)
Special Section on the Forty-Fifth Annual ACM Symposium on the Theory of Computing (STOC 2013) (2016) (0)
The complexity of information theoretic secure computation (2012) (0)
Fully-Secure MPC with Minimal Trust (2022) (0)
Advances in Cryptology – EUROCRYPT 2020: 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10–14, 2020, Proceedings, Part II (2020) (0)
Encoding Functions with Constant Online Rate or How to Compress Keys in Garbled Circuits (2012) (0)
Advances in Cryptology – EUROCRYPT 2020: 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10–14, 2020, Proceedings, Part I (2020) (0)
Bounded Indistinguishability for Simple Sources (2021) (0)
Black-Box Reusable NISC with Random Oracles (2023) (0)
Minimizing Locality of One-Way Functions via Semi-private Randomized Encodings (2016) (0)
Correction to: Unconditionally Secure Computation Against Low-Complexity Leakage (2022) (0)
Round-Optimal Black-Box Secure Computation from Two-Round Malicious OT (2022) (0)
2 Lecture 1 : Secret Sharing Lecture Summary (2020) (0)
Limits of preprocessing (2020) (0)
Perfect MPC over Layered Graphs (2023) (0)
Information-Theoretic Distributed Point Functions (2022) (0)
Private Information Retrieval with Preprocessing (2021) (0)
N . Gilboa , Y . Ishai , H . Lin , and (2018) (0)
Procede et systeme d'extraction de d'informations privees par utilisation de messages (2000) (0)
How Low Can We Go? (2020) (0)
Streaming and Unbalanced PSI from Function Secret Sharing (2022) (0)
Oblivious Transfer with Constant Computational Overhead (2023) (0)
Correlation Extractors and Their Applications - (Invited Talk) (2011) (0)
Cryptography with Constant Input Locality (Extended Abstract) (2007) (0)
Special Section on the Fifty-Fourth Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013) (2016) (0)
Private computation and correlated randomness (1999) (0)
Quadratic Multiparty Randomized Encodings Beyond Honest Majority and Their Applications (2022) (0)
Low-Complexity Weak Pseudorandom Functions in $\mathtt {AC}0[\mathtt {MOD}2]$ (2021) (0)