Linear threshold verifiable secret sharing in bilinear groups. (1st January 2013)

• Record Type: Journal Article
• Authors: Zhang, Jie; Zhang, Futai
• Is Part Of: International journal of grid and utility computing. Volume 4:Number 2/3(2013)
• Page Start: 212
• Page End: 218
• Publication Date: 2013-01-01
• Subjects: bilinear groups -- verifiable secret sharing -- linear verifiable secret sharing; Electronic data processing -- Distributed processing -- Periodicals; Electronic commerce -- Management -- Computer programs -- Periodicals; 004.605
• Languages: English
• ISSNs: 1741-847X

Abstract

In many pairing-based cryptosystems, the secret keys are elements of bilinear groups. For safeguarding such secret keys or decrypting or signing in a threshold manner, Verifiable Secret Sharing (VSS) in bilinear groups is required. In this paper, we show a method of verifiably sharing a random secret in a bilinear group. Our method is simple and practical. It can be regarded as a generalisation of threshold linear VSS in finite fields to the case when the secrets are in bilinear groups. We present a general scheme for verifiably sharing secrets in bilinear groups. A modified version of our general scheme with improved efficiency is also introduced.