{{short description|Israeli computer scientist|bot=PearBOT 5}} {{Infobox scientist | name = Daniel (Danny) Dolev | native_name = דני דולב | native_name_lang = he | fields = Computer science, Cryptography, Distributed computing | workplaces = Hebrew University of Jerusalem, IBM Almaden Research Center | alma_mater = Hebrew University of Jerusalem (BSc) <br> Weizmann Institute of Science (MSc, PhD) | doctoral_advisor = Eli Shamir | doctoral_students = {{ubl |Hagit Attiya |Idit Keidar |Dahlia Malkhi |Michal Parnas |Nir Shavit}} | known_for = Public-key cryptography, non-malleable cryptography, consensus in asynchronous distributed systems, atomic broadcasting, high availability, Byzantine fault tolerance, Dolev–Yao model | awards = ACM Fellow, Edsger W. Dijkstra Prize in Distributed Computing }} '''Daniel (Danny) Dolev''' ({{Langx|he|דני דולב}}) is an Israeli computer scientist known for his research in cryptography and distributed computing. He holds the Berthold Badler Chair in Computer Science at the Hebrew University of Jerusalem and is a member of the scientific council of the European Research Council.<ref>[http://www.cs.huji.ac.il/~dolev/ Faculty web page], Hebrew University, retrieved 2012-02-18.</ref><ref>[http://erc.europa.eu/sites/default/files/content/members_organisation/erc_scientific_council_members.pdf Scientific Council members], European Research Council, retrieved 2012-02-18.</ref><ref name="jp">{{citation|url=https://www.jpost.com/LandedPages/PrintArticle.aspx?id=207573|title=First Israeli appointed to European Scientific Council: Hebrew U. professor Danny Dolev, a leading computer scientist and engineer, has been named one of seven new members|journal=The Jerusalem Post|date=February 10, 2011|first=Judy|last=Siegel-Itzkovich}}.</ref>
==Biography== Dolev did his undergraduate studies at the Hebrew University, earning a bachelor's degree in 1971. He then moved to the Weizmann Institute of Science, earning a master's degree in 1973 and a doctorate in 1979 under the supervision of Eli Shamir.<ref>[http://www.cs.huji.ac.il/~dolev/dd-education.html Education] from Dolev's web site at the Hebrew University, retrieved 2012-02-18.</ref><ref>{{mathgenealogy|id=19326|name=Danny Dolev}}.</ref> After postdoctoral research at Stanford University and IBM Research, he joined the Hebrew University faculty in 1982. He took a second position at the IBM Almaden Research Center from 1987 to 1993, but retained his appointment at the Hebrew University. From 1998 to 2002, he was chair of the Institute of Computer Science and then Director of the School of Engineering and Computer Science at the Hebrew University.<ref>[http://www.cs.huji.ac.il/~dolev/dd-employment.html Employment history] from Dolev's web site at the Hebrew University, retrieved 2012-02-18.</ref> In 2011, he became the first Israeli on the Scientific Council of the European Research Council.<ref name="jp"/>
==Research== Dolev has published many highly cited papers, including works on public-key cryptography,<ref>{{citation | last1 = Dolev | first1 = D. | last2 = Yao | first2 = A. | author2-link = Andrew Yao | doi = 10.1109/TIT.1983.1056650 | issue = 2 | journal = IEEE Transactions on Information Theory | pages = 198–208 | title = On the security of public key protocols | volume = 29 | year = 1983| bibcode = 1983ITIT...29..198D | s2cid = 13643880 }}.</ref> non-malleable cryptography,<ref>{{citation | last1 = Dolev | first1 = Danny | last2 = Dwork | first2 = Cynthia | author2-link = Cynthia Dwork | last3 = Naor | first3 = Moni | author3-link = Moni Naor | doi = 10.1137/S0097539795291562 | issue = 2 | journal = SIAM Journal on Computing | mr = 1769364 | pages = 391–437 | title = Nonmalleable cryptography | volume = 30 | year = 2000}}. Revised and reprinted in ''SIAM Review'' '''45''' (4): 727–784, 2003.</ref> consensus in asynchronous distributed systems,<ref>{{citation | last1 = Dolev | first1 = Danny | last2 = Dwork | first2 = Cynthia | author2-link = Cynthia Dwork | last3 = Stockmeyer | first3 = Larry | author3-link = Larry Stockmeyer | doi = 10.1145/7531.7533 | issue = 1 | journal = Journal of the ACM | mr = 882662 | pages = 77–97 | title = On the minimal synchronism needed for distributed consensus | volume = 34 | year = 1987| s2cid = 2320860 | doi-access = free }}.</ref> atomic broadcasting,<ref>{{citation | last1 = Cristian | first1 = Flaviu | last2 = Aghili | first2 = Houtan | last3 = Strong | first3 = Ray | last4 = Dolev | first4 = Danny | doi = 10.1006/inco.1995.1060 | issue = 1 | journal = Information and Computation | mr = 1329246 | pages = 158–179 | title = Atomic broadcast: from simple message diffusion to Byzantine agreement | volume = 118 | year = 1995| doi-access = free }}.</ref> high availability and high-availability clusters,<ref>{{citation | last1 = Amir | first1 = Y. | last2 = Dolev | first2 = D. | last3 = Kramer | first3 = S. | last4 = Malki | first4 = D. | contribution = Transis: a communication subsystem for high availability | doi = 10.1109/FTCS.1992.243613 | pages = 76–84 | title = Proc. 22nd IEEE International Symposium on Fault-Tolerant Computing | year = 1992| isbn = 978-0-8186-2875-7 | s2cid = 34618282 }}.</ref><ref>{{citation | last1 = Dolev | first1 = Danny | last2 = Malki | first2 = Dalia | doi = 10.1145/227210.227227 | issue = 4 | journal = Communications of the ACM | pages = 64–70 | title = The Transis approach to high availability cluster communication | volume = 39 | year = 1996| s2cid = 5333666 }}.</ref> and Byzantine fault tolerance.<ref>{{citation | last = Dolev | first = Danny | doi = 10.1016/0196-6774(82)90004-9 | issue = 1 | journal = Journal of Algorithms | mr = 646888 | pages = 14–30 | title = The Byzantine generals strike again | volume = 3 | year = 1982}}.</ref><ref>{{citation | last1 = Dolev | first1 = D. | last2 = Strong | first2 = H. R. | doi = 10.1137/0212045 | issue = 4 | journal = SIAM Journal on Computing | mr = 721005 | pages = 656–666 | title = Authenticated algorithms for Byzantine agreement | volume = 12 | year = 1983}}.</ref><ref>{{citation | last1 = Dolev | first1 = Danny | last2 = Lynch | first2 = Nancy A. | author2-link = Nancy Lynch | last3 = Pinter | first3 = Shlomit S. | last4 = Stark | first4 = Eugene W. | last5 = Weihl | first5 = William E. | doi = 10.1145/5925.5931 | issue = 3 | journal = Journal of the ACM | mr = 849026 | pages = 499–516 | title = Reaching approximate agreement in the presence of faults | volume = 33 | year = 1986| s2cid = 496234 | doi-access = free | hdl = 1721.1/149061 | hdl-access = free }}.</ref> Dolev–Yao model was co-developed by Danny Dolev and Andrew Yao.
==Awards and honors== Dolev was elected as an ACM Fellow in 2007 for his "contributions to fault-tolerant distributed computing".<ref>[http://fellows.acm.org/fellow_citation.cfm?id=1711167&srt=all ACM Fellow award citation], retrieved 2012-02-18.</ref> In 2011, Dolev and his co-authors Hagit Attiya and Amotz Bar-Noy were honored with the Edsger W. Dijkstra Prize in Distributed Computing for their work on implementing shared memory using message passing.<ref>[https://www.cs.technion.ac.il/news/2011/465/docs/paper.pdf 2011 Edsger W. Dijkstra Prize in Distributed Computing] {{Webarchive|url=https://web.archive.org/web/20220617123558/https://www.cs.technion.ac.il/news/2011/465/docs/paper.pdf |date=2022-06-17 }}, Technion, retrieved 2012-02-18.</ref>
==References== {{reflist|colwidth=30em}}
==Further reading== *{{citation|title=Chaos theory shakes the old ways of learning|journal=Times Higher Education|first=Helena|last=Flusfeder|date=12 July 1996|url=http://www.timeshighereducation.co.uk/story.asp?storyCode=99971}}.
{{Authority control}}
{{DEFAULTSORT:Dolev, Danny}} Category:Year of birth missing (living people) Category:Living people Category:Academic staff of the Hebrew University of Jerusalem Category:Israeli cryptographers Category:Public-key cryptographers Category:Israeli theoretical computer scientists Category:Researchers in distributed computing Category:Fellows of the Association for Computing Machinery Category:Dijkstra Prize laureates Category:Weizmann Institute of Science alumni Category:Hebrew University of Jerusalem alumni