What is she best known for?
The fields of study she is best known for:
- Algorithm
- Programming language
- Cryptography
Her primary scientific interests are in Theoretical computer science, Cryptography, Encryption, Class and Scheme.
Yael Tauman Kalai interconnects Homomorphic encryption, Mathematical proof, Random oracle, Function and Learning with errors in the investigation of issues within Theoretical computer science.
In her study, Boolean circuit is inextricably linked to Time complexity, which falls within the broad field of Mathematical proof.
Her Cryptography study incorporates themes from Public-key cryptography and Turing machine.
As part of one scientific family, Yael Tauman Kalai deals mainly with the area of Public-key cryptography, narrowing it down to issues related to the Verifiable secret sharing, and often Computer security.
Her Gas meter prover research focuses on Discrete mathematics and how it relates to Verifiable computing.
Her most cited work include:
- Delegating computation: interactive proofs for muggles (392 citations)
- Improved delegation of computation using fully homomorphic encryption (365 citations)
- Reusable garbled circuits and succinct functional encryption (306 citations)
What are the main themes of her work throughout her whole career to date?
Yael Tauman Kalai mainly focuses on Theoretical computer science, Discrete mathematics, Cryptography, Encryption and Computer security.
She connects Theoretical computer science with Delegation in her research.
Her Discrete mathematics study combines topics from a wide range of disciplines, such as Polynomial, Security parameter and Hardness of approximation.
Yael Tauman Kalai has researched Cryptography in several fields, including Entropy and Key, Public-key cryptography.
The various areas that she examines in her Encryption study include Cryptographic primitive and Turing machine.
The study incorporates disciplines such as Construct, Soundness, Correctness and Verifiable computing in addition to Gas meter prover.
She most often published in these fields:
- Theoretical computer science (41.72%)
- Discrete mathematics (26.49%)
- Cryptography (20.53%)
What were the highlights of her more recent work (between 2019-2021)?
- Discrete mathematics (26.49%)
- Bounded function (7.28%)
- Open problem (3.97%)
In recent papers she was focusing on the following fields of study:
Yael Tauman Kalai focuses on Discrete mathematics, Bounded function, Open problem, PSPACE and Mathematical proof.
She has included themes like PPAD, Gas meter prover, Set, Class and Space in her Discrete mathematics study.
Her Gas meter prover research integrates issues from Reduction, Soundness, Polynomial and Hardness of approximation.
Her Bounded function research also works with subjects such as
- Exponential function that connect with fields like Computation, Cryptographic primitive, Communication complexity and Learning with errors,
- VC dimension that intertwine with fields like Machine learning and Covariate shift.
Her Open problem study integrates concerns from other disciplines, such as Entropy, Logarithm, Theoretical computer science and Hash function.
Borrowing concepts from Alphabet, Yael Tauman Kalai weaves in ideas under Theoretical computer science.
Between 2019 and 2021, her most popular works were:
- Privacy-Preserving Automated Exposure Notification. (6 citations)
- Delegation with Updatable Unambiguous Proofs and PPAD-Hardness (3 citations)
- Delegation with Updatable Unambiguous Proofs and PPAD-Hardness (3 citations)
In her most recent research, the most cited papers focused on:
- Algorithm
- Programming language
- Algebra
PPAD, Scheme, Decidability, Nash equilibrium and Bilinear interpolation are her primary areas of study.
Her research in PPAD intersects with topics in Discrete mathematics, PSPACE, Mathematical proof and Delegation.
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.
