Secret Sharing and Its Applications


Summary of the talk: 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 some related research problems to the secret sharing, including secure and fair secret reconstruction, verifiable secret sharing, multi-secret sharing, cheater detection and identification in the secret reconstruction. Applications using the secret sharing will also be discussed, such as group key establishment in group communications and group authentication. Finally, I will briefly introduce my recent research paper on the design and implementation of a general secret sharing.

Biography: 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.