His primary areas of investigation include Encryption, Theoretical computer science, Cryptography, Homomorphic encryption and Random oracle. His research integrates issues of Algorithm and Identity in his study of Encryption. His study in Theoretical computer science is interdisciplinary in nature, drawing from both Key and Bootstrapping.
His Cryptography research is multidisciplinary, relying on both Hash function, Block cipher mode of operation and Digital signature. The study incorporates disciplines such as Cryptosystem, Homomorphic secret sharing, Security parameter and Arithmetic in addition to Homomorphic encryption. As part of one scientific family, Shai Halevi deals mainly with the area of Random oracle, narrowing it down to issues related to the Pseudorandom function family, and often Optimal asymmetric encryption padding and Non-interactive zero-knowledge proof.
Shai Halevi mainly investigates Encryption, Theoretical computer science, Computer security, Cryptography and Homomorphic encryption. He interconnects Scheme and Algorithm in the investigation of issues within Encryption. His Theoretical computer science research is multidisciplinary, incorporating elements of Cryptographic hash function, Hash function, Random oracle, Protocol and Functional encryption.
Shai Halevi works mostly in the field of Hash function, limiting it down to concerns involving Discrete mathematics and, occasionally, Multiplication. His Cryptography research includes themes of Authentication and Digital signature. His Homomorphic encryption study combines topics from a wide range of disciplines, such as Bootstrapping, Arithmetic, Computation, Homomorphic secret sharing and SIMD.
Shai Halevi mainly focuses on Theoretical computer science, Encryption, Homomorphic encryption, Secure multi-party computation and Computer security. His work deals with themes such as Obfuscation, Set, Obfuscation, Functional encryption and Computation, which intersect with Theoretical computer science. He combines subjects such as Discrete mathematics, Computer hardware, Training set, Artificial intelligence and Machine learning with his study of Encryption.
His Homomorphic encryption research integrates issues from Ciphertext, Logistic regression, Linear map, Finite-state machine and Optimization problem. His Ciphertext research is multidisciplinary, incorporating perspectives in Multiplication and Arithmetic. His work on Blockchain and Adversary as part of his general Computer security study is frequently connected to Ledger, Security guarantee and Work, thereby bridging the divide between different branches of science.
His main research concerns Encryption, Theoretical computer science, Homomorphic encryption, Secure multi-party computation and Ciphertext. His work carried out in the field of Encryption brings together such families of science as Discrete mathematics, Algorithm, Machine learning and Artificial intelligence. He has included themes like Multilinear map, Obfuscation, Obfuscation, Functional encryption and Symmetric function in his Theoretical computer science study.
As a member of one scientific family, Shai Halevi mostly works in the field of Homomorphic encryption, focusing on Logistic regression and, on occasion, Iterative method and Scheme. His Secure multi-party computation study integrates concerns from other disciplines, such as Database transaction and Smart contract. His research in Ciphertext intersects with topics in Multiplication, Arithmetic and Computational indistinguishability.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Fully homomorphic encryption over the integers
Marten van Dijk;Craig Gentry;Shai Halevi;Vinod Vaikuntanathan.
theory and application of cryptographic techniques (2010)
The random oracle methodology, revisited
Ran Canetti;Oded Goldreich;Shai Halevi.
Journal of the ACM (2004)
Implementing Gentry's fully-homomorphic encryption scheme
Craig Gentry;Shai Halevi.
international cryptology conference (2011)
Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits
Sanjam Garg;Craig Gentry;Shai Halevi;Mariana Raykova.
foundations of computer science (2013)
Chosen-Ciphertext Security from Identity-Based Encryption
Ran Canetti;Shai Halevi;Jonathan Katz.
theory and application of cryptographic techniques (2004)
The random oracle methodology, revisited (preliminary version)
Ran Canetti;Oded Goldreich;Shai Halevi.
symposium on the theory of computing (1998)
Homomorphic Evaluation of the AES Circuit
Craig Gentry;Shai Halevi;Nigel P. Smart.
international cryptology conference (2012)
Candidate Multilinear Maps from Ideal Lattices
Sanjam Garg;Craig Gentry;Shai Halevi.
theory and application of cryptographic techniques (2013)
Proofs of ownership in remote storage systems
Shai Halevi;Danny Harnik;Benny Pinkas;Alexandra Shulman-Peleg.
computer and communications security (2011)
Public-Key Cryptosystems from Lattice Reduction Problems
O. Goldreich;S. Goldwasser;S. Halevi.
international cryptology conference (1996)
Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: