Verifiable secret sharing schemes based on non-homogeneous linear recursions and elliptic curves

被引：20

作者：

Dehkordi, Massoud Hadian ^{[1
]}

Mashhadi, Samaneh ^{[1
]}

机构：

[1] Iran Univ Sci & Technol, Dept Math, Tehran, Iran

来源：

COMPUTER COMMUNICATIONS | 2008年 / 31卷 / 09期

关键词：

multi-secret sharing; ECRSA cryptosystem; ECDLP; non-homogeneous linear recursion; secure channel;

D O I：

10.1016/j.comcom.2007.11.014

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper, we propose two secure verifiable multi-secret sharing schemes that are based on non-homogeneous linear recursions and elliptic curves over Z(N). Such schemes have simple construction and verification phases. Moreover these have various techniques for the reconstruction phase. The security of the proposed schemes is based on the security of the ECRSA cryptosystem and the intractability of the ECDLP. (C) 2007 Elsevier B.V. All rights reserved.

引用

页码：1777 / 1784

页数：8

共 13 条

[1]

[Anonymous], 2002, CRYPTOGRAPHY THEORY

[2]

Biggs N. L., 1989, DISCRETE MATH

[3]

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

[4]

CHOR B, 1985, P 26 IEEE S FDN COMP, P251

[5]

DEHKORDI MH, EFFICIENT THRESHOLD

[6]

FELDMAN P, 1987, P 28 IEEE S FDN COMP

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

HARN, L .

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

[8] An on-line secret sharing scheme for multi-secrets [J].

Hwang, RJ ;

Chang, CC .

COMPUTER COMMUNICATIONS, 1998, 21 (13) :1170-1176

[9]

KOYAMA K, 1992, LECT NOTES COMPUT SC, V576, P252

[10] A new efficient (t, n) verifiable multi-secret sharing (VMSS) based on YCH scheme [J].

Shao, J ;

Cao, ZF .

APPLIED MATHEMATICS AND COMPUTATION, 2005, 168 (01) :135-140

← 1 2 →