Jump to ContentJump to Main Navigation
Show Summary Details

Groups Complexity Cryptology

Managing Editor: Shpilrain, Vladimir / Weil, Pascal

Editorial Board Member: Blackburn, Simon R. / Conder, Marston / Dehornoy, Patrick / Eick, Bettina / Fine, Benjamin / Gilman, Robert / Grigoriev, Dima / Ko, Ki Hyoung / Kreuzer, Martin / Mikhalev, Alexander V. / Myasnikov, Alexei / Roman'kov, Vitalii / Rosenberger, Gerhard / Sapir, Mark / Schäge, Sven / Thomas, Rick / Tsaban, Boaz / Capell, Enric Ventura

2 Issues per year


SCImago Journal Rank (SJR) 2015: 1.208
Source Normalized Impact per Paper (SNIP) 2015: 2.294
Impact per Publication (IPP) 2015: 1.103

Mathematical Citation Quotient (MCQ) 2015: 0.48

Online
ISSN
1869-6104
See all formats and pricing

The Latin squares and the secret sharing schemes

Chi Sing Chum
  • Computer Science Department, Graduate Center, CUNY, 365 Fifth Ave., New York, NY 10016, USA. E-mail:
  • :
/ Xiaowen Zhang
  • Computer Science Department, College of Staten Island, CUNY, 2800 Victory Blvd, Staten Island, NY 10314, USA. E-mail:
  • :
Published Online: 2010-09-09 | DOI: https://doi.org/10.1515/gcc.2010.011

Abstract

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.

Keywords.: Secret sharing scheme; Latin square; partial Latin square; critical set; hash functions; herding and Nostradamus attack


Received: 2010-06-22

Published Online: 2010-09-09

Published in Print: 2010-12-01


Citation Information: Groups – Complexity – Cryptology. Volume 2, Issue 2, Pages 175–202, ISSN (Online) 1869-6104, ISSN (Print) 1867-1144, DOI: https://doi.org/10.1515/gcc.2010.011, September 2010

Citing Articles

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.

[1]
Rebecca J. Stones, Ming Su, Xiaoguang Liu, Gang Wang, and Sheng Lin
Designs, Codes and Cryptography, 2015

Comments (0)

Please log in or register to comment.