Posets and protocols - Picking the right three-party protocol

IEEE Journal on Selected Areas in Communications

Volumn 21, Issue 1, 2003, Pages 55-61

  Ng, Siaw Lynn ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Authentication protocols; Partially ordered sets; Strand space model

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); DATA COMMUNICATION SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; MATHEMATICAL MODELS; SECURITY OF DATA; SET THEORY; TELECOMMUNICATION LINKS;

AUTHENTICATION PROTOCOL; PARTIALLY ORDERED SETS; SECURITY PROTOCOL; STRAND SPACE MODEL;

NETWORK PROTOCOLS;

EID: 0037251070     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2002.806126     Document Type: Article

References (5)

1. L. Gong, "Lower bounds on messages and rounds for network authentication protocols," in Proc. 1st ACM Conf. Computer and Communications Security, Nov. 1993, pp. 26-37.
2. J. D. Guttman and F. J. Thayer Fábrega, "Authentication tests," in Proc. IEEE Symp. Security Privacy, May 2000, pp. 96-109.
3. P. J. Cameron, Combinatorics: Topics, Techniques, Algorithms. Cambridge, U.K.: Cambridge Univ. Press, 1994.
4. L. Lamport, "Time, clocks, and the ordering of events in a distributed system," Commun. ACM, vol. 21, pp. 558-565, July 1978.
5. R. Yahalom, "Optimality of asynchronous two party secure data-exchange protocols," J. Comput. Security, vol. 2, pp. 191-209, 1993.