PROPOSAL OF A SEMIFORMAL MODEL OF ANONYMOUS COMMUNICATION
| Authors | |
|---|---|
| Year of publication | 2009 |
| Type | Article in Periodical |
| Magazine / Source | International Journal of Foundations of Computer Science |
| MU Faculty or unit | |
| Citation | |
| Doi | http://dx.doi.org/10.1142/S0129054109006711 |
| Field | Information theory |
| Keywords | Anonymity; security foundations; complex communication; cryptographic protocols; modular approach |
| Description | We present a semiformal model of anonymous communication with several participants performing several anonymous actions on several messages, e.g. in digital pseudosigna- tures. The goal is to design a model having enough expressive power to model simple as well as very complex anonymous communication patterns. Our model concentrates on anonymity of a sender, a receiver, and on the relationship anonymity. However, the model is easy to adopt to other types of anonymity. A special anonymous channel formalism is introduced and extensively explored in this paper. The formalism builds on the top of so-called estimation procedure which takes knowledge of the adversary and processes it to find anonymous participants. Some other, already published, models of anonymity, e.g. the model of Hughes and Shmatikov or of Halpern and O'Neill, are compatible with our model { they could be used as building blocks together with (or instead of) our estimation procedure. Therefore, the tools developed for those models can be easily adapted to be used with our model. |
| Related projects: |