A secure and efficient secret sharing scheme with general access structures

Authors:
Liao-Jun Pang;Hui-Xian Li;Yu-Min Wang
Affiliations:
The Ministry of Edu. Key Lab. of Computer, Networks and Information Security, Xidian Univ., Xi'an, China;Department of Computer Science and Engineering, Dalian Univ. of Technology, Dalian, China;The Ministry of Edu. Key Lab. of Computer, Networks and Information Security, Xidian Univ., Xi'an, China
Venue:
FSKD'06 Proceedings of the Third international conference on Fuzzy Systems and Knowledge Discovery
Year:
2006

Citing 4
Cited 0

How to share a secret

Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Generalized Secret Sharing and Monotone Functions

CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Research note: An on-line secret sharing scheme for multi-secrets

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new secret sharing scheme with general access structures was proposed, which is based on Shamir's secret sharing scheme and the discrete logarithm problem. In this scheme, the dealer need not send any secret information to participants. And the shared secret, the participant set and the access structure can be changed dynamically without updating any participant's secret shadow. The degree of the used Lagrange interpolation polynomial is only one, which makes the computational complexity of the proposed scheme very low. The proposed scheme has advantages over the existing schemes and thus provides great capabilities for many applications.