An algorithm to compute collusion paths

Author

Low, Steven H. ; Maxemchuk, Nicholas F.

Author_Institution

Dept. of Electr. & Electron. Eng., Melbourne Univ., Parkville, Vic., Australia

Volume

2

fYear

1997

fDate

7-12 Apr 1997

Firstpage

745

Abstract

In earlier work we have formulated a collusion problem that determines whether it is possible for a set of colluders to collectively discover a target set of information, starting from their initial knowledge, and have presented a complete solution for a special case of the problem. In this paper we present an algorithm that solves the general case. Given a collusion problem the algorithm determines whether it has a solution, and if it does, computes one. A solution to the collusion problem is a method with which the colluders can uncover the hidden information. Communications protocols that employ cryptographic techniques are increasingly used to protect privacy as well as to communicate. A cryptographic protocol defines a process by which information is transferred among some users while hidden from others. The algorithm presented can be used to determine whether a subset of protocol users can discover, during or after the protocol´s execution, the information that is designed to be hidden from them

Keywords

cryptography; data privacy; protocols; algorithm; collusion paths computation; collusion problem solution; communications protocols; cryptographic protocol; cryptographic techniques; data privacy; hidden information; Algorithm design and analysis; Broadband communication; Credit cards; Cryptographic protocols; Cryptography; Data security; Electronic commerce; Mobile communication; Privacy; Protection;

fLanguage

English

Publisher

ieee

Conference_Titel

INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution., Proceedings IEEE

Conference_Location

Kobe

ISSN

0743-166X

Print_ISBN

0-8186-7780-5

Type

conf

DOI

10.1109/INFCOM.1997.644529

Filename

644529