Previous [ 1] [ 2] [ 3] [ 4] [ 5] [ 6] [ 7] [ 8] [ 9] [ 10] [ 11] [ 12] [ 13] [ 14] [ 15]

@

Journal of Information Science and Engineering, Vol. 22 No. 3, pp. 611-624 (May 2006)

Efficient One-time Signature Schemes for Stream Authentication*

Yongsu Park and Yookun Cho+
College of Information and Communications
Hanyang University
Seoul, 133-791 Korea
E-mail: yspark@ssrnet.snu.ac.kr
+School of Computer Science and Engineering
Seoul National University
Seoul, 151-742 Korea
E-mail: cho@ssrnet.snu.ac.kr

When one-time signatures are used for stream authentication, one of the most serious drawbacks is that their large signature size yields high communication overhead. In this paper, we present two efficient one-time signature schemes for stream authentication. Compared with the previous schemes, these schemes have the smallest signature sizes. Moreover, their verification overheads are low. The signature size of Scheme 1 is smaller than that of Scheme 2 whereas Scheme 2 has much smaller signing cost: it requires only 2 hash operations in the majority of cases. Although Scheme 1s signing cost is relatively high, it can be parallelized without any additional risk because sharing the private key among distributed servers is not required.

Keywords: information theory, security, cryptography, authentication, digital signature, stream distribution

Full Text () Retrieve PDF document (200605_09.pdf)

Received May 7, 2004; revised April 26, 2005; accepted November 2, 2005.
Communicated by Shiuhpyng Shieh.
* A preliminary version of this paper has appeared on the technical/industrial track of ACNS 2004.
1 In the Internet, streamed media is transmitted in the unit of IP packet. If a stream chunk (or its signature) is partially transmitted to the receivers by IP packet loss, it will be unverifiable. The larger the size of each chunk, the more frequently partial transmission occurs and the more chunks will be unverifiable. Hence, the size of a chunk should be much smaller than that of IP packet which is usually 4096 bytes.