Linear multi-secret sharing schemes  

作　　者：XlAOLiangliang LIUMulan 

机构地区：[1]AcademyofMathematicsandSystemSciencesandKeyLaboratoryofMathematicsMechanization,ChineseAcademyofSciences,Beijing100080,China

出　　处：《Science in China(Series F)》2005年第1期125-136,共12页中国科学（F辑英文版）

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

摘　　要：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.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.

关 键 词：multi-secret sharing scheme linear multi-secret sharing scheme monotone span program optimal linear multi-secret sharing scheme. 

分 类 号：TN918[电子电信—通信与信息系统]