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
Cet article fournit les théorèmes de codage théoriques de Shannon sur les probabilités de succès de l'attaque par usurpation d'identité et de l'attaque par substitution contre les systèmes d'authentification par clé secrète. Bien qu’il existe de nombreuses études qui développent des limites inférieures pour les probabilités de réussite, leurs limites supérieures strictes sont rarement discutées. Cet article caractérise les limites supérieures strictes d'un système d'authentification étendu par clé secrète qui inclut la longueur de bloc K et permet à la probabilité d'erreur de décodage de tendre vers zéro lorsque K
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
Hiroki KOGA, Hirosuke YAMAMOTO, "Coding Theorems for Secret-Key Authentication Systems" in IEICE TRANSACTIONS on Fundamentals,
vol. E83-A, no. 8, pp. 1691-1703, August 2000, doi: .
Abstract: This paper provides the Shannon theoretic coding theorems on the success probabilities of the impersonation attack and the substitution attack against secret-key authentication systems. Though there are many studies that develop lower bounds on the success probabilities, their tight upper bounds are rarely discussed. This paper characterizes the tight upper bounds in an extended secret-key authentication system that includes blocklength K and permits the decoding error probability tending to zero as K
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e83-a_8_1691/_p
Copier
@ARTICLE{e83-a_8_1691,
author={Hiroki KOGA, Hirosuke YAMAMOTO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Coding Theorems for Secret-Key Authentication Systems},
year={2000},
volume={E83-A},
number={8},
pages={1691-1703},
abstract={This paper provides the Shannon theoretic coding theorems on the success probabilities of the impersonation attack and the substitution attack against secret-key authentication systems. Though there are many studies that develop lower bounds on the success probabilities, their tight upper bounds are rarely discussed. This paper characterizes the tight upper bounds in an extended secret-key authentication system that includes blocklength K and permits the decoding error probability tending to zero as K
keywords={},
doi={},
ISSN={},
month={August},}
Copier
TY - JOUR
TI - Coding Theorems for Secret-Key Authentication Systems
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1691
EP - 1703
AU - Hiroki KOGA
AU - Hirosuke YAMAMOTO
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E83-A
IS - 8
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - August 2000
AB - This paper provides the Shannon theoretic coding theorems on the success probabilities of the impersonation attack and the substitution attack against secret-key authentication systems. Though there are many studies that develop lower bounds on the success probabilities, their tight upper bounds are rarely discussed. This paper characterizes the tight upper bounds in an extended secret-key authentication system that includes blocklength K and permits the decoding error probability tending to zero as K
ER -