A. Sgarro. Information-theoretic bounds for authentication frauds. Journal of Computer Security, 2:53-- 64, 1993. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Authentication Theory and Hypothesis Testing - Maurer (Correct)
....of Shannon s treatment of secrecy. The first lower bound results in message authentication were purely combinatorial [4] 3] In 1984, Simmons [16] initiated a sequence of research activities on information theoretic lower bounds in authentication theory [2] 5] 6] 7] 10] 11] 12] [13], 14] 17] 18] 19] 21] The results of this paper were presented in part at the 13th Symposium on Theoretical Aspects of Computer Science (STACS 96) Grenoble, France, Feb. 1996, and have appeared in the proceedings. Author s address: Department of Computer Science, ETH Zurich, CH 8092 ....
....a priori knowledge of the secret key. The joint probability distribution of the authenticated message and the secret key is different in both cases, and this may allow the receiver to distinguish between the two hypotheses. The goal of the paper is similar in spirit to some of Sgarro s work (cf. [13], 14] who also investigated a general approach to authentication frauds, based on rate distortion theory, showing that some of the known bounds follow from a more general result. Like Shannon s lower bounds [15] on the size of a secret key of a perfect secrecy system, the bounds of this paper ....
A. Sgarro, Information-theoretic bounds for authentication frauds, Journal of Computer Security, Vol. 2, No. 1, IOS Press, 1993, pp. 53--63.
Tight Bounds for Unconditional Authentication Protocols in.. - Naor, Segev, Smith (2006) (1 citation) (Correct)
No context found.
A. Sgarro. Information-theoretic bounds for authentication frauds. Journal of Computer Security, 2:53-- 64, 1993.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC