DocumentCode :
3030141
Title :
Unconditionally secure multi-secret sharing scheme
Author :
Lin, Changlu ; Harn, Lein
Author_Institution :
Key Lab. of Network Security & Cryptology, Fujian Normal Univ., Fuzhou, China
Volume :
1
fYear :
2012
fDate :
25-27 May 2012
Firstpage :
169
Lastpage :
172
Abstract :
In Shamir´s (t, n) secret sharing (SS) scheme, a master secrets is divided into n shares by a dealer and is shared among n shareholders in such a way that any t or more than t shares can reconstruct this master secret; but fewer than t shares cannot obtain any information about the master secret s. Although Shamir´s scheme is unconditionally secure, it unfortunately requires a large data expansion (i.e., t shares are needed to reclaim one secret). Therefore, Shamir´s scheme is inefficient as a conveyor of information. Multi-secret sharing (MSS) scheme, which allows multiple master secrets to be shared among shareholders, has been proposed to improve the efficiency of Shamir´s scheme. However, all existing MSS schemes are computationally secure. In this paper, we propose an unconditionally secure MSS scheme based on Shamir´s scheme. Our proposed MSS scheme allows each shareholder to keep only one private share and uses it to share t master secrets.
Keywords :
cryptography; polynomials; Shamir secret sharing scheme; cryptographic keys; data expansion; linear polynomial; master secret; private share; unconditionally secure MSS scheme; unconditionally secure multisecret sharing scheme; Additives; Computers; Cryptography; Interpolation; Polynomials; Protocols; Secret sharing; multi-secret sharing; secret sharing homomorphism; unconditional security;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Science and Automation Engineering (CSAE), 2012 IEEE International Conference on
Conference_Location :
Zhangjiajie
Print_ISBN :
978-1-4673-0088-9
Type :
conf
DOI :
10.1109/CSAE.2012.6272572
Filename :
6272572
Link To Document :
بازگشت