Applying Hash Functions in the Latin Square Based Secret Sharing Schemes

Since the original secret sharing ideas of Shamir and Blakley a variety of schemes have been proposed. Among which the Latin square based secret sharing schemes were suggested by researchers in the 90s. However, the limitations of such schemes might be the culprit that hinders them from being widely accepted and adopted. In this paper we propose to apply cryptographic hash functions and herding attack technique to conquer these limitations in the hope of reviving the Latin square based schemes.