Academy of Mathematics and System Sciences and Key Laboratory of Mathematics Mechanization, Chinese Academy of Sciences, Beijing 100080, China
Abstract:
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.
