Dagstuhl Seminar Proceedings, Volume 5411



Publication Details

  • published at: 2006-11-02
  • Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik

Access Numbers

Documents

No documents found matching your filter selection.
Document
05411 Abstracts Collection – Anonymous Communication and its Applications

Authors: Shlomi Dolev, Andreas Pfitzmann, and Rafail Ostrovsky


Abstract
From 09.10.05 to 14.10.05, the Dagstuhl Seminar 05411 ``Anonymous Communication and its Applications'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.

Cite as

Shlomi Dolev, Andreas Pfitzmann, and Rafail Ostrovsky. 05411 Abstracts Collection – Anonymous Communication and its Applications. In Anonymous Communication and its Applications. Dagstuhl Seminar Proceedings, Volume 5411, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)


Copy BibTex To Clipboard

@InProceedings{dolev_et_al:DagSemProc.05411.1,
  author =	{Dolev, Shlomi and Pfitzmann, Andreas and Ostrovsky, Rafail},
  title =	{{05411 Abstracts Collection – Anonymous Communication and its Applications}},
  booktitle =	{Anonymous Communication and its Applications},
  pages =	{1--15},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{5411},
  editor =	{Shlomi Dolev and Rafail Ostrovsky and Andreas Pfitzmann},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05411.1},
  URN =		{urn:nbn:de:0030-drops-7950},
  doi =		{10.4230/DagSemProc.05411.1},
  annote =	{Keywords: Anonymous Communication, Cryptography, Privacy, Security, Anonymity}
}
Document
Anonymity Metrics Revisited

Authors: Claudia Diaz


Abstract
In 2001, two information theoretic anonymity metrics were proposed: the "effective anonymity set size" and the "degree of anonymity". In this talk, we propose an abstract model for a general anonymity system which is consistent with the definition of anonymity on which the metrics are based. We revisit entropy-based anonymity metrics, and we apply them to Crowds, a practical anonymity system. We discuss the differences between the two metrics and the results obtained in the example.

Cite as

Claudia Diaz. Anonymity Metrics Revisited. In Anonymous Communication and its Applications. Dagstuhl Seminar Proceedings, Volume 5411, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)


Copy BibTex To Clipboard

@InProceedings{diaz:DagSemProc.05411.2,
  author =	{Diaz, Claudia},
  title =	{{Anonymity Metrics Revisited}},
  booktitle =	{Anonymous Communication and its Applications},
  pages =	{1--6},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{5411},
  editor =	{Shlomi Dolev and Rafail Ostrovsky and Andreas Pfitzmann},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05411.2},
  URN =		{urn:nbn:de:0030-drops-4833},
  doi =		{10.4230/DagSemProc.05411.2},
  annote =	{Keywords: Anonymity, metrics, entropy}
}
Document
Improving the Decoding Efficiency of Private Search

Authors: George Danezis and Claudia Diaz


Abstract
We show two ways of recovering all matching documents, in the Ostrovsky et al. Private Search, while requiring considerably shorter buffers. Both schemes rely on the fact that documents colliding in a buffer position provide the sum of their plaintexts. Efficient decoding algorithms can make use of this property to recover documents never present alone in a buffer position.

Cite as

George Danezis and Claudia Diaz. Improving the Decoding Efficiency of Private Search. In Anonymous Communication and its Applications. Dagstuhl Seminar Proceedings, Volume 5411, pp. 1-11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)


Copy BibTex To Clipboard

@InProceedings{danezis_et_al:DagSemProc.05411.3,
  author =	{Danezis, George and Diaz, Claudia},
  title =	{{Improving the Decoding Efficiency of Private Search}},
  booktitle =	{Anonymous Communication and its Applications},
  pages =	{1--11},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{5411},
  editor =	{Shlomi Dolev and Rafail Ostrovsky and Andreas Pfitzmann},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05411.3},
  URN =		{urn:nbn:de:0030-drops-4829},
  doi =		{10.4230/DagSemProc.05411.3},
  annote =	{Keywords: Private search, private information retrieval, cryptography}
}

Filters


Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail