6 citations found. Retrieving documents...
G. Tsudik and E.V. Herreweghen, \On Simple and Secure Key Distribution, " 1st ACM Conference on Computer and Communications Security, Nov. 1993, pp. 49-57.

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Key-Schedule Cryptanalysis of IDEA, G-DES, GOST, SAFER.. - Kelsey, Schneier, Wagner (1996)   (9 citations)  (Correct)

....a protocol which distributes a session key K s between Alice and Bob, who share a long term key K ab , by sending A # B : E(K ab ) #K s will be vulnerable since an adversary can flip bits in K s at will. To demonstrate this protocol attack, we examine the 2PKDP key distribution protocol [TH93]. The 2PKDP protocol is A # B : A, N B # A : N # , MACK ab (N, N # , B) #K s where MAC is a cryptographic message authentication code, N,N # are nonces, K ab is a long term symmetric shared key between A and B, and K s is the negotiated session key. We note that an adversary can easily ....

G. Tsudik and E.V. Herreweghen, "On Simple and Secure Key Distribution, " 1st ACM Conference on Computer and Communications Security, Nov. 1993, pp. 49--57.


Key-Schedule Cryptanalysis of IDEA, G-DES, GOST, SAFER.. - Kelsey, Schneier, Wagner (1996)   (9 citations)  (Correct)

....a protocol which distributes a session key K s between Alice and Bob, who share a long term key K ab , by sending A B : E(K ab ) Phi K s will be vulnerable since an adversary can flip bits in K s at will. To demonstrate this protocol attack, we examine the 2PKDP key distribution protocol [TH93]. The 2PKDP protocol is A B : A; N B A : N 0 ; MACKab (N; N 0 ; B) Phi K s where MAC is a cryptographic message authentication code, N;N 0 are nonces, K ab is a long term symmetric shared key between A and B, and K s is the negotiated session key. We note that an adversary can easily ....

G. Tsudik and E.V. Herreweghen, "On Simple and Secure Key Distribution, " 1st ACM Conference on Computer and Communications Security, Nov. 1993, pp. 49--57.


Robust and Secure Password and Key Change Method - Hauser, Janson, Molva.. (1994)   Self-citation (Tsudik Van herreweghen)   (Correct)

....the AS: a ticket T(Knew )K old containing the new key Knew , and sealed with K old ; and a sanity check ticket T(K old )Knew sealed with Knew , and containing K old . The ticket expressions are similar to those used in the KryptoKnight Authentication and Key Distribution Service [9] See also [7, 8, 6]. If the request is well formed and authentic, AS replies with an authenticated acknowledgment REP CPW which can take on two flavors: ACK (accept) or NACK (reject) The AS generates a NACK if only if Knew is not acceptable for some reason (e.g. predictable password) However, Knew must still ....

G. Tsudik, E. Van Herreweghen, On Simple and Secure Key Distribution, Proceedings of 1993 ACM Conference on Computer and Communications Security, November 1993.


Robust and Secure Password and Key Change Method - Hauser, Janson, Molva.. (1994)   Self-citation (Tsudik Van herreweghen)   (Correct)

....the AS: a ticket T(Knew )K old containing the new key Knew , and sealed with K old ; and a sanity check ticket T(K old )Knew sealed with Knew , and containing K old . The ticket expressions are similar to those used in the KryptoKnight Authentication and Key Distribution Service [7] See also [5, 6, 4]. If the request is well formed and authentic, AS replies with an authenticated acknowledgment REP CPW which can take on two flavors: ACK (accept) or NACK (reject) The AS generates a NACK if only if Knew is not acceptable for some reason (e.g. predictable password) However, Knew must still ....

G. Tsudik, E. Van Herreweghen, On Simple and Secure Key Distribution, Proceedings of 1993 ACM Conference on Computer and Communications Security, November 1993.


Robust and Secure Password and Key Change Method - Hauser, Janson, Molva.. (1994)   Self-citation (Tsudik Van herreweghen)   (Correct)

....the AS: a ticket T(Knew )K old containing the new key Knew , and sealed with K old ; and a sanity check ticket T(K old )Knew sealed with Knew , and containing K old . The ticket expressions are similar to those used in the KryptoKnight Authentication and Key Distribution Service [8] See also [6, 7, 5]. If the request is well formed and authentic, AS replies with an authenticated acknowledgment REP CPW which can take on two flavors: ACK (accept) or NACK (reject) The AS generates a NACK if only if Knew is not acceptable for some reason (e.g. predictable password) However, Knew must still ....

G. Tsudik, E. Van Herreweghen, On Simple and Secure Key Distribution, Proceedings of 1993 ACM Conference on Computer and Communications Security, November 1993.


Key-Schedule Cryptanalysis of IDEA, G-DES, GOST, SAFER.. - Kelsey, Schneier, Wagner (1996)   (9 citations)  (Correct)

No context found.

G. Tsudik and E.V. Herreweghen, \On Simple and Secure Key Distribution, " 1st ACM Conference on Computer and Communications Security, Nov. 1993, pp. 49-57.

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