R C Bose Centre for Cryptology and Security, Indian Statistical Institute, Kolkata
Wednesday, September 25, 2019, 3:00–4:00
Building 227, Room A202, 1:00–2:00
Wednesday, September 25, 2019
Building 1, Room 4072
This talk will be broadcast on-line via BlueJeans. Contact acmdseminar [at] nist.gov (acmdseminar[at]nist[dot]gov) for details.
Host: Raghu Kacker
Abstract: In a secret sharing scheme, a secret is shared amongst a set of participants in such a way that specified subsets of participants (called the access structure) and their supersets can reconstruct the secret from shares while other subsets of participants can not. Matroids are combinatorial structures that generalize the concept of linear independence. There is a strong connection between access structures and Matroids. The talk will explore that.
Bio: Did bachelor's and master's degree in Statistics from Indian Statistical Institute followed by Ph.d in Combinatorics from University of Waterloo, Canada. A faculty member of Indian Statistical Institute, Kolkata for more than 30 years, was its director during 2010-15. Currently, Chairman of National Statistical Commission of Government of India, a rank equivalent to Minister of State of Government of India. Pioneered research in Cryptology in India. Research areas include Cryptology, Combinatorics, Statistical Methods. Among many awards received, the most notable one is Padma Shri, the fourth highest civilian award of Government of India for significant contribution to Education.
Note: Visitors from outside NIST must contact Cathy Graham; (301) 975-3800; at least 24 hours in advance.