基于整数规划的一般访问结构秘密共享方案  

Secret Sharing Scheme with General Access Structure Based on Integer Programming

作　　者：解扬 苗付友[1] 白建峰 XIE Yang;MIAO Fuyou;BAI Jianfeng(School of Computer Science and Technology,University of Science and Technology of China,Hefei 230027,China)

机构地区：[1]中国科学技术大学计算机科学与技术学院

出　　处：《计算机工程》2019年第6期165-170,共6页Computer Engineering

基　　金：国家自然科学基金(61572454,61572453)

摘　　要：在利用整数规划实现一般访问结构的秘密共享时,为简化访问结构、保证所有的整数规划都有解,提出一种将整数规划以直接构造的方式应用于一般访问结构秘密共享的方案。通过构建整数规划将秘密隐藏于目标函数的解中,并将约束条件作为秘密份额发送给参与者。参与者可通过共享秘密份额重构整数规划,并利用解方程组的方法找到目标函数的正确解,以恢复秘密。分析结果表明,与借助(t,n)门限的方案相比,该方案能实现所有的访问结构,无须采用传统方式求解整数规划和推导最大拒绝集,降低了计算复杂度。In order to simplify the access structure and ensure that all integer programming have solutions,a scheme is proposed to apply integer programming directly to the secret sharing of general access structure.By constructing integer programming,the secret is hidden in the solution to the objective function,and the constraint condition is sent to the participants as the secret share.Participants can use their shares to reconstruct the integer programming problem,and get the correct solution to the objective function quickly by the method of solving equations,and then the secret is recovered.Analysis results show that,compared with the scheme using (t,n) threshold,this scheme can achieve all the access structures.It doesn’t need to solve integer programming with the classical method or deduce the maximal unauthorized subsets,which reduce its computational complexity.

关 键 词：整数规划 向量空间 一般访问结构 秘密共享 目标函数 约束条件 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]