The Aggregated Signature for Many-to-One Communication Based on Rabin Signature

Article Preview

Abstract:

To improve the efficiency of many-to-one communication, the aggregated signature Rabin signature is proposed. When the several senders sign and send the message to a receiver, they could do the same operation as the common Rabin signature. The several signature texts are aggregated and produced a signal signature text. Instead of verifying the several signature for several times, the verifier only verifies the aggregated signature for one time to determine the validation of the all of the messages. The discussion shows that, by this way the data amount and the computational cost could be reduced nearly 1/2 of the common algorithm. The proposed algorithm has the same secure level as the common Rabin signature.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 282-283)

Pages:

384-387

Citation:

Online since:

July 2011

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Rafaeli S, Hutchison D. A Survey of Key Management for Secure Group Communication, ACM Computing Surveys. 2003, 35(3): 309–329.

DOI: 10.1145/937503.937506

Google Scholar

[2] Hiertz G. R, Zang Y, Max S, Junge T, Weiss E, and Wolz B, IEEE 802. 11s: WLAN Mesh Standardization and High Performance Extensions. IEEE Networks. 2008, 22(3): 12-19.

DOI: 10.1109/mnet.2008.4519960

Google Scholar

[3] Han Y. Gui X. Wu X. Parallel Multi-recipient Signcryption for Imbalanced Wireless Networks. Inter. J. of Innovative Computing, Information and Control. 2010, 6(8): 3621-3630.

Google Scholar

[4] Rivest R. L., Shamir A. and Adleman L. M., A Method for Obtaining Digital Signatures and Public Key Cryptosystems. Communication of ACM, 1978, 21(2): 120-126.

DOI: 10.1145/359340.359342

Google Scholar

[5] ELGamal T. A Public-Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. IEEE Trans. On Information Theory, IT-31(4), (1985).

DOI: 10.1109/tit.1985.1057074

Google Scholar

[6] Rabin M. O., Digital Signature and Public-Key Functions as Factorization. MIT Laboratory for Computer Science, Technical Reports, MIT-LCS-TR-212, Jan. (1979).

Google Scholar