Secure Shares Generation via M-Blocks Partitioning for Counting-Based Secret Sharing

Abstract

Counting-based secret sharing is presented recently as a promising approach serving multi-user authentication applications. The scheme originally generates its shares via simple flipping of one or two 0-bits within the entire secret key at various locations. Reconstructing the secret key combines chosen shares, based on (n,k) threshold, in parallel specific counting to recover back the secret key. This paper proposes modifying the shares generation process, for security enhancement, by dividing the secret key into blocks. Each block involves flipping specific bits simultaneously, generating ambiguous shares improving the access system security. The proposed blocks flipping shares methods is implemented in different 64-bits models via fair testing Java platform. Experimentations showed interesting comparisons results providing remarkable secure contributions. The work can be considered an opening applicability direction for further attractive research in improving the counting-based secret sharing technique.