Cryptanalysis and Enhancement of Harn-Lin’s Secret Sharing Scheme with Cheating Detection
Anindya Kumar Biswas, Mou Dasgupta · 2020
Deployment of secrecy techniques is unquestionably necessitous for everyday communication over the unbarred and insecure network, as sensitive information craves bulwark from sliding into wrong whereabouts. Key negotiations using secret sharing methods, is an effectual and trenchant way to procure secrecy while transmitting information over the open internet. The secret keys so obtained, can be made use of, in encryption/decryption purposes. Methods like (t, n) threshold based, allow secret keys to be generated by combining split shares, where an individual split share have no value of its own. Existence of adversaries complicates matters by easily fooling honest participants. We identified unwanted features in Harn-Lin's secret sharing method, as extra participants/outsiders not belonging to a particular group, gets involved in secrecy reconstruction, a displeasing idiosyncrasy. Our proposed improvements over it for efficient threshold based secret sharing procedure with cheating detection is by effective inclusion of only a single extra share, however, from the dealer. Our work ensures outsiders do not mingle in group based secret key formations and also discuss ways to identify distinct cheaters.