Integer linear programming heuristics that exploit a relationship between computational complexity and bandwidth

1985 ◽  
Author(s):  
Loren Platzman ◽  
Jane Ammons ◽  
John Bartholdi
Keyword(s):  
Linear Programming ◽  
Computational Complexity ◽  
Integer Linear Programming

scholarly journals An Intragroup and Intergroup Multiple Secret Images’ Sharing Scheme with Each Participant Holding One Shadow Image

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Jiayu Wang ◽  
Xuehu Yan ◽  
Jia Chen ◽  
Yongqiang Yu
Keyword(s):  
Linear Programming ◽  
Computational Complexity ◽  
Theoretical Analysis ◽  
Integer Linear Programming ◽  
Secret Sharing ◽  
Shadow Image ◽  
Low Computational Complexity ◽  
Polynomial Coefficients ◽  
Sharing Scheme ◽  
Multiple Secret Images

In some particular situations, participants need to recover different secrets both within a group (i.e., intragroup) and between two groups (i.e., intergroup). However, most of the existing multilevel secret sharing (MLSS) and multigroup secret sharing (MGSS) schemes mainly focus on how to protect a secret between one or more groups. In this paper, we propose a polynomial-based scheme to share multiple secret images both within a group and between groups. The random elements’ utilization model of integer linear programming is used to find polynomial coefficients that meet certain conditions so that each participant holds only one shadow image and some of them can recover secrets of both intergroup and intragroup. In addition, our scheme based on polynomials has the advantage of low computational complexity. Theoretical analysis and experiments show that the proposed scheme is feasible and effective.

Sign in / Sign up

Export Citation Format

Share Document