Open AccessComments on ‘Fair ( t, n ) threshold secret sharing scheme’
Author(s) -
Harn Lein
Publication year - 2014
Publication title -
iet information security
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.308
H-Index - 34
eISSN - 1751-8717
pISSN - 1751-8709
DOI - 10.1049/iet-ifs.2013.0302
Subject(s) - secret sharing , scheme (mathematics) , homomorphic secret sharing , computer science , mathematics , verifiable secret sharing , cryptography , algorithm , mathematical analysis , set (abstract data type) , programming language
Tian et al . have proposed a fair ( t , n ) threshold secret sharing scheme recently. Three attacks have been introduced and analysed in this study. Among them, two attacks are associated with a synchronous network where the shares are released simultaneously, and one attack is associated with an asynchronous network where the shares are released asynchronously. In this study, the authors want to point out that the scheme only works properly in a synchronous network; but not in an asynchronous network. In other words, Theorem 3 in their paper which was associated with the attack in an asynchronous network is incorrect.