We define the fundamental problem of VSS and unconditional VSS. Then, we describe a new information checking protocol with improved round and communication complexity. We use the new IC protocol and arrive at more efficient protocols for unconditional VSS. Currently, these protocols are the best available for these problems.
Short Bio:
========
Professor Pandu Rangan obtained his PhD from the Indian Institute of Science (Bangalore, India). Since 1982, he serves as a faculty member in the department of Computer Science and Engineering of the Indian Institute of Technology (Madras). He joined the rank of professors in 1995 and served as Head of Department from 1998 to 2001. He was recently honored as Fellow of the Indian National Academy of Engineering (INAE). He served as a member of the board of Directors of the International Association for Cryptologic Research (IACR) from 2002 to 2005. He is currently in the editorial board of LNCS published by Springer-Verlag and in the editorial board of the Journal of Parallel and Distributed Computing. He served as PC chair/General chair for a number of leading conferences such as ASIACRYPT and INDOCRYPT. He has published extensively in various reputed international journals and conferences covering a vast range of topics in algorithms and cryptology. In algorithms, his research focus is in graph algorithms, randomized algorithms and parallel algorithms. In cryptology, he is focusing in secure/reliable message transmission which is a key problem to solve multiparty computations.
