Abstract
In a verifiable multi-secret sharing (VMSS) scheme, multiple secrets are shared among participants during one sharing process in such a way that some qualified subsets of them can recover these secrets. Verifiable property means that one participant may verify his/her own share, but cannot check the validity of the other participants' shares. Verifiable property is deficient for some specific applications such as electronic voting and revocable electronic cash. Publicly verifiable property is more applicable than verifiable property because the shares can be verified by any party. In this study, an efficient publicly verifiable multi-secret sharing (PVMSS) scheme using bilinear pairings is proposed. Under the computational Diffie-Hellman and modified bilinear Diffie-Hellman assumptions, the authors demonstrate that the proposed scheme is a secure PVMSS scheme.
| Original language | English |
|---|---|
| Pages (from-to) | 239-246 |
| Number of pages | 8 |
| Journal | IET Information Security |
| Volume | 7 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 2013 Sep 9 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Software
- Information Systems
- Computer Networks and Communications
Cite this
}
Publicly verifiable multi-secret sharing scheme from bilinear pairings. / Wu, Tsu Yang; Tseng, Yuh-Min.
In: IET Information Security, Vol. 7, No. 3, 09.09.2013, p. 239-246.Research output: Contribution to journal › Article
TY - JOUR
T1 - Publicly verifiable multi-secret sharing scheme from bilinear pairings
AU - Wu, Tsu Yang
AU - Tseng, Yuh-Min
PY - 2013/9/9
Y1 - 2013/9/9
N2 - In a verifiable multi-secret sharing (VMSS) scheme, multiple secrets are shared among participants during one sharing process in such a way that some qualified subsets of them can recover these secrets. Verifiable property means that one participant may verify his/her own share, but cannot check the validity of the other participants' shares. Verifiable property is deficient for some specific applications such as electronic voting and revocable electronic cash. Publicly verifiable property is more applicable than verifiable property because the shares can be verified by any party. In this study, an efficient publicly verifiable multi-secret sharing (PVMSS) scheme using bilinear pairings is proposed. Under the computational Diffie-Hellman and modified bilinear Diffie-Hellman assumptions, the authors demonstrate that the proposed scheme is a secure PVMSS scheme.
AB - In a verifiable multi-secret sharing (VMSS) scheme, multiple secrets are shared among participants during one sharing process in such a way that some qualified subsets of them can recover these secrets. Verifiable property means that one participant may verify his/her own share, but cannot check the validity of the other participants' shares. Verifiable property is deficient for some specific applications such as electronic voting and revocable electronic cash. Publicly verifiable property is more applicable than verifiable property because the shares can be verified by any party. In this study, an efficient publicly verifiable multi-secret sharing (PVMSS) scheme using bilinear pairings is proposed. Under the computational Diffie-Hellman and modified bilinear Diffie-Hellman assumptions, the authors demonstrate that the proposed scheme is a secure PVMSS scheme.
UR - http://www.scopus.com/inward/record.url?scp=84883433659&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84883433659&partnerID=8YFLogxK
U2 - 10.1049/iet-ifs.2012.0105
DO - 10.1049/iet-ifs.2012.0105
M3 - Article
AN - SCOPUS:84883433659
VL - 7
SP - 239
EP - 246
JO - IET Information Security
JF - IET Information Security
SN - 1751-8709
IS - 3
ER -