Efficient and Information-Theoretical Secure Verifiable Secret Sharing over Bilinear Groups

ZHANG Futai; ZHANG Jie

Article Contents

Article Navigation > Chinese Journal of Electronics > 2014 > 23(1): 13-17

ZHANG Futai and ZHANG Jie, “Efficient and Information-Theoretical Secure Verifiable Secret Sharing over Bilinear Groups,” Chinese Journal of Electronics, vol. 23, no. 1, pp. 13-17, 2014,

Citation:

ZHANG Futai and ZHANG Jie, “Efficient and Information-Theoretical Secure Verifiable Secret Sharing over Bilinear Groups,” Chinese Journal of Electronics, vol. 23, no. 1, pp. 13-17, 2014,

ZHANG Futai and ZHANG Jie, “Efficient and Information-Theoretical Secure Verifiable Secret Sharing over Bilinear Groups,” Chinese Journal of Electronics, vol. 23, no. 1, pp. 13-17, 2014,

Citation:

ZHANG Futai and ZHANG Jie, “Efficient and Information-Theoretical Secure Verifiable Secret Sharing over Bilinear Groups,” Chinese Journal of Electronics, vol. 23, no. 1, pp. 13-17, 2014,

PDF( 167 KB)

Efficient and Information-Theoretical Secure Verifiable Secret Sharing over Bilinear Groups

ZHANG Futai^1,2,
ZHANG Jie¹

1.
School of Computer Science and Technology, Nanjing Normal University, Nanjing 210023, China;
2.
Jiangsu Engineering Research Center on Information Security and Privacy Protection Technology, Nanjing 210097, China

Funds: This work is supported by the National Natural Science Foundation of China (No.61170298) and Natural Science Fund for Colleges and Universities in Jiangsu Province (No.12KJD520007).

Received Date: 2013-01-01
Rev Recd Date: 2013-04-01
Publish Date: 2014-01-05

Abstract

Abstract

Verifiable secret sharing (VSS) is an important technique which has been used as a basic tool in distributed cryptosystems, secure multi-party computations, as well as safe guarding some confidential information such as cryptographic keys. By now, some secure and efficient non-interactive VSS schemes for sharing secrets in a finite field have been available. In this paper, we investigate verifiably sharing of a secret that is an element of a bilinear group. We present an efficient and informationtheoretical secure VSS scheme for sharing such a secret which may be a private key for a pairing based cryptosystem. Our performance and security analysis indicates that the newly proposed scheme is more efficient and practical while enjoys the same level of security compared with similar protocols available. We also demonstrate two typical applications of our proposed VSS scheme. One is the sharing of a secret key of Boneh and Franklin's identity-based encryption scheme, and the other is the sharing or the distributed generation of a secret key of the leakage resilient bilinear ElGamal encryption scheme.
- Verifiable secret sharing,
- Threshold,
- Bilinear map,
- Bilinear group,
- Information-theoretical secure

FullText(HTML)

References(18)

References

A. Shamir,"How to share a secret", Communications of the ACM, Vol.22, No.11, pp.612-613, 1979.

R. Gennaro, S. Jarecki, H. Krawczyk, et al.,"Secure distributed key generation for discrete-log based cryptosystems", Journal of Cryptology, Vol.20, No.1, pp.51-83, 2007.

R. Gennaro, S. Jarecki, H. Krawczyk, et al.,"Revisiting the distributed key generation for discrete-log based Cryptosystems", in RSA-CT '03, LNCS. 2612 (G Goos et al. eds), SpringerVerlag, pp.373-390, 2003.

R. Gennaro, S. Jarecki, H. Krawczyk, et al.,"Robust threshold DSS signatures", Information and Computation, Vol.164, No.1, pp.54-84, 2001.

B. Chor, S. Goldwasser, S. Micall, et al.,"Verifiable secret sharing and achieving simultaneity in the presence of faults", Proceeding of 26th FOCS (Manuel Blum et al. eds), pp.383-395, 1985.

P. Feldman,"A practical scheme for non-interactive verifiable secret sharing", Proceeding of the 28th IEEE Symposium on the Foundations of Computer Science (Laszlo Babai et al. eds), pp.427-437, 1987.

T. Pedersen,"Non-interactive and information-theoretic secure verifiable secret sharing", Cryptology-Crypto'91 (Santa Barbara), LNCS 576 (Joan Feigenbaum ed), pp.129-140, 1992.

J. Baek, Y. Zheng,"Identity-Based Threshold Decryption", in International Workshop on Public Key Cryptography, LNCS 2947, F. Bao et al. (Eds.), pp.262-276, 2004.

J. Baek, Y. Zheng,"Identity-based threshold signature scheme from the bilinear pairings", Proceedings of the International Conference on Information and Technology: Coding and Computing (Shahram Latifi et al. eds), Las Vegas, pp.124-128, 2004.

T.Y.Wu, Y.M. Tseng,"A paring-based publicly verifiable secret sharing scheme", Journal of Systems Science and Complexity, Vol.24, No.1, pp.186-194, 2011.

E. Kiltz, K. Pietrzak,"Leakage resilient ElGamal encryption. ASIACRYPT", LNCS 6477 (M Abe ed), Singapore, pp.595612, 2010.

D. Boneh, M. Franklin,"Identity-based encryption from the weil pairing", SIAM J. Computing, Vol.32, No.3, pp.586-615, 2003.

C. Gentry,"Practical identity-based encryption without random oracles", in Advances in Cryptology-EUROCRYPT 2006, LNCS 4004 (Serge Vaudenay ed.), St. Petersburg, pp.445-464, 2006.

D. Boneh, Xavier Boyen,"Short Signatures Without Random Oracles", Advances in Cryptology-EUROCRYPT 2004, LNCS 4004 (Christian Cachin, Jan L. Camenisch eds.), Interlaken, pp.56-73, 2004.

J. Xu, Z. Zhang, D. Feng,"Identity based threshold proxy signature", Chinese Journal of Electronics, Vol.15, No.1, pp.183, 2006.

L. Zhang, F. Zhang, X. Huang,"A secure and efficient certificateless signature scheme using bilinear pairing", Chinese Journal of Electronics, Vol.18, No.1, pp.145-148, 2009.

Y. Sun, H. Li,"ID-based signcryption KEM to multiple recipients", Chinese Journal of Electronics, Vol.20, No.2, pp.317-322, 2011.

R. Gennaro,"Theory and practice of verifiable secret sharing", Ph.D.Thesis, MIT, pp.51-107, 1996.

Relative Articles

Supplements(0)

Cited By

Proportional views