What is he best known for?
The fields of study he is best known for:
- Operating system
- The Internet
- Computer network
Dan Boneh spends much of his time researching Computer security, Encryption, Public-key cryptography, Theoretical computer science and Random oracle.
Dan Boneh has researched Computer security in several fields, including Android, Web server, Computer network and World Wide Web.
His Encryption research incorporates elements of Discrete mathematics, Tamper resistance, Auxiliary memory, Identity and Abstract machine.
His studies deal with areas such as Cryptosystem, Signature and Scheme, Ciphertext as well as Public-key cryptography.
His biological study spans a wide range of topics, including Key generation, Probabilistic encryption, Cryptography, Multilinear map and Attribute-based encryption.
The concepts of his Random oracle study are interwoven with issues in Algorithm, Standard model, ID-based encryption and Functional encryption.
His most cited work include:
- Identity-Based Encryption from the Weil Pairing (5100 citations)
- Identity-Based Encryption from the Weil Pairing (3054 citations)
- Public Key Encryption with Keyword Search (2206 citations)
What are the main themes of his work throughout his whole career to date?
Dan Boneh spends much of his time researching Computer security, Encryption, Cryptography, Theoretical computer science and Public-key cryptography.
His work deals with themes such as World Wide Web and Internet privacy, which intersect with Computer security.
Ciphertext, Probabilistic encryption, Attribute-based encryption, Homomorphic encryption and Functional encryption are the core of his Encryption study.
The various areas that Dan Boneh examines in his Cryptography study include Set, Multilinear map and Server.
Dan Boneh studied Theoretical computer science and Random oracle that intersect with Standard model.
His Public-key cryptography study frequently links to adjacent areas such as Discrete mathematics.
He most often published in these fields:
- Computer security (32.35%)
- Encryption (24.83%)
- Cryptography (22.78%)
What were the highlights of his more recent work (between 2015-2021)?
- Cryptography (22.78%)
- Computer security (32.35%)
- Theoretical computer science (21.87%)
In recent papers he was focusing on the following fields of study:
His primary scientific interests are in Cryptography, Computer security, Theoretical computer science, Discrete mathematics and Encryption.
His Cryptography study incorporates themes from Computer network, Server, Multilinear map and Lattice.
His Computer security study which covers JavaScript that intersects with Web storage, Web navigation and Trusted path.
His Theoretical computer science research is multidisciplinary, incorporating perspectives in Signature, Mathematical proof and Public-key cryptography.
The concepts of his Discrete mathematics study are interwoven with issues in Leader election, Gas meter prover, Pseudorandom number generator, Security parameter and Verifiable secret sharing.
His work on Homomorphic encryption as part of general Encryption study is frequently linked to Transport layer, therefore connecting diverse disciplines of science.
Between 2015 and 2021, his most popular works were:
- Ensemble Adversarial Training: Attacks and Defenses (1082 citations)
- The Space of Transferable Adversarial Examples (264 citations)
- Bulletproofs: Short Proofs for Confidential Transactions and More (179 citations)
In his most recent research, the most cited papers focused on:
- Operating system
- The Internet
- Computer network
His scientific interests lie mostly in Theoretical computer science, Cryptography, Computer security, Adversarial system and Robustness.
His Theoretical computer science research incorporates themes from Scalability, Mathematical proof, Zero-knowledge proof and Pseudorandom number generator.
His Cryptography research integrates issues from Multilinear map, Lattice, Functional encryption and Puncturing.
Many of his studies involve connections with topics such as Internet privacy and Computer security.
His study explores the link between Robustness and topics such as Perturbation that cross with problems in Affine transformation and Algorithm.
His study in Finite field is interdisciplinary in nature, drawing from both Homomorphic encryption and Encryption.
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.
