1. On ideal and weakly-ideal access structures
- Author
-
Shahram Khazaei, Maghsoud Parviz, and Reza Kaboli
- Subjects
Discrete mathematics ,Class (set theory) ,Algebra and Number Theory ,Ideal (set theory) ,Computer Networks and Communications ,Statement (logic) ,Applied Mathematics ,Open problem ,020206 networking & telecommunications ,0102 computer and information sciences ,02 engineering and technology ,01 natural sciences ,Microbiology ,Secret sharing ,Matroid ,010201 computation theory & mathematics ,0202 electrical engineering, electronic engineering, information engineering ,Discrete Mathematics and Combinatorics ,Mathematics ,Access structure - Abstract
For more than two decades, proving or refuting the following statement has remained a challenging open problem in the theory of secret sharing schemes (SSSs): every ideal access structure admits an ideal perfect multi-linear SSS. The class of group-characterizable (GC) SSSs include the multi-linear ones. Hence, if the above statement is true, then so is the following weaker statement: every ideal access structure admits an ideal perfect GC SSS. One contribution of this paper is to show that ideal SSSs are not necessarily GC. Our second contribution is to study the above two statements with respect to several variations of weakly-ideal access structures. Recently, Mejia and Montoya studied ideal access structures that admit ideal multi-linear schemes and provided a classification-like theorem for them. We additionally present some tools that are useful to extend their result.
- Published
- 2023