美国密苏里州大学Lein Harn教授学术报告 7月13日上午
美国密苏里州大学Lein Harn教授学术报告 7月13日上午
发布时间: 2018-07-13 访问次数: 13

学术报告【How to share a secret efficiently over network】

时间:2018年7月13日 (星期五)上午09:30 

地点:旗山校区理工北楼601报告厅

主讲:美国密苏里州大学,Lein Harn教授

主办:数学与信息学院, 福建省网络安全与密码技术重点实验室

参加对象:数信学院感兴趣的教师和研究生


报告摘要:Secret sharing is one of the most popular cryptographic tools in network applications used to protect data.  For example, secret sharing has been used in cloud to strengthen data security. Shamir’s threshold secret sharing scheme which was proposed originally in 1979 is the most popular scheme in the literature.  In this talk, I will briefly introduce Shamir’s scheme and point out some interesting properties.  Then, I will introduce my recent publication which extends Shamir’s scheme to network.  In this publication, shares generated by a dealer can serve two purposes, (1) to reconstruct a secret and (2) to establish pairwise keys between two users.


报告人简介:Lein Harn received the B.S. degree in electrical engineering from the National Taiwan University in 1977, the M.S. degree in electrical engineering from the State University of New York-Stony Brook in 1980, and the Ph.D. degree in electrical engineering from the University of Minnesota in 1984. In 1984, he joined the Department of Electrical and Computer Engineering, University of Missouri- Columbia as an Assistant Professor, and in 1995, he has been promoted as a Full Professor, University of Missouri, Kansas City (UMKC). While at UMKC, he went on development leave to work in Racal Data Group, Florida for a year. His research interests include cryptography, network security, and wireless communication security. He has published over hundred research journal papers on digital signature design and applications, and wireless and network security. He has written two books on security. He is currently investigating new ways of using secret sharing in various applications.