A Muti-secret Sharing Scheme Based on Elliptic Curve

YU Zhao-ping · Jisuanji gongcheng · 2007

Based on elliptic curve,a new secret sharing scheme for general access structure is proposed.It is able to prevent adversaries from getting the secret and efficiently guard against cheating among participants.Each participant’s secret is selected by participant himself and the dealer need not deliver any secret information to each participant.The secret do not need to be changed when the shared secret is renewed,the access structure is altered,or participants added/deleted.This paper analyzes the security and efficiency of this scheme,and compares it with the scheme.

Read the paper · More papers on PaperTik