A pairing-based publicly verifiable secret sharing scheme

Tsu Yang Wu, Yuh-Min Tseng

Research output: Contribution to journalArticle

22 Citations (Scopus)

Abstract

A publicly verifiable secret sharing (PVSS) scheme is a verifiable secret sharing scheme with the special property that anyone is able to verify the shares whether they are correctly distributed by a dealer. PVSS plays an important role in many applications such as electronic voting, payment systems with revocable anonymity, and key escrow. Up to now, all PVSS schemes are based on the traditional public-key systems. Recently, the pairing-based cryptography has received much attention from cryptographic researchers. Many pairing-based schemes and protocols have been proposed. However, no PVSS scheme using bilinear pairings is proposed. This paper presents the first pairing-based PVSS scheme. In the random oracle model and under the bilinear Diffie-Hellman assumption, the authors prove that the proposed scheme is a secure PVSS scheme.

Original languageEnglish
Pages (from-to)186-194
Number of pages9
JournalJournal of Systems Science and Complexity
Volume24
Issue number1
DOIs
Publication statusPublished - 2011 Feb 1

Fingerprint

Cryptography

All Science Journal Classification (ASJC) codes

  • Computer Science (miscellaneous)
  • Information Systems

Cite this

@article{905fc6423acf43d7a2956c967bf18dc4,
title = "A pairing-based publicly verifiable secret sharing scheme",
abstract = "A publicly verifiable secret sharing (PVSS) scheme is a verifiable secret sharing scheme with the special property that anyone is able to verify the shares whether they are correctly distributed by a dealer. PVSS plays an important role in many applications such as electronic voting, payment systems with revocable anonymity, and key escrow. Up to now, all PVSS schemes are based on the traditional public-key systems. Recently, the pairing-based cryptography has received much attention from cryptographic researchers. Many pairing-based schemes and protocols have been proposed. However, no PVSS scheme using bilinear pairings is proposed. This paper presents the first pairing-based PVSS scheme. In the random oracle model and under the bilinear Diffie-Hellman assumption, the authors prove that the proposed scheme is a secure PVSS scheme.",
author = "Wu, {Tsu Yang} and Yuh-Min Tseng",
year = "2011",
month = "2",
day = "1",
doi = "10.1007/s11424-011-8408-6",
language = "English",
volume = "24",
pages = "186--194",
journal = "Journal of Systems Science and Complexity",
issn = "1009-6124",
publisher = "Springer New York",
number = "1",

}

A pairing-based publicly verifiable secret sharing scheme. / Wu, Tsu Yang; Tseng, Yuh-Min.

In: Journal of Systems Science and Complexity, Vol. 24, No. 1, 01.02.2011, p. 186-194.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A pairing-based publicly verifiable secret sharing scheme

AU - Wu, Tsu Yang

AU - Tseng, Yuh-Min

PY - 2011/2/1

Y1 - 2011/2/1

N2 - A publicly verifiable secret sharing (PVSS) scheme is a verifiable secret sharing scheme with the special property that anyone is able to verify the shares whether they are correctly distributed by a dealer. PVSS plays an important role in many applications such as electronic voting, payment systems with revocable anonymity, and key escrow. Up to now, all PVSS schemes are based on the traditional public-key systems. Recently, the pairing-based cryptography has received much attention from cryptographic researchers. Many pairing-based schemes and protocols have been proposed. However, no PVSS scheme using bilinear pairings is proposed. This paper presents the first pairing-based PVSS scheme. In the random oracle model and under the bilinear Diffie-Hellman assumption, the authors prove that the proposed scheme is a secure PVSS scheme.

AB - A publicly verifiable secret sharing (PVSS) scheme is a verifiable secret sharing scheme with the special property that anyone is able to verify the shares whether they are correctly distributed by a dealer. PVSS plays an important role in many applications such as electronic voting, payment systems with revocable anonymity, and key escrow. Up to now, all PVSS schemes are based on the traditional public-key systems. Recently, the pairing-based cryptography has received much attention from cryptographic researchers. Many pairing-based schemes and protocols have been proposed. However, no PVSS scheme using bilinear pairings is proposed. This paper presents the first pairing-based PVSS scheme. In the random oracle model and under the bilinear Diffie-Hellman assumption, the authors prove that the proposed scheme is a secure PVSS scheme.

UR - http://www.scopus.com/inward/record.url?scp=79551705094&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79551705094&partnerID=8YFLogxK

U2 - 10.1007/s11424-011-8408-6

DO - 10.1007/s11424-011-8408-6

M3 - Article

VL - 24

SP - 186

EP - 194

JO - Journal of Systems Science and Complexity

JF - Journal of Systems Science and Complexity

SN - 1009-6124

IS - 1

ER -