Coding Theorems for Secret-Key Authentication Systems
スポンサーリンク
概要
- 論文の詳細を見る
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 systems that includes blocklength K and permits the decoding error probability tending to zero as K→∞. In the extended system an encoder encrypts K source outputs to K cryptograms under K keys and transmits K cryptograms to a decoder through a public channel in the presence of an opponent. The decoder judges whether K cryptograms received from the public chanel are legitimate or not under K keys shared with the encoder. It is shown that 2^(-KI(W ; E)) is the minimal attainable upper bound of the success probability of the impersonation attack, where I (W ; E) denotes the mutual information between a cryptogram W and a key E. In addition, 2^(KH(E/W)) is proved to be the tight upper bound of the probability that the opponent can correctly guess K keys from transmitted K cryptograms, where H (E/W) denotes the conditional entropy of E given W.
- 社団法人電子情報通信学会の論文
- 2000-08-25
著者
-
Koga Hiroki
Institute Of Engineering Mechanics And Systems The University Of Tsukuba
-
YAMAMOTO Hirosuke
Graduate School of Engineering, The University of Tokyo
-
Yamamoto Hirosuke
Graduate School Of Engineering The University Of Tokyo
関連論文
- Coding Theorems for Secret-Key Authentication Systems
- Optimal Multiple Assignments Based on Integer Programming in Secret Sharing Schemes with General Access Structures(Protocols,Cryptography and Information Security)
- New Constructions of the Lattice-Based Visual Secret Sharing Scheme Using Mixture of Colors(Special Section on Cryptography and Information Security)
- A Visual Secret Sharing Scheme for Color Images Based on Meanvalue-Color Mixing(Special Section on Cryptography and Information Security)