Linear Secret-Sharing Schemes, a brief overview
11:00 AM - 12:00 PM, Friday Feb. 5, 901 Van Vleck
In cryptography we call secret-sharing scheme a method for spreading information about a secret among a group of parties, such that the secret can be reconstructed only when a sufficient number of parties combine together the information they hold. The "pieces" of the secret given to the parties are called the shares of the secret. Usually we require that a small number of shares gives no information on the secret. In this talk, I will provide an overview of (linear) secret-sharing schemes: starting from their mathematical definition, I will talk about their relation with coding theory and algebraic geometry and I will conclude the talk presenting some application of linear secret-sharing schemes to cryptographic protocol design.