Bài giảng đại chúng: "Some applications of Graph Theory in Cryptography and Reliability"

Địa điểm: C2-714, VIASM

Báo cáo viên: Yvo G. Desmedt, Jonsson Distinguished Professor at the Univ. of Texas Dallas & Honorary Professor University College London

Thời gian: 15:00 - 16:00 Thứ Sáu, 21/02/2020

Tóm tắt:

In the first part of the talk, we focus on the use of concepts from Graph  Theory that have been used to increase reliability and to achieve unconditionally secure private communication without the need for the one-time pad. We give some examples.

In the second part we apply some of the first results to make progress on a very popular research topic called "Secure Multiparty Computation," that  allows parties that do not trust each other to compute a function of their private input, without the need to divulge their inputs.

Speaker: Yvo G. Desmedt, Jonsson Distinguished Professor at the Univ. of Texas Dallas & Honorary Professor University College London.

Short biography: Yvo Desmedt is the Jonsson Distinguished Professor at the University of Texas at Dallas, a Honorary Professor at University College London, a Fellow of the International Association of Cryptologic Research (IACR) and a Member of the Belgium Royal Academy of Science. He received his Ph.D. (1984, Summa cum Laude) from the University of Leuven, Belgium. He held positions at: Universite de Montreal, University of Wisconsin - Milwaukee (founding director of the Center for Cryptography, Computer and Network Security), and Florida State University (Director of the Laboratory of Security and Assurance in Information Technology, one of the first 14 NSA Centers of Excellence). He was BT Chair and Chair of Information Communication Technology at University College London.  He has held numerous visiting appointments. He is the Editor-in-Chief of IET Information Security and Chair of the Steering Committee of CANS.  He was Program Chair of e.g., Crypto 1994, the ACM Workshop on Scientific Aspects of Cyber Terrorism 2002, and ISC 2013. He has authored over 200 refereed papers, primarily on cryptography, computer security, and network security. He has made important predictions, such as his 1983 technical description how cyber could be used to attack control systems (realized by Stuxnet), and his 1996 prediction hackers will target Certifying Authorities (DigiNotar was targeted in 2011). He posed both the problems of Searchable Encryption and Functional Encryption in his 1993 ACM NSPW paper.

Co-host institution & Sponsors: Vietnam Institute for Advanced Study in Mathematics & School of Electronics and Telecommunications, HUST

Registration: https://docs.google.com/forms/d/e/1FAIpQLSejsImyTj6TYkWDNx19yYwnmPNh_fyi-irzwO5_atlhUsq3Jw/viewform