Groups Complexity Cryptology
Managing Editor: Shpilrain, Vladimir / Weil, Pascal
Editorial Board: Conder, Marston / Dehornoy, Patrick / Eick, Bettina / Fine, Benjamin / Gilman, Robert / Grigoriev, Dima / Ko, Ki Hyoung / Kreuzer, Martin / Mikhalev, Alexander V. / Myasnikov, Alexei / Perret, Ludovic / Roman'kov, Vitalii / Rosenberger, Gerhard / Sapir, Mark / Thomas, Rick / Tsaban, Boaz / Capell, Enric Ventura
2 Issues per year
CiteScore 2016: 0.35
SCImago Journal Rank (SJR) 2016: 0.372
Source Normalized Impact per Paper (SNIP) 2016: 0.517
Mathematical Citation Quotient (MCQ) 2016: 0.23
The Latin squares and the secret sharing schemes
The Latin square is a good candidate in a secret sharing scheme to represent a secret, because of the huge number of the Latin squares for a reasonably large order. This makes outsiders difficult to discover the secret due to tremendous possibilities. We can improve the efficiency by distributing the shares of the critical set, instead of the full Latin square, to the participants. By different critical sets of the same Latin square, different secret sharing schemes can be implemented. However, finding a critical set of a large order Latin square is very difficult. This makes the implementation of Latin square based secret sharing scheme hard. We explore these limitations, then we propose to apply herding hash technique to overcome them.
Here you can find all Crossref-listed publications in which this article is cited. If you would like to receive automatic email messages as soon as this article is cited in other publications, simply activate the “Citation Alert” on the top of this page.