What is she best known for?
The fields of study she is best known for:
- Algorithm
- Algebra
- Discrete mathematics
Mathematical proof, Combinatorics, Discrete mathematics, Verifiable computing and Proof complexity are her primary areas of study.
Her research in the fields of Zero-knowledge proof overlaps with other disciplines such as Coding.
Eli Ben-Sasson combines subjects such as Satisfiability, Simple and Polynomial with her study of Combinatorics.
Her studies deal with areas such as Propositional proof system, Dynamic programming and Analytic proof as well as Simple.
Her work on Hamming distance and True quantified Boolean formula as part of general Discrete mathematics research is frequently linked to Context, thereby connecting diverse disciplines of science.
Her Proof complexity research is multidisciplinary, incorporating elements of Scalability and Resolution.
Her most cited work include:
- Short proofs are narrow—resolution made simple (379 citations)
- SNARKs for C : verifying program executions succinctly and in zero knowledge (315 citations)
- Succinct non-interactive zero knowledge for a von Neumann architecture (196 citations)
What are the main themes of her work throughout her whole career to date?
Her primary areas of investigation include Discrete mathematics, Mathematical proof, Combinatorics, Proof complexity and Resolution.
Her Discrete mathematics study combines topics in areas such as PCP theorem and Constant.
Her Mathematical proof study combines topics from a wide range of disciplines, such as Binary logarithm and Satisfiability, Theoretical computer science.
Her Combinatorics research is multidisciplinary, incorporating perspectives in Computational complexity theory and Polynomial.
She interconnects Propositional calculus and Proof theory in the investigation of issues within Proof complexity.
Her Resolution study also includes fields such as
- Variable that intertwine with fields like Algorithm,
- Simple together with Dynamic programming and Exponential function.
She most often published in these fields:
- Discrete mathematics (61.46%)
- Mathematical proof (47.92%)
- Combinatorics (42.71%)
What were the highlights of her more recent work (between 2014-2020)?
- Mathematical proof (47.92%)
- Zero-knowledge proof (14.58%)
- Theoretical computer science (14.58%)
In recent papers she was focusing on the following fields of study:
Her scientific interests lie mostly in Mathematical proof, Zero-knowledge proof, Theoretical computer science, Discrete mathematics and Cryptography.
Her Mathematical proof research incorporates elements of Computer security, NEXPTIME, Algebraic number and Constant.
The study incorporates disciplines such as Succinctness, Cryptographic primitive and Theory of computation in addition to Zero-knowledge proof.
Her research integrates issues of Soundness, Computation, Scalability and Oracle in her study of Theoretical computer science.
Her Discrete mathematics research incorporates themes from Function, Probabilistically checkable proof, PCP theorem and Combinatorics.
Her work deals with themes such as Generator, Protocol and Von Neumann architecture, which intersect with Cryptography.
Between 2014 and 2020, her most popular works were:
- Scalable, transparent, and post-quantum secure computational integrity. (93 citations)
- Interactive Oracle Proofs (71 citations)
- Secure Sampling of Public Parameters for Succinct Zero Knowledge Proofs (68 citations)
In her most recent research, the most cited papers focused on:
- Algebra
- Algorithm
- Discrete mathematics
Eli Ben-Sasson mostly deals with Zero-knowledge proof, Theoretical computer science, Mathematical proof, Scalability and Cryptography.
Eli Ben-Sasson has included themes like Discrete mathematics, Binary logarithm, Gas meter prover, Soundness and Oracle in her Zero-knowledge proof study.
Eli Ben-Sasson has researched Theoretical computer science in several fields, including Computer security, Interactive proof system, Overhead and NEXPTIME.
Her research integrates issues of Satisfiability and Field in her study of Mathematical proof.
Eli Ben-Sasson has included themes like Cryptographic primitive, Theory of computation, Distributed computing and Correctness in her Scalability study.
Her studies deal with areas such as Hash function, Computation and Protocol as well as Cryptography.
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.
