Danny Dolev

Daniel (Danny) Dolev 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.[1][2][3]

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.[4][5] 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.[6] In 2011, he became the first Israeli on the Scientific Council of the European Research Council.[3]

Research

Dolev has published many highly cited papers, including works on public-key cryptography,[7] non-malleable cryptography,[8] consensus in asynchronous distributed systems,[9] atomic broadcasting,[10] high availability and high-availability clusters,[11][12] and Byzantine fault tolerance.[13][14][15]

Awards and honors

Dolev was elected as an ACM Fellow in 2007 for his "contributions to fault-tolerant distributed computing".[16] 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.[17]

References

  1. ↑ Faculty web page, Hebrew University, retrieved 2012-02-18.
  2. ↑ Scientific Council members, European Research Council, retrieved 2012-02-18.
  3. 1 2 Siegel-Itzkovich, Judy (February 10, 2011), "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", Jerusalem Post.
  4. ↑ Education from Dolev's web site at the Hebrew University, retrieved 2012-02-18.
  5. ↑ Danny Dolev at the Mathematics Genealogy Project.
  6. ↑ Employment history from Dolev's web site at the Hebrew University, retrieved 2012-02-18.
  7. ↑ Dolev, D.; Yao, A. (1983), "On the security of public key protocols", IEEE Transactions on Information Theory 29 (2): 198–208, doi:10.1109/TIT.1983.1056650.
  8. ↑ Dolev, Danny; Dwork, Cynthia; Naor, Moni (2000), "Nonmalleable cryptography", SIAM Journal on Computing 30 (2): 391–437, doi:10.1137/S0097539795291562, MR 1769364. Revised and reprinted in SIAM Review 45 (4): 727–784, 2003.
  9. ↑ Dolev, Danny; Dwork, Cynthia; Stockmeyer, Larry (1987), "On the minimal synchronism needed for distributed consensus", Journal of the ACM 34 (1): 77–97, doi:10.1145/7531.7533, MR 882662.
  10. ↑ Cristian, Flaviu; Aghili, Houtan; Strong, Ray; Dolev, Danny (1995), "Atomic broadcast: from simple message diffusion to Byzantine agreement", Information and Computation 118 (1): 158–179, doi:10.1006/inco.1995.1060, MR 1329246.
  11. ↑ Amir, Y.; Dolev, D.; Kramer, S.; Malki, D. (1992), "Transis: a communication subsystem for high availability", Proc. 22nd IEEE International Symposium on Fault-Tolerant Computing, pp. 76–84, doi:10.1109/FTCS.1992.243613.
  12. ↑ Dolev, Danny; Malki, Dalia (1996), "The Transis approach to high availability cluster communication", Communications of the ACM 39 (4): 64–70, doi:10.1145/227210.227227.
  13. ↑ Dolev, Danny (1982), "The Byzantine generals strike again", Journal of Algorithms 3 (1): 14–30, doi:10.1016/0196-6774(82)90004-9, MR 646888.
  14. ↑ Dolev, D.; Strong, H. R. (1983), "Authenticated algorithms for Byzantine agreement", SIAM Journal on Computing 12 (4): 656–666, doi:10.1137/0212045, MR 721005.
  15. ↑ Dolev, Danny; Lynch, Nancy A.; Pinter, Shlomit S.; Stark, Eugene W.; Weihl, William E. (1986), "Reaching approximate agreement in the presence of faults", Journal of the ACM 33 (3): 499–516, doi:10.1145/5925.5931, MR 849026.
  16. ↑ ACM Fellow award citation, retrieved 2012-02-18.
  17. ↑ 2011 Edsger W. Dijkstra Prize in Distributed Computing, Technion, retrieved 2012-02-18.

Additional reading

This article is issued from Wikipedia - version of the Saturday, September 12, 2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.