.png){kind=icon}
.png){kind=icon}
Return
Impossibility Bounds Using Conditional Rényi Entropy in Authentication Codes with Partially Leaked Key
.png){kind=icon}
PRE
AI
S
W
DOI：10.1587/transfun.2025TAP0007.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In message authentication, we consider a situation where a sender transmits a message to a receiver through an insecure channel. In the insecure channel, there is a risk of impersonation or substitution by an adversary. Message authentication is a scheme to detect such attacks and to accept the message sent by the sender as legitimate. One of the research topics in message authentication is the estimation of limits on how small the probabilities of a successful attack can be. Previous research has shown impossibility bounds using R & eacute;nyi entropy in the case where a shared key may be non-uniform. In this study, we consider a situation where the adversary has side-information that is correlated with a possibly non-uniform shared key, and investigate the impossibility using conditional R & eacute;nyi entropy. In particular, we show that, in contrast to the previous research, impossibility bounds using conditional min-entropy do not hold in general. In addition, the success probabilities can be bounded in general using conditional collision entropy, and we show that the bound is the tightest in terms of conditional R & eacute;nyi entropy.
Keywords:
key authentication
conditional collision entropy
conditional R & eacute
nyi entropy
side-information
Journal
IF:
0.4
Papers:
182
Citations:
1.3K
Organization
Cited Papers