The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
La fonction d'un code d'authentification de message (MAC) est de vérifier la validité de l'ensemble d'un message. L'inconvénient des MAC habituels est qu'un récepteur ne peut pas vérifier sa validité tant que la réception d'un message n'est pas terminée. Par conséquent, les MAC habituels ne conviennent pas pour vérifier une grande quantité de données telles que la vidéo et l’audio (appelées flux). Dans cette lettre, nous proposons un MAC tel que la validité d'un flux puisse être vérifiée consécutivement sans attendre la fin de la réception. De plus, nous montrons ses implémentations : l’une est basée sur des fonctions de hachage pratiques et l’autre est basée sur des fonctions de hachage universelles.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Hidenori KUWAKADO, Hatsukazu TANAKA, "Message Authentication for Stream" in IEICE TRANSACTIONS on Fundamentals,
vol. E85-A, no. 1, pp. 190-193, January 2002, doi: .
Abstract: The function of a message authentication code (MAC) is to verify the validity of a whole message. The disadvantage of usual MACs is that a receiver can not check its validity until the receipt of a message is finished. Hence, usual MACs are not suitable for verifying a large amount of data such as video and audio (called stream). In this letter, we propose a MAC such that the validity of a stream can be consecutively verified without waiting for the end of the reception. In addition, we show its implementations: one is based on practical hash functions, and the other is based on universal hash functions.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e85-a_1_190/_p
Copier
@ARTICLE{e85-a_1_190,
author={Hidenori KUWAKADO, Hatsukazu TANAKA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Message Authentication for Stream},
year={2002},
volume={E85-A},
number={1},
pages={190-193},
abstract={The function of a message authentication code (MAC) is to verify the validity of a whole message. The disadvantage of usual MACs is that a receiver can not check its validity until the receipt of a message is finished. Hence, usual MACs are not suitable for verifying a large amount of data such as video and audio (called stream). In this letter, we propose a MAC such that the validity of a stream can be consecutively verified without waiting for the end of the reception. In addition, we show its implementations: one is based on practical hash functions, and the other is based on universal hash functions.},
keywords={},
doi={},
ISSN={},
month={January},}
Copier
TY - JOUR
TI - Message Authentication for Stream
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 190
EP - 193
AU - Hidenori KUWAKADO
AU - Hatsukazu TANAKA
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E85-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2002
AB - The function of a message authentication code (MAC) is to verify the validity of a whole message. The disadvantage of usual MACs is that a receiver can not check its validity until the receipt of a message is finished. Hence, usual MACs are not suitable for verifying a large amount of data such as video and audio (called stream). In this letter, we propose a MAC such that the validity of a stream can be consecutively verified without waiting for the end of the reception. In addition, we show its implementations: one is based on practical hash functions, and the other is based on universal hash functions.
ER -