2023 - Research.com Computer Science in United States Leader Award
2021 - Fellow of the American Mathematical Society For contributions to cryptography.
2016 - Member of the National Academy of Engineering For contributions to the theory and practice of cryptography and computer security.
2016 - ACM Fellow For contributions to cryptography and computer security.
2014 - ACM Prize in Computing For ground-breaking contributions to the development of pairing-based cryptography and its application in identity-based encryption.
1999 - Fellow of Alfred P. Sloan Foundation
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.
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.
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.
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.
Short Signatures from the Weil Pairing
Dan Boneh;Ben Lynn;Hovav Shacham.
Journal of Cryptology (2004)
Identity-Based Encryption from the Weil Pairing
Dan Boneh;Matthew Franklin.
SIAM Journal on Computing (2003)
Public Key Encryption with Keyword Search
Dan Boneh;Giovanni Di Crescenzo;Rafail Ostrovsky;Giuseppe Persiano.
theory and application of cryptographic techniques (2004)
A fully homomorphic encryption scheme
Dan Boneh;Craig Gentry.
Short Group Signatures.
Dan Boneh;Xavier Boyen;Hovav Shacham.
IACR Cryptology ePrint Archive (2004)
Aggregate and verifiably encrypted signatures from bilinear maps
Dan Boneh;Craig Gentry;Ben Lynn;Hovav Shacham.
theory and application of cryptographic techniques (2003)
On the importance of checking cryptographic protocols for faults
Dan Boneh;Richard A. DeMillo;Richard J. Lipton.
theory and application of cryptographic techniques (1997)
Hierarchical identity based encryption with constant size ciphertext
Dan Boneh;Xavier Boyen;Eu-Jin Goh.
Lecture Notes in Computer Science (2005)
Efficient selective-ID secure identity-based Encryption without random oracles
Dan Boneh;Xavier Boyen.
Lecture Notes in Computer Science (2004)
Evaluating 2-DNF formulas on ciphertexts
Dan Boneh;Eu-Jin Goh;Kobbi Nissim.
theory of cryptography conference (2005)
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: