What is he best known for?
The fields of study he is best known for:
- Cryptography
- Algorithm
- Algebra
Amit Sahai spends much of his time researching Theoretical computer science, Encryption, Cryptography, Functional encryption and Attribute-based encryption.
His Theoretical computer science study combines topics from a wide range of disciplines, such as Mathematical proof, Random oracle, Cryptographic primitive, Obfuscation and Standard model.
His research investigates the link between Encryption and topics such as Oracle that cross with problems in Homomorphic encryption, Formal proof, Signature, Ring signature and Multisignature.
His Cryptography research is under the purview of Computer security.
His research integrates issues of Multiple encryption, Probabilistic encryption and Client-side encryption in his study of Functional encryption.
His Attribute-based encryption research integrates issues from Ciphertext and Access structure.
His most cited work include:
- Attribute-based encryption for fine-grained access control of encrypted data (3551 citations)
- Ciphertext-Policy Attribute-Based Encryption (3062 citations)
- Fuzzy identity-based encryption (2960 citations)
What are the main themes of his work throughout his whole career to date?
The scientist’s investigation covers issues in Theoretical computer science, Cryptography, Encryption, Computer security and Discrete mathematics.
The study incorporates disciplines such as Cryptographic primitive, Obfuscation, Protocol, Zero-knowledge proof and Functional encryption in addition to Theoretical computer science.
His Cryptography study integrates concerns from other disciplines, such as Adversary and Bounded function.
His Encryption research focuses on Attribute-based encryption, Ciphertext, Homomorphic encryption, Public-key cryptography and Probabilistic encryption.
His work carried out in the field of Probabilistic encryption brings together such families of science as Multiple encryption and 40-bit encryption.
His Discrete mathematics study combines topics in areas such as Algorithm, Class, Combinatorics and Constant.
He most often published in these fields:
- Theoretical computer science (47.44%)
- Cryptography (31.00%)
- Encryption (24.26%)
What were the highlights of his more recent work (between 2016-2021)?
- Theoretical computer science (47.44%)
- Discrete mathematics (18.60%)
- Cryptography (31.00%)
In recent papers he was focusing on the following fields of study:
Amit Sahai mostly deals with Theoretical computer science, Discrete mathematics, Cryptography, Obfuscation and Functional encryption.
His studies deal with areas such as Homomorphic encryption, Cryptographic primitive, Witness, Pseudorandom number generator and Computation as well as Theoretical computer science.
His study in Discrete mathematics is interdisciplinary in nature, drawing from both Turing machine, Multilinear map, Degree, Encryption and Constant.
His work on Security parameter is typically connected to Self processing as part of general Encryption study, connecting several disciplines of science.
His study looks at the intersection of Obfuscation and topics like Bilinear interpolation with Mathematical proof.
His study connects Ciphertext indistinguishability and Functional encryption.
Between 2016 and 2021, his most popular works were:
- Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps (51 citations)
- Threshold Cryptosystems from Threshold Fully Homomorphic Encryption (41 citations)
- Lattice-Based SNARGs and Their Application to More Efficient Obfuscation (25 citations)
In his most recent research, the most cited papers focused on:
- Algorithm
- Algebra
- Cryptography
The scientist’s investigation covers issues in Theoretical computer science, Discrete mathematics, Functional encryption, Cryptography and Bilinear interpolation.
His Theoretical computer science research is multidisciplinary, relying on both Homomorphic encryption, Cryptographic primitive, Witness, Pseudorandom number generator and Verifiable secret sharing.
The subject of his Homomorphic encryption research is within the realm of Encryption.
His work on Learning with errors as part of general Encryption research is frequently linked to Large class, bridging the gap between disciplines.
The concepts of his Functional encryption study are interwoven with issues in Joint and Ciphertext indistinguishability.
His Cryptography research is multidisciplinary, incorporating perspectives in Sample and Polynomial.
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.
