Authors: Jie Zhang; Futai Zhang
Addresses: School of Computer Science and Technology, Nanjing Normal University, Nangjing 210023, China ' School of Computer Science and Technology, Nanjing Normal University, Nangjing 210023, China
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.
Keywords: bilinear groups; linear threshold; verifiable secret sharing; pairing-based cryptosystems; cryptography; secret keys; security.
International Journal of Grid and Utility Computing, 2013 Vol.4 No.2/3, pp.212 - 218
Received: 20 Aug 2012
Accepted: 23 Sep 2012
Published online: 01 Sep 2013 *