N. Alexandris, M. Burmester, V. Chrissikopoulos, and D. Peppes. Key agreement protocols: two efficient models for provable security. In S.K. Katsikas, D. Gritzalis, editors, Information Systems Security, Facing the Information Society of the 21st century, IFIP SEC '96, Chapman & Hall, pages 227--236, 1996. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Key Agreement Protocols and their Security Analysis - Blake-Wilson, Johnson, Menezes (1997) (11 citations) (Correct)
....problem is harder than the key agreement problem in which i does not care who (or what) he is agreeing on a key with, for in this problem i stipulates that the key be shared with j and no one else. Several techniques related to the Diffie Hellman problem have been proposed to solve the AK problem [23, 18, 1]. However, no practical solutions have been provably demonstrated to achieve this goal, and this deficiency has lead in many cases to the use of flawed protocols To be presented at the Sixth IMA International Conference on Cryptography and Coding, Cirencester, England, 17 19 December 1997. y ....
N. Alexandris, M. Burmester, V. Chrissikopoulos, and D. Peppes. Key agreement protocols: two efficient models for provable security. In S.K. Katsikas, D. Gritzalis, editors, Information Systems Security, Facing the Information Society of the 21st century, IFIP SEC '96, Chapman & Hall, pages 227--236, 1996.
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