Publicly verifiable multi‐secret sharing scheme from bilinear pairings. Issue 3 (1st September 2013)

• Record Type: Journal Article
• Authors: Wu, Tsu‐Yang; Tseng, Yuh‐Min
• Is Part Of: IET information security. Volume 7:Issue 3(2013)
• Page Start: 239
• Page End: 246
• Publication Date: 2013-09-01
• Subjects: cryptography; publicly verifiable multisecret sharing scheme -- bilinear pairings -- VMSS scheme -- electronic voting -- revocable electronic cash -- computational Diffie‐Hellman assumptions -- modified bilinear Diffie‐Hellman assumptions -- cryptography; Computer security -- Periodicals; Cryptography -- Periodicals; Computer networks -- Security measures -- Periodicals; Database security -- Periodicals; 005.8
• DOI: 10.1049/iet-ifs.2012.0105
• Languages: English
• ISSNs: 1751-8709

Abstract

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.