An Ideal Multi-secret Sharing Scheme Based on Connectivity of Graphs

作者：Hsu, Ching Fang^*; Harn, Lein; Cui, Guohua

来源：Wireless Personal Communications, 2014, 77(1): 383-394.

DOI：10.1007/s11277-013-1511-3

• Secure communication
• Connectivity of graphs
• Ideal linear multi-secret sharing schemes
• Monotone span programs

Secure communication has become more and more important for many modern communication applications. In a secure communication, every pair of users need to have a secure communication channel (each channel is controlled by a server) In this paper, using monotone span programs we devise an ideal linear multi-secret sharing scheme based on connectivity of graphs. In our proposed scheme, we assume that every pair of users, and , use the secret key to communicate with each other and every server has a secret share such that a set of servers can recover if the channels controlled by the servers in this set can connect users, and . The multi-secret sharing scheme can provide efficiency for key management. We also prove that the proposed scheme satisfies the definition of a perfect multi-secret sharing scheme. Our proposed scheme is desirable for secure and efficient secure communications.

• 出版日期2014-7
• 单位华中师范大学