A new efficient (t, n) verifiable multi-secret sharing (VMSS) based on YCH scheme

被引：66

作者：

Shao, J ^{[1
]}

Cao, ZF ^{[1
]}

机构：

[1] Shanghai Jiao Tong Univ, Dept Comp Sci & Engn, Shanghai 200030, Peoples R China

来源：

APPLIED MATHEMATICS AND COMPUTATION | 2005年 / 168卷 / 01期

基金：

中国国家自然科学基金; 高等学校博士学科点专项科研基金;

关键词：

cryptography; threshold scheme; multi-secret sharing;

D O I：

10.1016/j.amc.2004.08.023

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

A verifiable multi-secret sharing scheme (VMSS) is a multi-secret sharing scheme with the verifiable property. This paper presents a new efficient verifiable multi-secret sharing based on YCH [C.-C. Yang, T.-Y. Chang, M.-S. Hwang, A (t,n) multi-secret sharing scheme, Appl. Math. Comput. 151 (2004) 483-490] scheme and the intractability of the discrete logarithm (DL). And it just needs few public values and low modular exponentiation operation. (c) 2004 Elsevier Inc. All rights reserved.

引用

页码：135 / 140

页数：6

共 8 条

[1]

[Anonymous], 1979, P AFIPS NAT COMP C N

[2]

Chen L., 1997, P 2 AUSTR C INF SEC

[3]

Chien HY, 2000, IEICE T FUND ELECTR, VE83A, P2762

[4]

Chor B., 1985, P 26 IEEE S FDN COMP

[5]

FELDMAN P, 1987, P 28 IEEE S FDN COMP

[6] EFFICIENT SHARING (BROADCASTING) OF MULTIPLE SECRETS [J].

HARN, L .

IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 1995, 142 (03) :237-240

[7] HOW TO SHARE A SECRET [J].

SHAMIR, A .

COMMUNICATIONS OF THE ACM, 1979, 22 (11) :612-613

[8] A (t, n) multi-secret sharing scheme [J].

Yang, CC ;

Chang, TY ;

Hwang, MS .

APPLIED MATHEMATICS AND COMPUTATION, 2004, 151 (02) :483-490

← 1 →