Shlomi Dolev
Born1958
Israel
NationalityIsraeli
Scientific career
FieldsComputer Science
InstitutionsBen-Gurion University of the Negev
Academic advisorsShlomo Moran, Amos Israeli
Websitehttps://www.cs.bgu.ac.il/~dolev/

Shlomi Dolev (Hebrew: שלומי דולב; born December 5, 1958) is a Rita Altura Trust Chair Professor in Computer Science at Ben-Gurion University of the Negev (BGU) and the head of the BGU Negev Hi-Tech Faculty Startup Accelerator.

Biography

Shlomi Dolev received B.Sc. in Civil Engineering and B.A. in Computer Science in 1984 and 1985, and his M.Sc. and D.Sc. in computer science in 1990 and 1992 from the Technion Israel Institute of Technology. From 1992 to 1995 he was at Texas A&M University as a visiting research specialist.

Academic career

In 1995 Dolev joined the Department of Mathematics and Computer Science at BGU. He was the founder and first department head of the Computer Science Department, established in 2000. After 15 years, the department was ranked among the first 150 best departments in the world.[1]

He is the author of Self-Stabilization published by MIT Press in 2000.[2] From 2011 to 2014, Dolev served as Dean of the Natural Sciences Faculty. From 2010 he has served for six years, as the Head of the Inter University Computation Center of Israel.[3]

He is a co-founder, board member and CSO of Secret Double Octopus.[4][5] He is also a co-founder of Secret Sky (SecretSkyDB) Ltd.[6] In 2015 Dolev was appointed head of the steering committee on computer science studies of the Israeli Ministry of Education.[7]

Dolev together with Yuval Elovici and Ehud Gudes established the Telekom Innovation Laboratories at Ben-Gurion University. Dolev was instrumental in establishing the IBM Cyber Security Center of Excellence (CCoE) in Collaboration with Ben-Gurion University of the Negev, and JVP Cyber Labs.[8] Several agencies and companies support his research including ISF, NSF, IBM (faculty awards), Verisign,[9] EMC, Intel, Orange France, Deutsche Telekom, US Airforce and the European Union in the sum of several millions of dollars.

Dolev was a visiting professor at MIT,[10] Paris 11, Paris 6 and DIMACS.[11] He served in more than a hundred program committees, chairing two leading conferences in distributed computing, DISC 2006,[12] and PODC 2014.[13] Recently Prof. Dolev established and chaired the International Symposium on Cyber Security Cryptography and Machine Learning.[14]

Dolev serves as an Associate Editor of the IEEE Transactions on Computers and PeerJ.[15]

Dolev became a fellow of the European Alliance for Innovation in 2019, (EAI),[16] and in 2020 became IEEE fellow.

Research work

Dolev turned a workshop on self-stabilization (Austin, 1989) into a series of events on the subject.[17][18]

Dolev's MA thesis, under the supervision of Shlomo Moran and Amos Israeli resulted in the most cited paper on self-stabilization,[19] following the pioneering paper of Dijkstra[20] introducing the concept of fair composition of self-stabilizing systems. Dolev's contribution to the investigation of self-stabilization spans several decades of research and publications, including research on randomized self-stabilizing algorithms,[21] He has researched Super Stabilizing algorithms that react gracefully to dynamic changes while preserving the automatic recovery property offered by self-stabilizing systems.[22] Dolev also introduced with co-authors, the concepts of, Silent Stabilization,[23] Local stabilization,[24] Practically Stabilizing,[25][26][27][28] Self-stabilizing and Self-organizing,[29] Transient Failure Detectors and yielding Labeling Schemes.[30] He also presented the first silent self-stabilizing depth first search distributed algorithm.

Another research interest is mobile ad-hoc networks, including the use of messages random walks, GeoQuarum and virtual infrastructure, where mobile devices currently populating a geographic region implement virtual automata for the region, yielding a fixed infrastructure.[31]

Dolev's research in cryptography and cyber security research contributions include the introduction of the xor-trees[32] and buses,[33] secret sharing communication[34] and the accumulating automata[35] and secret shared random-access machine,[36] which evolved to patents and establishment of start-ups.

Research on optical computing and complexity complements Dolev's cryptographic research, searching for the use of computation gaps,[37] and provable hard on average instances.[38] Dolev initiated a series of four optical supercomputing workshops[39] and several journal special issues (e.g., Optical High-Performance Computing—JOSA A and Applied Optics[40] and Optical SuperComputing[41]). Published several papers including a commentary in the Nature photonics journal,[42] a nature communication contribution[43] on reversible computing and a patent.[44]

Dolev has also contributed to research in Complex Networks,[45] Hash Function Data Structures,[46] Brain Science,[47] Real-time Computation,[48] Compression,[49] Game Theory,[50] Erasure Correcting,[51] Transactional Memory,[52] Error Correcting Computations,[53] Verification,[54] Machine Learning,[55] Nanotechnology[56] and Cache replacement policy.[57]

References

  1. ↑ "Academic Ranking of World Universities in Computer Science - 2015 | 2015 Top 200 Universities in Computer Science | ARWU-SUBJECT 2015". www.shanghairanking.com. Retrieved 2017-12-30.
  2. ↑ Dolev, Shlomi (2000). Self-stabilization. MIT Press. ISBN 9780262041782.
  3. ↑ "Leadership & Staff - IUCC- Inter-University Computation Center, ISRAEL". IUCC- Inter-University Computation Center, ISRAEL. Retrieved 2017-12-30.
  4. ↑ Secret Double Octopus
  5. ↑ "Secret Double Octopus - Password-free keyless security". doubleoctopus.com. Retrieved 2017-12-30.
  6. ↑ "Secret Sky". www.secretsky.io. Retrieved 2017-12-30.
  7. ↑ Computer-Robotics programming
  8. ↑ Strom, David. "Why Israel could be the next cybersecurity world power". ITworld. Retrieved 2017-12-30.
  9. ↑ "Verisign "Building a Better Internet" Symposium to Highlight Internet Leaders and Visionaries (NASDAQ:VRSN)". investor.verisign.com. Retrieved 2017-12-30.
  10. ↑ "Virtual Infrastructure - Theory of Distributed Systems Group - Massachusetts Institute of Technology". groups.csail.mit.edu. Retrieved 2017-12-30.
  11. ↑ "Past Visitors At DIMACS". dimacs.rutgers.edu. Retrieved 2017-12-30.
  12. ↑ "DISC 2006". www.disc-conference.org. Retrieved 2017-12-30.
  13. ↑ "ACM PODC 2014". www.podc.org. Retrieved 2017-12-30.
  14. ↑ "CSCML 2017". www.cs.bgu.ac.il. Retrieved 2017-12-30.
  15. ↑ "Shlomi Dolev - The Mathematics Genealogy Project". genealogy.math.ndsu.nodak.edu. Retrieved 2017-12-30.
  16. ↑ "We are proud to announce the first EAI Fellows | EAI Blog". 10 May 2019. Retrieved 2020-01-19.
  17. ↑ "Self-Stabilization Home Page". www.selfstabilization.org. Retrieved 2017-12-30.
  18. ↑ "WSS 95 Call For Papers". www.cs.bgu.ac.il. Retrieved 2017-12-30.
  19. ↑ Dolev, Shlomo; Israeli, Amos; Moran, Shlomo (1990). "Self-stabilization of dynamic systems assuming only read/Write atomicity". Proceedings of the ninth annual ACM symposium on Principles of distributed computing. PODC '90. New York, NY, USA: ACM. pp. 103–117. doi:10.1145/93385.93407. ISBN 978-0897914048.
  20. ↑ Dijkstra, Edsger W. (1982). "Self-Stabilization in Spite of Distributed Control". Selected Writings on Computing: A personal Perspective. Texts and Monographs in Computer Science. Springer, New York, NY. pp. 41–46. doi:10.1007/978-1-4612-5695-3_7. ISBN 9781461256977.
  21. ↑ Dolev, S.; Israeli, A.; Moran, S. (April 1997). "Uniform dynamic self-stabilizing leader election". IEEE Transactions on Parallel and Distributed Systems. 8 (4): 424–440. doi:10.1109/71.588622. ISSN 1045-9219.
  22. ↑ Dolev, Shlomi; Welch, Jennifer L. (September 2004). "Self-stabilizing Clock Synchronization in the Presence of Byzantine Faults". Journal of the ACM. 51 (5): 780–799. CiteSeerX 10.1.1.48.9451. doi:10.1145/1017460.1017463. ISSN 0004-5411. S2CID 8310509.
  23. ↑ Dolev, Shlomi; Gouda, Mohamed G.; Schneider, Marco (1999-10-01). "Memory requirements for silent stabilization". Acta Informatica. 36 (6): 447–462. doi:10.1007/s002360050180. ISSN 0001-5903. S2CID 1392365.
  24. ↑ Afek, Y.; Dolev, S. (June 1997). "Local stabilizer". Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems. pp. 74–84. doi:10.1109/ISTCS.1997.595159. ISBN 978-0-8186-8037-3. S2CID 46376063.
  25. ↑ Dolev, Shlomi; Kat, Ronen I.; Schiller, Elad M. (2010-12-01). "When consensus meets self-stabilization". Journal of Computer and System Sciences. 76 (8): 884–900. doi:10.1016/j.jcss.2010.05.005. ISSN 0022-0000.
  26. ↑ Alon, Noga; Attiya, Hagit; Dolev, Shlomi; Dubois, Swan; Potop-Butucaru, Maria; Tixeuil, Sébastien (2015-06-01). "Practically stabilizing SWMR atomic memory in message-passing systems". Journal of Computer and System Sciences. 81 (4): 692–701. doi:10.1016/j.jcss.2014.11.014. ISSN 0022-0000.
  27. ↑ Blanchard, Peva; Dolev, Shlomi; Beauquier, Joffroy; Delaët, Sylvie (2014). Networked Systems (PDF). Lecture Notes in Computer Science. Springer, Cham. pp. 99–121. doi:10.1007/978-3-319-09581-3_8. ISBN 9783319095806.
  28. ↑ Dolev, Shlomi; Georgiou, Chryssis; Marcoullis, Ioannis; Schiller, Elad M. (2017-05-17). "Self-stabilizing Reconfiguration". Networked Systems. Lecture Notes in Computer Science. Vol. 10299. Springer, Cham. pp. 51–68. arXiv:1606.00195. doi:10.1007/978-3-319-59647-1_5. ISBN 9783319596464.
  29. ↑ Dolev, Shlomi; Tzachar, Nir (2009-02-28). "Empire of colonies: Self-stabilizing and self-organizing distributed algorithm". Theoretical Computer Science. 410 (6–7): 514–532. doi:10.1016/j.tcs.2008.10.006. ISSN 0304-3975.
  30. ↑ Beauquier, Joffroy; DelaËt, Sylvie; Dolev, Shlomi; Tixeuil, Sébastien (1998-09-24). "Transient fault detectors". Distributed Computing. Lecture Notes in Computer Science. Vol. 1499. Springer, Berlin, Heidelberg. pp. 62–74. doi:10.1007/BFb0056474. ISBN 9783540650669.
  31. ↑ "Virtual Infrastructure - Theory of Distributed Systems Group - Massachusetts Institute of Technology". groups.csail.mit.edu. Retrieved 2017-12-30.
  32. ↑ Dolev, Shlomi; Ostrobsky, Rafail (May 2000). "Xor-trees for Efficient Anonymous Multicast and Reception". ACM Transactions on Information and System Security. 3 (2): 63–84. CiteSeerX 10.1.1.73.6464. doi:10.1145/354876.354877. ISSN 1094-9224. S2CID 9227352.
  33. ↑ Beimel; Dolev (2003-01-01). "Buses for Anonymous Message Delivery". Journal of Cryptology. 16 (1): 25–39. CiteSeerX 10.1.1.16.1339. doi:10.1007/s00145-002-0128-6. ISSN 0933-2790. S2CID 15634853.
  34. ↑ Dolev, Shlomi; Lahiani, Limor; Yung, Moti (2012-09-01). "Secret swarm unit: Reactive k-secret sharing". Ad Hoc Networks. 10 (7): 1291–1305. doi:10.1016/j.adhoc.2012.03.011. ISSN 1570-8705.
  35. ↑ Dolev, Shlomi; Gilboa, Niv; Li, Ximing (2015). "Accumulating Automata and Cascaded Equations Automata for Communicationless Information Theoretically Secure Multi-Party Computation". Proceedings of the 3rd International Workshop on Security in Cloud Computing. SCC '15. New York, NY, USA: ACM. pp. 21–29. doi:10.1145/2732516.2732526. ISBN 9781450334471. S2CID 1668625.
  36. ↑ Dolev, Shlomi; Li, Yin (2016). Algorithmic Aspects of Cloud Computing. Lecture Notes in Computer Science. Springer, Cham. pp. 19–34. doi:10.1007/978-3-319-29919-8_2. ISBN 9783319299181.
  37. ↑ Dolev, Shlomi; Korach, Ephraim; Li, Ximing; Li, Yin; Uzan, Galit (2016-07-11). "Magnifying computing gaps: Establishing encrypted communication over unidirectional channels". Theoretical Computer Science. 636: 17–26. doi:10.1016/j.tcs.2016.04.032. ISSN 0304-3975.
  38. ↑ Dolev, Shlomi; Fandina, Nova; Gutfreund, Dan (2013-05-22). "Succinct Permanent is NEXP-Hard with Many Hard Instances: (Extended Abstract)". Algorithms and Complexity. Lecture Notes in Computer Science. Vol. 7878. Springer, Berlin, Heidelberg. pp. 183–196. doi:10.1007/978-3-642-38233-8_16. ISBN 9783642382321.
  39. ↑ Dolev, Shlomi; Oltean, Mihai (2013). Optical Supercomputing. Lecture Notes in Computer Science. Vol. 7715. doi:10.1007/978-3-642-38250-5. ISBN 978-3-642-38249-9. S2CID 13010557.{{cite book}}: CS1 maint: date and year (link)
  40. ↑ Caulfield, H. John; Dolev, Shlomi; Green, William M. J. (2009-08-01). "Optical High-Performance Computing—JOSA A and Applied Optics: Introduction". JOSA A. 26 (8): OHPC1–OHPC2. Bibcode:2009JOSAA..26C...1C. doi:10.1364/JOSAA.26.0OHPC1. ISSN 1520-8532. PMID 19649109.
  41. ↑ Dolev, Shlomi; Oltean, Mihai (2015-09-01). "Optical SuperComputing: Preface to special issue". Natural Computing. 14 (3): 431–432. doi:10.1007/s11047-015-9510-9. ISSN 1567-7818.
  42. ↑ Caulfield, H. John; Dolev, Shlomi (2010-05-01). "Why future supercomputing requires optics". Nature Photonics. 4 (5): 261–263. doi:10.1038/nphoton.2010.94.
  43. ↑ Cohen, Eyal; Dolev, Shlomi; Rosenblit, Michael (2016-04-26). "All-optical design for inherently energy-conserving reversible gates and circuits". Nature Communications. 7: 11424. Bibcode:2016NatCo...711424C. doi:10.1038/ncomms11424. PMC 4853429. PMID 27113510.
  44. ↑ US 20050013531, Dolev, Shlomo & Nir, Yuval, "Optical implementation of bounded non-deterministic turing machines", published Jan 20, 2005
  45. ↑ Dolev, Shlomi; Elovici, Yuval; Puzis, Rami (May 2010). "Routing Betweenness Centrality". Journal of the ACM. 57 (4): 25:1–25:27. doi:10.1145/1734213.1734219. ISSN 0004-5411. S2CID 15662473.
  46. ↑ Dolev, Shlomi; Lahiani, Limor; Haviv, Yinnon (2013-03-04). "Unique permutation hashing". Theoretical Computer Science. 475: 59–65. doi:10.1016/j.tcs.2012.12.047. ISSN 0304-3975.
  47. ↑ Berend, Daniel; Dolev, Shlomi; Hanemann, Ariel (2014-11-07). "Graph Degree Sequence Solely Determines the Expected Hopfield Network Pattern Stability". Neural Computation. 27 (1): 202–210. doi:10.1162/NECO_a_00685. ISSN 0899-7667. PMID 25380334. S2CID 324693.
  48. ↑ Dolev, Shlomi; Keizelman, Alexander (1999-07-01). "Non-Preemptive Real-Time Scheduling of Multimedia Tasks". Real-Time Systems. 17 (1): 23–39. doi:10.1023/A:1008033411290. ISSN 0922-6443. S2CID 21271497.
  49. ↑ Dolev, S.; Frenkel, S.; Kopeetsky, M. (August 2014). "Entropy Adaptive On-Line Compression". 2014 IEEE 13th International Symposium on Network Computing and Applications. pp. 162–166. doi:10.1109/NCA.2014.31. ISBN 978-1-4799-5393-6. S2CID 16454780.
  50. ↑ Dolev, Shlomi (2015). "The Reality Game Theory Imposes (Short Summary)". Algorithms, Probability, Networks, and Games. Lecture Notes in Computer Science. Vol. 9295. Springer, Cham. pp. 25–26. doi:10.1007/978-3-319-24024-4_2. ISBN 9783319240237.
  51. ↑ Beimel, A.; Dolev, S.; Singer, N. (December 2007). "RT Oblivious Erasure Correcting". IEEE/ACM Transactions on Networking. 15 (6): 1321–1332. CiteSeerX 10.1.1.75.2503. doi:10.1109/TNET.2007.896540. ISSN 1063-6692. S2CID 1942801.
  52. ↑ Dolev, Shlomi; Hendler, Danny; Suissa, Adi (2008). "Car-STM". Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing. PODC '08. New York, NY, USA: ACM. pp. 125–134. doi:10.1145/1400751.1400769. ISBN 9781595939890. S2CID 2244129.
  53. ↑ Dolev, Shlomi; Frenkel, Sergey; Tamir, Dan E.; Sinelnikov, Vladimir (2013-12-01). "Preserving Hamming Distance in Arithmetic and Logical Operations". Journal of Electronic Testing. 29 (6): 903–907. doi:10.1007/s10836-013-5421-9. ISSN 0923-8174. S2CID 10400423.
  54. ↑ Brukman, Olga; Dolev, Shlomi (2011-08-01). "Recovery oriented programming: runtime monitoring of safety and liveness". International Journal on Software Tools for Technology Transfer. 13 (4): 377–395. doi:10.1007/s10009-011-0200-3. ISSN 1433-2779. S2CID 38141213.
  55. ↑ Dolev, Shlomi; Leshem, Guy; Yagel, Reuven (2010). "Purifying data by machine learning with certainty levels". Proceedings of the Third International Workshop on Reliability, Availability, and Security. WRAS '10. New York, NY, USA: ACM. pp. 5:1–5:6. doi:10.1145/1953563.1953567. ISBN 9781450306423. S2CID 14923143.
  56. ↑ Cohen, Eyal; Dolev, Shlomi; Rosenblit, Michael (2012-07-19). "A Nano-Optics Vector Matrix Multiplier for Implementing State Machines". Optical Supercomputing. Lecture Notes in Computer Science. Vol. 7715. Springer, Berlin, Heidelberg. pp. 78–91. doi:10.1007/978-3-642-38250-5_9. ISBN 9783642382499.
  57. ↑ Bitan, Dor; Dolev, Shlomi (2019). "Randomly Rotate Qubits Compute and Reverse --- IT-Secure Non-Interactive Fully-Compact Homomorphic Quantum Computations over Classical Data Using Random Bases". Cryptology ePrint Archive.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.