A secure and efficient ( t, n ) multi-secret sharing scheme |
| |
Authors: | Pang Liao-jun and Wang Yu-min |
| |
Affiliation: | (1) State Key Laboratory on Integrated Services Networks, Xidian University, 710071 Xi'an Shaanxi, China |
| |
Abstract: | Based on Shamir's secret sharing, a (t, n) multi-secret sharing scheme is proposed in this paper.p secrets can be shared amongn participants, andt or more participants can co-operate to reconstruct these secrets at the same time, butt−1 or fewer participants can derive nothing about these secrets. Each participant's secret shadow is as short as each secret. Compared with the existing schemes, the proposed scheme is characterized by the lower complexity of the secret reconstruction and less public information. The security of this scheme is the same as that of Shamir's threshold scheme. Analyses show that this scheme is an efficient, computationally secure scheme. Foundation item: Supported by the Special Funds for Major State Basic Research Program of China (973 Program) (G19990358-04) Biography: PANG Liao-jun(1978-), male, Ph. D candidate, research direction: Internet security, cryptography, secure mobile agent system and e-commerce security technology. |
| |
Keywords: | cryptosystem threshold scheme secret sharing |
本文献已被 SpringerLink 等数据库收录! |
|