PROPOSAL OF A SEMIFORMAL MODEL OF ANONYMOUS COMMUNICATION

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F09%3A00065858" target="_blank" >RIV/00216224:14330/09:00065858 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1142/S0129054109006711" target="_blank" >http://dx.doi.org/10.1142/S0129054109006711</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1142/S0129054109006711" target="_blank" >10.1142/S0129054109006711</a>

Jazyk výsledku

angličtina

Název v původním jazyce

PROPOSAL OF A SEMIFORMAL MODEL OF ANONYMOUS COMMUNICATION

Popis výsledku v původním jazyce

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 simpleas 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.

Název v anglickém jazyce

PROPOSAL OF A SEMIFORMAL MODEL OF ANONYMOUS COMMUNICATION

Popis výsledku anglicky

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 simpleas 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.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

BD - Teorie informace

OECD FORD obor

—

Projekt

<a href="/cs/project/GA201%2F07%2F0603" target="_blank" >GA201/07/0603: Výpočty, komunikace a bezpečnost kvantových distribuovaných systémů</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2009

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

International Journal of Foundations of Computer Science

ISSN

0129-0541

e-ISSN

—

Svazek periodika

20/2009

Číslo periodika v rámci svazku

3

Stát vydavatele periodika

CZ - Česká republika

Počet stran výsledku

26

Strana od-do

523-548

Kód UT WoS článku

000266614100010

EID výsledku v databázi Scopus

—