Comment on a Novel Non-interactive Verifiable Secret Sharing Scheme

In 2006, Jun et al presented a novel non-interactive verifiable secret sharing scheme constructed by Shamir's secret sharing scheme for secure multi-party communication protocol in distributed networks. In their scheme, the Dealer only publishes one commitment for verification. The efficiency o...

Full description

Saved in:
Bibliographic Details
Published in2010 Second International Conference on Communication Software and Networks pp. 157 - 159
Main Authors Feng Wang, Gu, L., Yousheng Zhou, Yixian Yang, Yajian Zhou
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.02.2010
Subjects
Communication switching
Communication system control
Cryptographic protocols
Cryptography
Information security
Laboratories
multi-party communication
non-interactive
Phase detection
Protection
Resists
secret sharing
Telecommunication switching
verifiable
Online AccessGet full text

Cover

More Information
Summary:In 2006, Jun et al presented a novel non-interactive verifiable secret sharing scheme constructed by Shamir's secret sharing scheme for secure multi-party communication protocol in distributed networks. In their scheme, the Dealer only publishes one commitment for verification. The efficiency of verification for each share doesn't fall as the augment of the threshold and the security of the verifiable secret sharing scheme is based on the intractability of computing discrete logarithm. So they demonstrated that their scheme can efficiently withstand not only the deceptive behavior between the Dealer and participants but among participants. In this paper, we analysis the security of their scheme and point out that their scheme couldn't resist the deceptive behavior like they claimed.
ISBN:1424457262
9781424457267
DOI:10.1109/ICCSN.2010.16