Comments on an efficient secret broadcast in the broadcasting networks

Authors:
Shuhua Wu;Yuefei Zhu;Qiong Pu
Affiliations:
Infonnation Engineering University, Zhengzhou, China;Infonnation Engineering University, Zhengzhou, China;Infonnation Engineering University, Zhengzhou, China
Venue:
IEEE Communications Letters
Year:
2010

Citing 4
Cited 0

How to construct random functions

Journal of the ACM (JACM)
Relations Among Notions of Security for Public-Key Encryption Schemes

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Binding ElGamal: a fraud-detectable alternative to key-escrow proposals

EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Public-key encryption in a multi-user setting: security proofs and improvements

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

To broadcast a message secretly and consistently to the receivers in the broadcasting networks, Jeong et al. suggested an efficient secret broadcast scheme using binding encryption quite recently. In this letter, we first show that their scheme just achieves consistency in a relatively weak security model but not in a stronger model. Furthermore, we point out their scheme is not so efficient even when their model is accepted. Thereafter, we suggest a simple and more efficient scheme, which can be proved in their model without using random oracles.