Efficient and General PVSS Based on ElGamal Encryption

Kun Peng
Volume: 8, No: 2, Page: 375 ~ 388, Year: 2012
10.3745/JIPS.2012.8.2.375
Keywords: ElGamal, PVSS
Full Text:

Abstract
PVSS stands for publicly verifiable secret sharing. In PVSS, a dealer shares a secret among multiple share holders. He encrypts the shares using the shareholders"'" encryption algorithms and publicly proves that the encrypted shares are valid. Most of the existing PVSS schemes do not employ an ElGamal encryption to encrypt the shares. Instead, they usually employ other encryption algorithms like a RSA encryption and Paillier encryption. Those encryption algorithms do not support the shareholders"'" encryption algorithms to employ the same decryption modulus. As a result, PVSS based on those encryption algorithms must employ additional range proofs to guarantee the validity of the shares obtained by the shareholders. Although the shareholders can employ ElGamal encryptions with the same decryption modulus in PVSS such that the range proof can be avoided, there are only two PVSS schemes based on ElGamal encryption. Moreover, the two schemes have their drawbacks. One of them employs a costly repeating-proof mechanism, which needs to repeat the dealer"'"s proof at least scores of times to achieve satisfactory soundness. The other requires that the dealer must know the discrete logarithm of the secret to share and thus weakens the generality and it cannot be employed in many applications. A new PVSS scheme based on an ElGamal encryption is proposed in this paper. It employs the same decryption modulus for all the shareholders"'" ElGamal encryption algorithms, so it does not need any range proof. Moreover, it is a general PVSS technique without any special limitation. Finally, an encryption-improving technique is proposed to achieve very high efficiency in the new PVSS scheme. It only needs a number of exponentiations in large cyclic groups that are linear in the number of the shareholders, while all the existing PVSS schemes need at least a number of exponentiations in large cyclic groups that are linear in the square of the number of the shareholders

Article Statistics
Multiple requests among the same broswer session are counted as one view (or download).
If you mouse over a chart, a box will show the data point's value.


Cite this article
IEEE Style
K. Peng, "Efficient and General PVSS Based on ElGamal Encryption," Journal of Information Processing Systems, vol. 8, no. 2, pp. 375~388, 2012. DOI: 10.3745/JIPS.2012.8.2.375.

ACM Style
Kun Peng. 2012. Efficient and General PVSS Based on ElGamal Encryption, Journal of Information Processing Systems, 8, 2, (2012), 375~388. DOI: 10.3745/JIPS.2012.8.2.375.