A survey of secret sharing schemes based on Latin squares

Abstract

Secret sharing schemes are wildly used in many applications where the secret must be recovered by joint work of certain amount of participants. There are many techniques to construct a secret sharing scheme, one of them is the construction using critical sets of Latin squares. In this paper, we will investigate the features of back circulant Latin squares, their corresponding critical sets and show how a secret sharing scheme can be constructed using such kind of critical sets. Finally, we will point out the constraints and future research on such kind of secret sharing schemes.