A Caltech Library Service

Collusion analysis of cryptographic protocols

Low, Steven H. and Maxemchuk, Nicholas F. (1996) Collusion analysis of cryptographic protocols. In: IEEE GLOBECOM 1996 - Communications: The Key to Global Prosperity. IEEE , Piscataway, NJ, pp. 1-5. ISBN 0-7803-3337-3.

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item:


As network applications such as electronic commerce proliferate, complex communications protocols that employ cryptographic building blocks, such as encryption and authentication, will become more common. We view a cryptographic protocol as a process by which information is transferred among some users and hidden from others. The collusion problem determines whether a subset of users can discover, through collusion, the information that is designed to be hidden from them after a protocol is executed. Earlier we introduced a model for cryptographic protocols and its collusion analysis, and solved a special case of the collusion problem. In this paper we present an algorithm that solves the general case.

Item Type:Book Section
Related URLs:
URLURL TypeDescription
Low, Steven H.0000-0001-6476-3048
Additional Information:© 1996 IEEE. Date of Current Version: 06 August 2002.
Other Numbering System:
Other Numbering System NameOther Numbering System ID
INSPEC Accession Number5677850
Record Number:CaltechAUTHORS:20120131-134121360
Persistent URL:
Official Citation:Low, S.H.; Maxemchuk, N.F.; , "Collusion analysis of cryptographic protocols," Global Telecommunications Conference, 1996. GLOBECOM '96. 'Communications: The Key to Global Prosperity , vol.1, no., pp.1-5 vol.1, 18-22 Nov 1996 doi: 10.1109/GLOCOM.1996.594324 URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:29048
Deposited By: Tony Diaz
Deposited On:08 Feb 2012 23:49
Last Modified:09 Nov 2021 17:03

Repository Staff Only: item control page