Dan Boneh

{{Infobox scientist

| name = Dan Boneh

| native_name = דן בונה

| native_name_lang = he

| image = Dan Boneh 1.jpg

| image_size =

| birth_date = {{birth year and age|1969}}

| birth_place = Israel

| death_date =

| death_place =

| citizenship =

| nationality =

| ethnicity =

| field = Cryptography

| work_institutions = Stanford University

| alma_mater = Princeton University (PhD)

| doctoral_advisor = Richard J. Lipton

| doctoral_students = {{Plainlist|

Craig Gentry

}}

| known_for = {{Plainlist|

}}

| author_abbrev_bot =

| author_abbrev_zoo =

| prizes = {{Plainlist|

}}

| religion =

| signature =

| footnotes =

| thesis_title = Studies in Computational Number Theory with Applications to Cryptography

| thesis_year = 1996

| caption = Boneh in 2007

}}

Dan Boneh ({{IPAc-en|b|oʊ|ˈ|n|eɪ}}; {{langx|he|דן בונה}}) is an Israeli–American professor in applied cryptography and computer security at Stanford University.

In 2016, Boneh was elected a member of the National Academy of Engineering for contributions to the theory and practice of cryptography and computer security.

Biography

Born in Israel in 1969,{{Citation needed|date=September 2018}} Boneh obtained his Ph.D. in computer science from Princeton University in 1996 under the supervision of Richard J. Lipton.{{cite web | title = Cryptography Is Dead? | date = March 2013 | url=http://rjlipton.wordpress.com/2013/03/02/cryptography-is-dead/}}{{MathGenealogy|id=70975}}

Boneh is one of the principal contributors to the development of pairing-based cryptography, along with Matt Franklin of the University of California, Davis.{{ cite web | title=Google Scholar citations of Boneh-Franklin paper | url=https://scholar.google.com/scholar?cites=1257489057529642161&as_sdt=2005&sciodt=0,5&hl=en }} He joined the faculty of Stanford University in 1997, and became professor of computer science and electrical engineering.{{cite web | title = Dan Boneh's Publications by Topic | url=http://crypto.stanford.edu/~dabo/pubs/pubsbytopic.html}}{{cite web | title = Dan Boneh's Google Scholar Profile | url=https://scholar.google.com/scholar?q=%22Dan+Boneh%22}} He teaches massive open online courses on the online learning platform Coursera.{{Cite web |title= Dan Boneh |work= Coursera instructor profile |url= https://en.coursera.org/instructor/~774 |access-date= April 8, 2018 }} In 1999, he was awarded a fellowship from the David and Lucile Packard Foundation.{{Cite web |title= Dan Boneh: 1999 Fellow |publisher= David and Lucile Packard Foundation |url= https://www.packard.org/what-we-fund/conservation-and-science/science/packard-fellowships-for-science-and-engineering/fellowship-directory/boneh-dan/ |access-date= March 10, 2017 }} In 2002, he co-founded a company called Voltage Security with three of his students.{{Cite web |title= Voltage Security, Inc., Corporate Fact Sheet |work= Old web site |url= http://www.voltage.com/about/factsheet.htm |url-status= dead |archive-date= July 18, 2004 |archive-url= https://web.archive.org/web/20040718071835/http://www.voltage.com/about/factsheet.htm |access-date= March 10, 2017 }} The company was acquired by Hewlett-Packard in 2015.{{Cite news |title= HP set to acquire encryption firm Voltage Security |author= Mary Azevedo |date= February 20, 2015 |work= RCR Wireless news |url= http://www.rcrwireless.com/20150220/telecom-software/hp-set-acquire-voltage-security |access-date= March 10, 2017 }}{{Cite news |title= Hewlett-Packard buys Cupertino's Voltage Security for data protection |author= Jeremy C. Owens |date= February 9, 2015 |work= San Jose Mercury News |url= http://www.mercurynews.com/2015/02/09/biz-break-hewlett-packard-buys-cupertinos-voltage-security-for-data-protection/ |access-date= March 10, 2017 }}

In 2018, Boneh became co-director (with David Mazières) of the newly founded Center for Blockchain Research at Stanford, predicting at the time that "Blockchains will become increasingly critical to doing business globally."{{Cite news|url=https://engineering.stanford.edu/news/stanford-computer-scientists-launch-center-blockchain-research|title=Stanford computer scientists launch the Center for Blockchain Research|date=2018-06-20|work=Stanford School of Engineering|access-date=2018-09-01|language=en}} Dr. Boneh is also known for putting his entire introductory cryptography course online for free.{{cite web |url=https://crypto.stanford.edu/~dabo/courses/OnlineCrypto |title=Online Cryptography Course |author=Dan Boneh |publisher=Stanford University}} The course is also available via Coursera.{{cite web |url=https://www.coursera.org/learn/crypto |title=Cryptography I |website=Coursera}}

Awards

2021 Fellow of the American Mathematical Society{{citation|url=https://www.ams.org/cgi-bin/fellows/fellows_by_year.cgi?year=2021|title=2021 Class of Fellows of the AMS|publisher=American Mathematical Society|access-date=2020-11-02}}
2020 Selfridge Prize with Jonathan Love
2016 Elected to the US National Academy of Engineering
2016 Fellow of the Association for Computing Machinery{{citation|title=ACM Recognizes New Fellows|journal=Communications of the ACM|date=March 2017|volume=60|issue=3|page=23|doi=10.1145/3039921|last1=Cacm Staff|s2cid=31701275}}.
2014 ACM Prize in Computing[https://awards.acm.org/acm-prize/award-winners ACM Prize in Computing Award Winners], April 11, 2018. (formerly called the ACM-Infosys Foundation award{{Cite web |title= Dan Boneh |work= Award web page |publisher= ACM |url= https://awards.acm.org/award_winners/boneh_4125431 |access-date= July 12, 2019 }})
2013 Gödel Prize, with Matthew K. Franklin and Antoine Joux, for his work on the Boneh–Franklin scheme[http://www.acm.org/press-room/news-releases/2013/goedel-prize-13/ ACM Group Presents Gödel Prize for Advances in Cryptography: Three Computer Scientists Cited for Innovations that Improve Security] {{Webarchive|url=https://web.archive.org/web/20130601191333/http://www.acm.org/press-room/news-releases/2013/goedel-prize-13 |date=2013-06-01 }}, Association for Computing Machinery, May 29, 2013.
2005 RSA Awardhttp://www.securityinfowatch.com/press_release/10610184/co-founder-of-voltage-security-wins-rsa-award ([https://web.archive.org/web/20140424164050/http://www.securityinfowatch.com/press_release/10610184/co-founder-of-voltage-security-wins-rsa-award Archive])
1999 Sloan Research FellowshipAlfred P. Sloan Foundation, [http://www.sloan.org/fileadmin/media/files/annual_reports/1999_annual_report.pdf 1999 Annual Report] {{Webarchive|url=https://web.archive.org/web/20140821033013/http://www.sloan.org/fileadmin/media/files/annual_reports/1999_annual_report.pdf |date=2014-08-21 }}, February 17, 2014.
1999 Packard Award[https://www.packard.org/what-we-fund/science/packard-fellowships-for-science-and-engineering/fellowship-directory/boneh-dan/ Boneh, Dan -- The David and Lucile Packard Foundation], April 11, 2018.

Publications

Boneh's primary research focuses is on the area of cryptography where he has worked in numerous areas.

= Identity-Based Encryption =

In 1984 Adi Shamir proposed the possibility of identity-based encryption (IBE), which allows people to send encrypted messages to each other by using a public key derived from the recipients identity. Boneh, with Matt Franklin, proposed one of the first identity-based encryption schemes based on the Weil pairing. The Boneh-Franklin scheme remains an active area of research. In 2010 Boneh (with Shweta Agrawal and Xavier Boyen) introduced an IBE scheme from the learning with errors assumption.{{Cite book|last1=Agrawal|first1=Shweta|last2=Boneh|first2=Dan|last3=Boyen|first3=Xavier|title=Advances in Cryptology – EUROCRYPT 2010 |chapter=Efficient Lattice (H)IBE in the Standard Model |date=2010-05-30|series=Lecture Notes in Computer Science|volume=6110 |language=en|publisher=Springer, Berlin, Heidelberg|pages=553–572|doi=10.1007/978-3-642-13190-5_28|isbn=9783642131899|s2cid=185222 }}

= Homomorphic Encryption =

A homomorphic encryption algorithm is one where a user can perform computation on encrypted data, without decrypting it. Boneh's has developed several improvements of homomorphic cryptosystems. For example, with Eu-Jin Goh and Kobbi Nissim in 2005 Boneh proposed a "partially homomorphic cryptosystem".{{cite web |author=D Boneh, EJ Goh, K Nissim |date=April 2006 |title=Evaluating 2-DNF Formulas on Ciphertexts | url=https://crypto.stanford.edu/~dabo/papers/2dnf.pdf}}

= Timing attacks =

Timing attacks are a type of side-channel attack that allows an adversary to attack a security system by studying now long it takes to perform certain calculations. In 2003, Boneh (with David Brumley) proposed one of the first practical timing attacks on OpenSSL that worked over the Internet. He then later showed how to extend the attack, "show[ing] that the time web sites take to respond to HTTP requests can leak private information."A. Bortz, D. Boneh, and P. Nandy [http://crypto.stanford.edu/~dabo/pubs/abstracts/webtiming.html Exposing private information by timing web applications] 6th International Conference on World Wide Web, WWW 2007, ACM 2007, pp. 621-628

= Other significant work =

Some of Boneh's other results in cryptography and computer security include:

2018: Verifiable Delay Functions{{cite web | url=https://eprint.iacr.org/2018/601.pdf | title=Verifiable Delay Functions | publisher=International Association for Cryptologic Research | date=12 June 2018 | access-date=23 February 2018 |author1=Dan Boneh |author2=Joseph Bonneau |author3=Benedikt Bünz |author4=Ben Fisch }}
2015: Privacy-preserving proofs of solvency for Bitcoin exchanges{{cite web | url=https://eprint.iacr.org/2015/1008.pdf | title=Provisions: Privacy-preserving proofs of solvency for Bitcoin exchanges | publisher=International Association for Cryptologic Research | date=26 October 2015 | access-date=23 February 2016 |author1=Gaby G. Dagher |author2=Benedikt Bünz |author3=Joseph Bonneau |author4=Jeremy Clark |author5=Dan Boneh }}
2010: He was involved in designing tcpcrypt, TCP extensions for transport-level security{{cite web |author=A. Bittau |date=July 2010 |title=Cryptographic protection of TCP Streams (tcpcrypt) |work=IETF draft |url=http://tcpcrypt.org/draft-bittau-tcp-crypt.txt |display-authors=etal |url-status=dead |archive-url=https://web.archive.org/web/20100821120841/http://tcpcrypt.org/draft-bittau-tcp-crypt.txt |archive-date=2010-08-21 }}{{cite conference |author=Andrea Bittau |date=2010-08-13 |title=The case for ubiquitous transport-level encryption |publisher=19th USENIX Security Symposium |url=http://www.usenix.org/events/sec10/tech/full_papers/Bittau.pdf |display-authors=etal}}
2005: A partially homomorphic cryptosystem (with Eu-Jin Goh and Kobbi Nissim)
2005: The first broadcast encryption system with full collision resistance (with Craig Gentry and Brent Waters)
1999: Cryptanalysis of RSA when the private key is less than N^0.292 (with Glenn Durfee)
1997: Fault-based cryptanalysis of public-key systems (with Richard J. Lipton and Richard DeMillo)
1995: Collision resistant fingerprinting codes for digital data (with James Shaw)
1995: Cryptanalysis using a DNA computer (with Christopher Dunworth and Richard J. Lipton)
2005: PwdHash a browser extension that transparently produces a different password for each site

B. Ross, C. Jackson, N. Miyake, D. Boneh, and J. Mitchell [http://crypto.stanford.edu/~dabo/pubs/abstracts/pwdhash.html Stronger Password Authentication Using Browser Extensions]

Usenix security 2005{{cite web|url=http://news.stanford.edu/news/2005/july27/phish-072705.html|title=Security experts unveil defense against phishing|date=2005-07-27}}