Two polynomials based (t, n) threshold secret sharing scheme with cheating detection. Issue 4 (3rd July 2020)

• Record Type: Journal Article
• Authors: Biswas, Anindya Kumar; Dasgupta, Mou
• Is Part Of: Cryptologia. Volume 44:Issue 4(2020)
• Page Start: 357
• Page End: 370
• Publication Date: 2020-07-03
• Subjects: secret sharing scheme -- Lagrange polynomial interpolation -- secret shares' cheating and detection -- modular arithmetic -- finite cyclic group; Cryptography -- Periodicals; 652.8
• DOI: 10.1080/01611194.2020.1717676
• Languages: English
• ISSNs: 0161-1194

Abstract

Abstract: A two-polynomial based ( t, n ) threshold secret sharing (SS) scheme is proposed by Liu et al., where two functions for detection of share cheating are used. It is found that the scheme is weak as the equations formed by at most ( t – 1) dishonest participants in term of unknowns are not equivalent to the cheating detection function, and if one polynomial is kept fixed and other with two cheating detection equations are taken, a set of ( t + 1 ) equations with ( t + 1 ) unknowns exist, and are found to be easily solvable. In this paper, we also propose a two-polynomial based ( t, n ) threshold SS scheme; however, the polynomials are taken in such a way that they have an arbitrary common coefficient and as a result, both the polynomials are to be modified simultaneously for cheating of shares and incorporates higher cheating detection capability. Some analytical proofs and comparison with other schemes in support of our claims are provided.