Title :
A New (t,n)-Threshold Secret Sharing Scheme
Author :
Tang, Chunming ; Yao, Zheng-an
Author_Institution :
Sch. of Math. & Inf. Sci., Guangzhou Univ., Guangzhou
Abstract :
In a traditional (t,n)-threshold secret sharing scheme, the secret key K can be shared only one time for this reason that one of participants, who participates in reconstruction of K, may be dishonest and probably leaks K. In this paper, based on multiprover zero-knowledge arguments and secure multiparty computation protocol, we will construct a (t,n)-threshold secret sharing scheme in which the secret key K will be shared forever if at most t-1 participants are dishonest and discrete logarithm problem is hard.
Keywords :
cryptographic protocols; private key cryptography; discrete logarithm problem; multiprover zero-knowledge argument; secure multiparty computation protocol; threshold secret sharing scheme; Cryptographic protocols; Cryptography; Information science; Information security; Laboratories; Mathematics; Polynomials; Privacy; Sliding mode control; Time sharing computer systems; Cryptography; multi-prover zero-knowledge; secret sharing; secure multi-party computation;
Conference_Titel :
Advanced Computer Theory and Engineering, 2008. ICACTE '08. International Conference on
Conference_Location :
Phuket
Print_ISBN :
978-0-7695-3489-3
DOI :
10.1109/ICACTE.2008.139
