Linear multi-secret sharing schemes

作     者：XlAOLiangliang LIUMulan 

作者机构：AcademyofMathematicsandSystemSciencesandKeyLaboratoryofMathematicsMechanizationChineseAcademyofSciencesBeijing100080China 

出 版 物：《Science in China(Series F)》 (中国科学（F辑英文版）)

年 卷 期：2005年第48卷第1期

页      面：125-136页

核心收录：

学科分类：11[军事学] 1105[军事学-军队指挥学] 0839[工学-网络空间安全] 08[工学] 110505[军事学-密码学] 110503[军事学-军事通信学] 

基　　金：supported by the National Natural Science Foundation of China(Grant Nos.60083002 90304012 2004CB318000) 

主　　题：multi-secret sharing scheme linear multi-secret sharing scheme monotone span program optimal linear multi-secret sharing scheme. 

摘      要：In this paper the linear multi-secret sharing schemes are studied by using monotone span programs. A relation between computing monotone Boolean functions by using monotone span programs and realizing multi-access structures by using linear multi-secret sharing schemes is shown. Furthermore, the concept of optimal linear multi-secret sharing scheme is presented and the several schemes are proved to be optimal.