Shai Halevi
#39,711
Most Influential Person Now
Israeli cryptographer
Shai Halevi's AcademicInfluence.com Rankings
Shai Halevicomputer-science Degrees
Computer Science
#1789
World Rank
#1855
Historical Rank
#852
USA Rank
Algorithms
#230
World Rank
#233
Historical Rank
#32
USA Rank
Database
#3537
World Rank
#3686
Historical Rank
#632
USA Rank
Download Badge
Computer Science
Why Is Shai Halevi Influential?
(Suggest an Edit or Addition)According to Wikipedia, Shai Halevi is a computer scientist who works on cryptography research at Amazon Web Services. Born in Israel in 1966, Halevi received a B.A. and M.Sc. in computer science from the Technion, Israel Institute of Technology in 1991 and 1993. He received his Ph.D. in computer science from Massachusetts Institute of Technology in 1997, and then joined IBM's Thomas J. Watson Research Center, where he was a principal research staff member until 2019. Between 2019 and 2023, he has been a research fellow at Algorand Foundation, a blockchain startup founded by Silvio Micali.
Shai Halevi'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
- Fully Homomorphic Encryption over the Integers (2010) (1784)
- The random oracle methodology, revisited (2000) (1281)
- Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits (2013) (1185)
- Chosen-Ciphertext Security from Identity-Based Encryption (2004) (1099)
- Implementing Gentry's Fully-Homomorphic Encryption Scheme (2011) (974)
- A Forward-Secure Public-Key Encryption Scheme (2003) (888)
- Homomorphic Evaluation of the AES Circuit (2012) (743)
- Proofs of ownership in remote storage systems (2011) (721)
- Candidate Multilinear Maps from Ideal Lattices (2013) (713)
- The random oracle methodology, revisited (preliminary version) (1998) (653)
- Public-Key Cryptosystems from Lattice Reduction Problems (1996) (609)
- Algorithms in HElib (2014) (498)
- Fully Homomorphic Encryption with Polylog Overhead (2012) (475)
- UMAC: Fast and Secure Message Authentication (1999) (441)
- Secure Hash-and-Sign Signatures Without the Random Oracle (1999) (379)
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits (2014) (351)
- Advances in Cryptology - CRYPTO 2009, 29th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 16-20, 2009. Proceedings (2009) (350)
- A Tweakable Enciphering Mode (2003) (276)
- Circular-Secure Encryption from Decision Diffie-Hellman (2008) (268)
- Public-key cryptography and password protocols (1998) (260)
- Bootstrapping for HElib (2015) (245)
- Universally Composable Password-Based Key Exchange (2005) (244)
- MARS - a candidate cipher for AES (1999) (240)
- Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing (1996) (239)
- Graph-Induced Multilinear Maps from Lattices (2015) (238)
- A Parallelizable Enciphering Mode (2004) (222)
- Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits (2011) (222)
- Exposure-Resilient Functions and All-or-Nothing Transforms (2000) (209)
- Better Bootstrapping in Fully Homomorphic Encryption (2012) (207)
- MMH: Software Message Authentication in the Gbit/Second Rates (1997) (203)
- Smooth Projective Hashing and Two-Message Oblivious Transfer (2005) (201)
- Optimizing ORAM and Using It Efficiently for Secure Computation (2013) (190)
- Strengthening Digital Signatures Via Randomized Hashing (2006) (185)
- Collision-Free Hashing from Lattice Problems (1996) (181)
- Public-key cryptography and password protocols (1999) (172)
- Private Database Queries Using Somewhat Homomorphic Encryption (2013) (170)
- A Simple BGN-Type Cryptosystem from LWE (2010) (166)
- Homomorphic Encryption (2017) (164)
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations (2015) (162)
- A Cryptographic Solution to a Game Theoretic Problem (2000) (161)
- Two-Round Secure MPC from Indistinguishability Obfuscation (2014) (159)
- Packed Ciphertexts in LWE-Based Homomorphic Encryption (2013) (159)
- Chosen Ciphertext Secure Public Key Threshold Encryption Without Random Oracles (2006) (157)
- Hierarchical Identity Based Encryption with Polynomially Many Levels (2009) (146)
- Cryptanalysis of Stream Ciphers with Linear Masking (2002) (144)
- i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits (2010) (137)
- Secure Computation on the Web: Computing without Simultaneous Interaction (2011) (131)
- A plausible approach to computer-aided cryptographic proofs (2005) (123)
- Supporting Private Data on Hyperledger Fabric with Secure Multiparty Computation (2018) (117)
- EME*: Extending EME to Handle Arbitrary-Length Messages with Associated Data (2004) (115)
- Garbled RAM Revisited (2014) (112)
- An Improved RNS Variant of the BFV Homomorphic Encryption Scheme (2019) (108)
- A model and architecture for pseudo-random generation with applications to /dev/random (2005) (105)
- Spooky Encryption and Its Applications (2016) (102)
- Fully Secure Functional Encryption without Obfuscation (2014) (101)
- Faster Homomorphic Linear Transformations in HElib (2018) (101)
- Design and Implementation of a Homomorphic-Encryption Library (2012) (98)
- Functional Encryption Without Obfuscation (2016) (97)
- On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input (2014) (93)
- After-the-Fact Leakage in Public-Key Encryption (2011) (93)
- Attacking cryptographic schemes based on "perturbation polynomials" (2009) (89)
- Invertible Universal Hashing and the TET Encryption Mode (2007) (85)
- Hardness Amplification of Weakly Verifiable Puzzles (2005) (78)
- Outsourcing Private RAM Computation (2014) (76)
- Eliminating Decryption Errors in the Ajtai-Dwork Cryptosystem (1997) (74)
- Maintaining Authenticated Communication in the Presence of Break-Ins (1997) (73)
- On the Random-Oracle Methodology as Applied to Length-Restricted Signature Schemes (2004) (72)
- Adaptively-Secure, Non-interactive Public-Key Encryption (2005) (70)
- Doing Real Work with FHE: The Case of Logistic Regression (2018) (69)
- Cryptanalyses of Candidate Branching Program Obfuscators (2017) (68)
- Rationality and traffic attraction: incentives for honest path announcements in bgp (2008) (68)
- Many-to-One Trapdoor Functions and Their Ralation to Public-Key Cryptosystems (1998) (67)
- Homomorphic Encryption Standard (2019) (66)
- Towards Deep Neural Network Training on Encrypted Data (2019) (66)
- Four Round Secure Computation Without Setup (2017) (65)
- Leakage-Tolerant Interactive Protocols (2012) (64)
- Private Database Access with HE-over-ORAM Architecture (2015) (63)
- Security under key-dependent inputs (2007) (62)
- Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security (2016) (62)
- Strongly-Resilient and Non-interactive Hierarchical Key-Agreement in MANETs (2008) (59)
- Ring Switching in BGV-Style Homomorphic Encryption (2012) (58)
- Computing Inverses over a Shared Secret Modulus (2000) (57)
- Candidate Multilinear Maps from Ideal Lattices and Applications (2012) (57)
- Scream: A Software-Efficient Stream Cipher (2002) (55)
- Zeroizing without zeroes: Cryptanalyzing multilinear maps without encodings of zero (2014) (53)
- Fully Secure Attribute Based Encryption from Multilinear Maps (2014) (53)
- Compressible FHE with Applications to PIR (2019) (48)
- Privacy-Preserving Search of Similar Patients in Genomic Data (2018) (47)
- Program Obfuscation with Leaky Hardware (2011) (44)
- Private approximation of NP-hard functions (2001) (44)
- Discrete Gaussian Leftover Hash Lemma over Infinite Domains (2013) (44)
- Can a Public Blockchain Keep a Secret? (2020) (43)
- Potential Function Analysis of Greedy Hot-Potato Routing (1994) (43)
- Mitigating Dictionary Attacks on Password-Protected Local Storage (2006) (42)
- Graded Encoding, Variations on a Scheme (2015) (41)
- Threshold RSA for Dynamic and Ad-Hoc Groups (2008) (40)
- Cryptanalysis of the Quadratic Zero-Testing of GGH (2015) (39)
- A sufficient condition for key-privacy (2005) (38)
- Round-Optimal Secure Multi-party Computation (2018) (36)
- Secure Multiparty Computation with General Interaction Patterns (2016) (34)
- A two layered approach for securing an object store network (2002) (34)
- Succinct Randomized Encodings and their Applications. (2014) (34)
- Implementing BP-Obfuscation Using Graph-Induced Encoding (2017) (33)
- Field switching in BGV-style homomorphic encryption (2013) (30)
- One-Pass HMQV and Asymmetric Key-Wrapping (2011) (30)
- Efficient Commitment Schemes with Bounded Sender and Unbounded Receiver (1995) (29)
- Where Do You Want to Go Today? Escalating Privileges by Pathname Manipulation (2010) (28)
- Computing from partial solutions (1999) (28)
- Zero-one permanent is not=P-complete, a simpler proof (1993) (27)
- The Modular Inversion Hidden Number Problem (2001) (27)
- On Seed-Incompressible Functions (2008) (26)
- Non-Interactive Multiparty Computation Without Correlated Randomness (2017) (26)
- Design and implementation of HElib: a homomorphic encryption library (2020) (26)
- Clock synchronization with faults and recoveries (extended abstract) (2000) (25)
- Enforcing Confinement in Distributed Storage and a Cryptographic Model for Access Control (2005) (25)
- Homomorphic Training of 30, 000 Logistic Regression Models (2019) (25)
- The Hash Function "Fugue" (2014) (23)
- YOSO: You Only Speak Once / Secure MPC with Stateless Ephemeral Roles (2021) (22)
- OpenFHE: Open-Source Fully Homomorphic Encryption Library (2022) (20)
- Iso 9796-1 and the new forgery strategy (1999) (20)
- Homomorphic Encryption for Finite Automata (2019) (20)
- Homomorphic Evaluation of the AES Circuit (Updated Implementation) (2015) (19)
- Degradation and Amplification of Computational Hardness (2008) (18)
- An observation regarding Jutla's modes of operation (2001) (18)
- Tree-based HB protocols for privacy-preserving authentication of RFID tags (2011) (17)
- Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security (2018) (17)
- The MARS Encryption Algorithm (1999) (17)
- Using HB Family of Protocols for Privacy-Preserving Authentication of RFID Tags in a Population (2009) (16)
- On the Independence of P Versus NP (1991) (15)
- More on Proofs of Knowledge (1998) (15)
- Setup-Free Secure Search on Encrypted Data: Faster and Post-Processing Free (2019) (14)
- A STANDARD API FOR RLWE-BASED HOMOMORPHIC ENCRYPTION (2018) (14)
- How to Compress (Reusable) Garbled Circuits (2013) (14)
- Initial Public Offering (IPO) on Permissioned Blockchain Using Secure Multiparty Computation (2019) (13)
- An Architecture for Robust Pseudo-Random Generation and Applications to /dev/random (2005) (11)
- Garbled RAM Revisited, Part I (2014) (11)
- Practical Non-interactive Publicly Verifiable Secret Sharing with Thousands of Parties (2021) (11)
- More on Key Wrapping (2009) (11)
- Best Possible Information-Theoretic MPC (2018) (11)
- Cryptanalysis of ISO/IEC 9796-1 (2008) (11)
- Hiding secrets in software (2016) (10)
- The RMX Transform and Digital Signatures ∗ (2006) (10)
- Random-Index PIR and Applications (2021) (10)
- Composable Security Analysis of OS Services (2011) (9)
- Introduction to Homomorphic Encryption and Schemes (2021) (9)
- Rational ASes and Traffic Attraction: Incentives for honestly announcing paths in BGP (2008) (9)
- Advanced Cryptography: Promise and Challenges (2018) (9)
- Sampling Discrete Gaussians Efficiently and Obliviously (2012) (7)
- How to Maintain Authenticated Communication in the Presence of Break-ins (1996) (6)
- Implementing Gentry ’ s Fully-Homomorphic Encryption Scheme Preliminary Report (2010) (6)
- Random-index PIR with Applications to Large-Scale Secure MPC (2020) (6)
- Can a Blockchain Keep a Secret? (2020) (6)
- The random oracle model (1998) (5)
- Security and Cryptography for Networks - SCN 2012 (2005) (5)
- Proceedings of the Third conference on Theory of Cryptography (2006) (5)
- On Fully Secure MPC with Solitary Output (2019) (5)
- Many-toone Trapdoor Functions and Their Relation to Public-Key Cryptosystems (2009) (4)
- Implementing the Halevi-Krawczyk Randomized Hashing Scheme (2007) (3)
- Theory of Cryptography: Third Theory of Cryptography Conference, TCC 2006, New York, NY, USA, March 4-7, 2006, Proceedings (Lecture Notes in Computer Science) (2006) (3)
- Theory of Cryptography - 8th Theory of Cryptography Conference, TCC 2011, Providence, RI, USA, March 28-30, 2011. Proceedings (2011) (3)
- Generalized Pseudorandom Secret Sharing and Efficient Straggler-Resilient Secure Computation (2021) (2)
- Bootstrapping for HElib (2021) (2)
- Eliminating Decryption Errors in theAjtai-Dwork (2014) (2)
- Ring Switching in BGV-Style Homomorphic Encryption (Preliminary Version) (2012) (2)
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface (2007) (2)
- Threshold Cryptography as a Service (in the Multiserver and YOSO Models) (2022) (2)
- Random-Index Oblivious RAM (2022) (1)
- Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology (2009) (1)
- The Modular Inversion Hidden Number (2001) (1)
- Storage Encryption: A Cryptographer's View (2008) (1)
- Theo ry of Cryptography (vol. # 3876) : Third Theory of Cryptography Conference, TCC 2006, New York, NY, USA, March 4-7, 2006, Proceedings (2006) (1)
- On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input (2017) (1)
- Incremental Codes (2001) (1)
- Weighted Secret Sharing from Wiretap Channels (2022) (1)
- Ideal Lattices and Ntru (2013) (1)
- Smooth Projective Hashing and Two-Message Oblivious Transfer (2010) (0)
- Background : Digital Signatures At Risk ! (2005) (0)
- ON THE INDEPENDENCE OF P VERSUS NP (REVISED VERSION). (1992) (0)
- Weak Ideal Functionalities for Designing Random Oracles with Applications to Fugue (2015) (0)
- Tweakable Enciphering Modes for Sector-Level Encryption ( Extended Abstract ) (2002) (0)
- Learning with Errors (lwe) (2013) (0)
- Storing Classi ed Files (2021) (0)
- Theory and practice of secret commitment (1997) (0)
- Sis-based Signatures (2013) (0)
- Homomorphic Encryption and Lattices (2011) (0)
- Collision-Free Hashing from Lattice ProblemsOded Goldreich (2014) (0)
- Erratum to: Theory of Cryptography (2006) (0)
- OpenFHE (2022) (0)
- Achievable CCA2 Relaxation for Homomorphic Encryption (2022) (0)
- cs . C R ] 1 1 O ct 2 00 0 The Random Oracle Methodology , Revisited ∗ (2008) (0)
- A Stronger Notion of Proofs of Knowledge (2007) (0)
- The Hash Function “ Fugue 2 . 0 ” (2012) (0)
- IBM Comments (2000) (0)
- Advanced Homomorphic Encryption its Applications and Derivatives (AHEAD) (2013) (0)
- Lattices and Homomorphic Encryption, Spring 2013 2 Proof Sketch of Lemma 1 (2013) (0)
- Public Key Cryptography - PKC 2012 (2012) (0)
- Lwe-based Homomorphic Encryption (2013) (0)
- SPRINT: High-Throughput Robust Distributed Schnorr Signatures (2023) (0)
- Evaluating a New Hash Function : Thoughts and Recommendations (2007) (0)
This paper list is powered by the following services:
Other Resources About Shai Halevi
What Schools Are Affiliated With Shai Halevi?
Shai Halevi is affiliated with the following schools:
