Open AccessHash function‐based secret sharing scheme designs
Author(s) -
Chum Chi Sing,
Zhang Xiaowen
Publication year - 2013
Publication title -
security and communication networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.446
H-Index - 43
eISSN - 1939-0122
pISSN - 1939-0114
DOI - 10.1002/sec.576
Subject(s) - hash function , computer science , verifiable secret sharing , secret sharing , hash chain , scheme (mathematics) , cryptographic hash function , set (abstract data type) , access structure , theoretical computer science , function (biology) , herding , ideal (ethics) , computer security , hash tree , cryptography , mathematics , law , programming language , mathematical analysis , evolutionary biology , political science , forestry , biology , geography
ABSTRACT Secret sharing schemes create an effective method to safeguard a secret by dividing it among several participants. By using hash functions and the herding hashes technique, we first set up a ( t + 1, n ) threshold scheme that is perfect and ideal and then extend it to schemes for any general access structure. The schemes can be further set up as proactive or verifiable if necessary. The setup and recovery of the secret are efficient because of the fast calculation of the hash function. The proposed scheme is flexible because of the use of existing hash functions. Copyright © 2012 John Wiley & Sons, Ltd.