• Home
  • Search
  • Generalised multi-secret sharing scheme for non-monotone access structures
  • https://doi.org/10.1504/ijics.2026.151307Copy DOI Icon

Generalised multi-secret sharing scheme for non-monotone access structures

Show More
  • Abstract
  • Literature Map
  • Similar Papers
Abstract

Generalised secret sharing (GSS) schemes for monotone access structures, which always grant access to larger sets, offer flexibility beyond threshold schemes. But often these schemes struggle with practical limitations and an inability to model complex real-world policies involving specific exclusions or conditional access based on the absence of certain participants. We propose a novel GSS scheme specifically designed for non-monotone access structures, enabling true fine-grained control for scenarios where exceptions or negative constraints are paramount. The proposed GSS scheme is then extended to a generalised multi-secret sharing (GMS) scheme, facilitating the secure and controlled distribution of multiple secrets under the non-monotone access structure. GSS and GMS schemes are constructed using maximum distance separable (MDS) codes and require one-way functions. The proposed schemes are ideal and computationally perfect. The correctness, complexity, and security analysis are also given.

Similar Papers
  • Conference Article
  • Citations8

Binary codes with large symbols

  • Jun 27, 1994
  • M Blaum +2
  • Research Article
  • Citations49

The Weights in MDS Codes

  • Jul 30, 2010
  • IEEE Transactions on Information Theory
  • Martianus Frederic Ezerman +2
  • Research Article
  • Citations1

On the weight distribution of the cosets of MDS codes

  • Jan 01, 2023
  • Advances in Mathematics of Communications
  • Alexander A Davydov +2
  • Book Chapter

Multiparameter Analysis for Distributed Storage Schemes in Wireless D2D Networks

  • Jan 01, 2019
  • Juan Li +4
  • Research Article

OPTIMAL INSDEL CODES FROM ALMOST MDS CODES

  • Feb 17, 2025
  • Bulletin of the Australian Mathematical Society
  • Jiahui Wang +1
  • Research Article
  • Citations18

Modulation Based on a Simple MDS Code: Achieving Better Error Performance Than Index Modulation and Related Schemes

  • Jan 01, 2022
  • IEEE Transactions on Communications
  • Ferhat Yarkin +1
  • Book Chapter
  • Citations1

Revisiting the Karnin, Greene and Hellman Bounds

  • Aug 10, 2008
  • Yvo Desmedt +2
  • Conference Article
  • Citations4

Probabilistic Caching Based on MDS Code in Cooperative Mobile Edge Caching Networks

  • Aug 01, 2020
  • Dongyeon Ko +1
  • Conference Article
  • Citations35

HV Code: An All-Around MDS Code to Improve Efficiency and Reliability of RAID-6 Systems

  • Jun 01, 2014
  • Zhirong Shen +1
  • Research Article
  • Citations186

Application of Classical Hermitian Self-Orthogonal MDS Codes to Quantum MDS Codes

  • Sep 01, 2010
  • IEEE Transactions on Information Theory
  • Lingfei Jin +3
  • Research Article

The twice-extended TGRS codes

  • Jan 01, 2026
  • Advances in Mathematics of Communications
  • Hongli Cheng +1
  • Research Article

Estimation for the number of MDS Matrices, Recursive MDS Matrices and Symmetric Recursive MDS Matrices from the Reed-Solomon Codes

  • Mar 18, 2023
  • Research and Development on Information and Communication Technology
  • Trần Thị Lượng
  • Conference Article
  • Citations1

Coded Distributed Graph-Based Semi-Supervised Learning

  • Nov 01, 2022
  • Ying Du +5
  • Research Article
  • Citations274

MDS array codes with independent parity symbols

  • Mar 01, 1996
  • IEEE Transactions on Information Theory
  • M Blaum +2
  • Research Article
  • Citations40

Reinforcement Learning Based Cooperative Coded Caching Under Dynamic Popularities in Ultra-Dense Networks

  • May 01, 2020
  • IEEE Transactions on Vehicular Technology
  • Shen Gao +3
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.