Title: Generalised secret sharing scheme for non-monotone access structures using MDS codes

Authors: Shiva Krishna Nallabothu; N. Rukma Rekha; Y.V. Subba Rao

Addresses: School of Computer and Information Sciences, University of Hyderabad, Hyderabad, Telangana, India ' School of Computer and Information Sciences, University of Hyderabad, Hyderabad, Telangana, India ' School of Computer and Information Sciences, University of Hyderabad, Hyderabad, Telangana, India

Abstract: A secret sharing scheme is a powerful tool for protecting sensitive data with applications in access control, key management schemes, blockchains, etc. A generalised secret sharing scheme realises any access structure that satisfies the monotone property. Such schemes are not practical to implement. A strict generalised scheme realises a general access structure that is non-monotone. We propose an efficient strict generalised secret sharing scheme based on maximum distance separable codes. The novelty of this scheme is that it allows new authorised subsets and participants to be added without modifying the shares of the existing participants and the time complexity of the proposed scheme is independent of the number of participants. Participants' shares can be chosen independently of the secret. The proposed scheme is ideal. This paper also carries out the proposed scheme's correctness, security, and complexity analysis.

Keywords: secret sharing scheme; SSS; generalised access structure; non-monotone access structure; ideal scheme; MDS codes.

DOI: 10.1504/IJSN.2024.140289

International Journal of Security and Networks, 2024 Vol.19 No.2, pp.101 - 108

Received: 21 Dec 2023
Accepted: 12 Apr 2024
Published online: 01 Aug 2024 *

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