Collusion analysis of cryptographic protocols
- Creators
-
Low, Steven H.
- Maxemchuk, Nicholas F.
Abstract
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.
Additional Information
© 1996 IEEE. Date of Current Version: 06 August 2002.
Additional details
- Eprint ID
- 29048
- Resolver ID
- CaltechAUTHORS:20120131-134121360
- Created
-
2012-02-08Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field
- Other Numbering System Name
- INSPEC Accession Number
- Other Numbering System Identifier
- 5677850