A Dynamic Multi-Secret Sharing Scheme with Cheater Detection using Recursive Bivariate Polynomials
TL;DR
A new, effective, and scalable secret sharing algorithm which is derived using recursive symmetric bivariate polynomial equations, which is extremely applicable in cloud computing, secure multi-party computation, and zero-trust environment.
Abstract
Secret sharing is a vital task in protecting a sensitive information over distributed systems since a portion of a secret is split into at least two or more parts so that only specific group of participants can recreate the original information. Classical schemes such as those of Shamir provide good mathematical underpinnings, but cannot support more modern security requirements such as dynamic group structures, multi-secret management and resistance to cheaters, whose features are becoming important in modern security designs. In this paper, we develop a new, effective, and scalable secret sharing algorithm which is derived using recursive symmetric bivariate polynomial equations. The scheme is proposed to facilitate dynamic (k, n) thresholds, multi-secret encoding, cheater detection and efficient memory utilization. The system guarantees robust reconstruction even in adversarial conditions, using a recursive polynomial structure and dual-level interpolation. The experimental performance proves to be highly efficient, consuming low resources, with accuracy in identifying a cheater hence this method is extremely applicable in cloud computing, secure multi-party computation, and zero-trust environment.