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

Jun Shao; Zhenfu Cao

doi:10.1016/j.amc.2004.08.023

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

Jun Shao^*, Zhenfu Cao

^*Corresponding author for this work

Shanghai Jiao Tong University

Research output: Contribution to journal › Article › peer-review

89 Scopus citations

Abstract

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.

Original language	English
Pages (from-to)	135-140
Number of pages	6
Journal	Applied Mathematics and Computation
Volume	168
Issue number	1
DOIs	https://doi.org/10.1016/j.amc.2004.08.023
State	Published - 1 Sep 2005
Externally published	Yes

Keywords

Cryptography
Multi-secret sharing
Threshold scheme

Access to Document

10.1016/j.amc.2004.08.023

Cite this

@article{d1af5920354e48249cad5dda5a747623,

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

abstract = "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.",

keywords = "Cryptography, Multi-secret sharing, Threshold scheme",

author = "Jun Shao and Zhenfu Cao",

year = "2005",

month = sep,

day = "1",

doi = "10.1016/j.amc.2004.08.023",

language = "英语",

volume = "168",

pages = "135--140",

journal = "Applied Mathematics and Computation",

issn = "0096-3003",

publisher = "Elsevier Inc.",

number = "1",

}

TY - JOUR

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

AU - Shao, Jun

AU - Cao, Zhenfu

PY - 2005/9/1

Y1 - 2005/9/1

N2 - 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.

AB - 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.

KW - Cryptography

KW - Multi-secret sharing

KW - Threshold scheme

UR - https://www.scopus.com/pages/publications/25644460988

U2 - 10.1016/j.amc.2004.08.023

DO - 10.1016/j.amc.2004.08.023

M3 - 文章

AN - SCOPUS:25644460988

SN - 0096-3003

VL - 168

SP - 135

EP - 140

JO - Applied Mathematics and Computation

JF - Applied Mathematics and Computation

IS - 1

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this