Secret sharing schemes with algebraic properties and applications

Abstract

Secret sharing concerns the distribution of some secret information among a number of parties and is among the most well known tools in cryptography. Secret sharing schemes with certain additional algebraic properties, known as linearity and multiplicativity, have important applications in the area of secure multiparty computation and other areas such as zero knowledge proofs. Secret sharing also has a strong relationship with coding theory and motivates new problems in that field. I will survey several of the recent results in the area and some of their applications.