|Table of Contents|

Protocol for Member Expansion in Publicly Verifiable Secret Sharing Scheme

《南京理工大学学报》(自然科学版)[ISSN:1005-9830/CN:32-1397/N]

Issue:
2009年02期
Page:
161-164
Research Field:
Publishing date:

Info

Title:
Protocol for Member Expansion in Publicly Verifiable Secret Sharing Scheme
Author(s):
XU Chun-gen1YANG Yan-jiong2
1.School of Sciences;2.Zijin College,NUST,Nanjing 210046,China
Keywords:
secret sharing public verification member expansion
PACS:
TN918
DOI:
-
Abstract:
Based on Schoenmakers’s publicly verifiable secret sharing schemes,a publicly verifiable secret sharing scheme is proposed for member expansion.In this scheme,not only the shareholder himself but also everybody can verify the correctness of his share.The old shareholders needn’t change their share and the main share.Compared with other schemes,this scheme is more efficient,secure and useable,and doesn’t need to have the security channel in the process of the distributing share.

References:

[ 1] Sham irA. H ow to share a secret[ J]. Commun ications o f theACM, 1979, 22( 11): 612- 613.
[ 2] B lak ley G R. Sa feguaring cryptograph ic keys [ A ]. Proceed ing of AFIPS Nationa l Com puter Conference [ C]. N ew York: AFIPS Press, 1979. 313- 317.
[ 3] Chor B, Goldw asse r S, M icali S, et a.l Verifiab le secret shar ing and ach iev ing simu ltane ity in the presence o f faults[ A ]. Proceed ings of 26 IEEE Sym po sium on Foundations o f Com puter Sc ience [ C ]. W ash ington: IEEE Com puter Soc iety, 1985. 383- 395.
[ 4] StadlerM. Pub licly ver ifiab le secret sharing[ A ]. Advances in Cryptology-EURO-CRYPT. 96 [ C ]. Be rlin: Spr ing er-Ve rlag, 1996. 190- 199.
[ 5] Fujisak i E, Okam oto T. A prac tica l and provably secure schem e fo r pub lic ly ver ifiable secret shar ing and its app lication [ A ]. EUROCRYPT. 98 [ C ]. Be rlin: Spr ing er-Ve rlag, 1996. 32- 46.
[ 6] Schoenmakers B. A s imp le public ly verifiab le secret shar ing schem e and its applica tion to electronic voting [ A]. Proceed ing o f Advances in C rypto logy-C rypto. 99 [ C]. Be rlin: Spr inge r-Ver lag, 1999. 148- 164.
[ 7] Yu Jia, Kong Fanyu, H ao Rong. Pub lic ly ver ifiable secret shar ing w ith enro llm ent ab ility [ A ] . So ftware Eng ineer ing, Artific ial Intelligence, Netw ork ing, and Paralle l/Distr ibuted Computing 2007, E ighth AC IS Interna tiona l Conference [ C ]. Q ingdao, Ch ina: IEEE Compu ter Soc iety, 2007. 194- 199.
[ 8] 李慧贤, 程春田, 庞辽军. 一个可验证的秘密共享新个体加入协议[ J]. 西安交通大学学报, 2006, 40 ( 2): 207- 210.
[ 9] 于佳, 李国文, 郝蓉, 等. 一个实用的门限方案成员加入协议[ J]. 北京邮电大学学报, 2006, 29( z2) : 2 - 4.
[ 10] Dong P, Lu X H, Lu X C. A non- interac tive pro toco l fo rm em be r expansion in a secre t shar ing schem e[ J]. Journa l o f So ftwa re, 2005, 16( 1): 116- 120.

Memo

Memo:
-
Last Update: 2012-11-19