DocumentCode :
2574316
Title :
Bounds on authentication systems in query model
Author :
Safavi-Naini, Reihaneh ; Wild, Peter
Author_Institution :
Sch. of Inf. Technol. & Comput. Sci., Wollongong Univ., NSW
fYear :
2005
fDate :
19-19 Oct. 2005
Firstpage :
85
Lastpage :
91
Abstract :
Unconditionally secure authentication codes provide information theoretic security against an adversary who observes authenticated messages and then wants to construct a fraudulent message that is acceptable by the receiver. The attack model for these codes has recently been strengthened and adaptive adversaries with oracle access have been introduced. In this paper we give an analysis of this new model and derive information theoretic bounds on the success probability and key size of the codes. Our analysis treats two games that an adversary can play: an offline attack in which the adversary is allowed to query a verification oracle and then to construct the spoofing query; and an on-line attack in which the adversary interacts with the verification oracle and wins as soon as he constructs an acceptable message. We describe the best strategy of the adversary in each case
Keywords :
Internet; information theory; message authentication; query processing; attack model; authenticated messages; authentication system; fraudulent message; information theoretic security; offline attack; online attack; query model; spoofing query; unconditionally secure authentication codes; verification oracle; Authentication; Computer science; Data security; Information analysis; Information security; Information technology; Mathematical model; Mathematics; Power system security; Quantum computing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Theory and Practice in Information-Theoretic Security, 2005. IEEE Information Theory Workshop on
Conference_Location :
Awaji Island
Print_ISBN :
0-7803-9491-7
Type :
conf
DOI :
10.1109/ITWTPI.2005.1543963
Filename :
1543963
Link To Document :
بازگشت