Wolf, S.: Strong security against active attacks in information-theoretic secret-key agreement. In: Advances in Cryptology | ASIACRYPT 1998.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....of length jSj = jS 0 j = k, where the goal is of course to make k as large as possible. Let t be the total number of messages and let C t = C 1 ; C t ] denote the set of exchanged messages. Informally, a key agreement protocol is secure if the following conditions are satisfied [34, 45]: whenever Eve is only passive, then Alice and Bob both accept, and whenever one of the parties accepts, then the other party has also generated a key (with or without accepting) and the two keys agree with very high probability (i.e. P [S 6= S 0 ] 0) the key S is very close to ....

....S(X ; Y jjZ) is positive if and only if I(X ; Y # Z) is positive, and the two quantities may even be equal. Even if the public discussion channel is not authenticated, key agreement is still possible. The secret key rate is even equal to S(X ; Y jjZ) where an authenticated channel is assumed) [34, 45], except if Eve can either generate from Z a random variable 5 neglecting here the fact that the bound can be slightly greater if imperfect secrecy or a non zero failure probability is tolerated. 8 Y such that P X Y = PXY or, symmetrically, a random variable X such that P XY = PXY . ....

S. Wolf, Strong security against active attacks in information-theoretic secret-key agreement, Advances in Cryptology - ASIACRYPT '98, Lecture Notes in Computer Science, vol. 1514, pp. 405--419, Springer-Verlag, 1998.

No context found.

S. Wolf, Strong security against active attacks in informationtheoretic secret-key agreement, Advances in Cryptology - ASIACRYPT '98, Lecture Notes in Computer Science, Vol. 1514, pp. 405--419, Springer-Verlag, 1998.

No context found.

S. Wolf, Strong security against active attacks in information-theoretic secret-key agreement, Advances in Cryptology - ASIACRYPT '98, LNCS, Vol. 1514, pp. 405{ 419, Springer-Verlag, 1998.

No context found.

S. Wolf, Strong security against active attacks in information-theoretic secret-key agreement, Advances in Cryptology - ASIACRYPT '98, LNCS, Vol. 1514, pp. 405{ 419, Springer-Verlag, 1998.

....ourselves to the stronger, more satisfactory definition. Remark. The problem of secret key agreement has also been studied for the case where the channel connecting Alice and Bob is not authentic, i.e. the adversary is also able to modify or insert messages. It has been shown in [10] 14] [18] that secret key agreement can even be possible in this case (if the distribution PXY Z satisfies certain properties) The following lower bound on S(X; Y jjZ) is proved in [11] and first in [13] for the weaker definition) and follows from a result by Csisz ar and Korner [6] Theorem 1: For all ....

S. Wolf, "Strong security against active attacks in information-theoretic secret-key agreement," to appear in Advances in Cryptology - ASIACRYPT '98, Lecture Notes in Computer Science, Springer-Verlag, 1998.

....is successful. Note that we cannot demand that both Alice and Bob accept in the latter case, but that they both compute the correct and secure key nonetheless. According to this, the secret key rate S (X; Y jjZ) against active adversaries (robust secret key rate for short) was de ned in [3] [11], 10] in the same way as S(X;Y jjZ) but where this time the public discussion channel is not even authentic (i.e. possibly under total control of the adversary) In addition to the conditions in the de nition of S(X;Y jjZ) it is required that 3 accept, S A accept, S B Alice Bob X Y U r ....

S. Wolf, Strong security against active attacks in information-theoretic secret-key agreement, Advances in Cryptology - ASIACRYPT '98, Lecture Notes in Computer Science, vol. 1514, pp. 405419, SpringerVerlag, 1998.

No context found.

Wolf, S.: Strong security against active attacks in information-theoretic secret-key agreement. In: Advances in Cryptology | ASIACRYPT 1998.

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