Title: Scalable shares generation to increase participants of counting-based secret sharing technique

Authors: Taghreed M. Alkhodaidi; Adnan A. Gutub

Addresses: Computer Science Department at Al-Qunfudhah, College of Computing, Umm Al-Qura University, Al-Qunfudhah, Saudi Arabia ' Computer Engineering Department, College of Computers and Information Systems, Umm Al-Qura University, Makkah, Saudi Arabia

Abstract: Secret sharing scheme is one of the efficient methods which offer secret information protection against unauthorised persons. This scheme formed by some share keys that can share access the secret key using their share keys at the same time. Many techniques of information security and secret sharing have been developing over the last years. This research focuses on the counting-based secret sharing scheme. This work introduces a new algorithm to improve the generation of share keys by increasing the size of the secret key for generating an unlimited number of share keys. We achieved that by expanding the size of the secret key and repeating its value. The paper shows interesting results as analysis and comparisons among the proposed expansion options of the secret key.

Keywords: secret sharing; secret key; share key; information security; generation; shares generation.

DOI: 10.1504/IJICS.2022.121294

International Journal of Information and Computer Security, 2022 Vol.17 No.1/2, pp.119 - 146

Received: 07 Sep 2018
Accepted: 01 Mar 2019
Published online: 04 Mar 2022 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article