Change search
ReferencesLink to record
Permanent link

Direct link
Five Practical Attacks for “Optimistic Mixing for Exit-Polls”
Swedish Institute of Computer Science (SICS).ORCID iD: 0000-0003-4157-1371
2004 (English)In: SELECTED AREAS IN CRYPTOGRAPHY, BERLIN: Springer Verlag , 2004, 160-174 p.Conference paper (Refereed)
Abstract [en]

Golle, Zhong, Boneh, Jakobsson, and Juels [9] recently presented an efficient mix-net, which they claim to be both robust and secure. We present five practical attacks for their mix-net, and break both its privacy and robustness. The first attack breaks the privacy of any given sender without corrupting any mix-server. The second attack requires that the first mix-server is corrupted. Both attacks are adaptations of the “relation attack” introduced by Pfitzmann [24, 23]. The third attack is similar to the attack of Desmedt and Kurusawa [4] and breaks the privacy of all senders. It requires that all senders are honest and that the last mix-server is corrupted. The fourth attack may be viewed as a novel combination of the ideas of Lim and Lee [16] and Pfitzmann [24, 23]. It breaks the privacy of any given sender, and requires that the first and last mix-servers are corrupted. This attack breaks also Jakobsson [14], including the fixed version of Mitomo and Kurosawa [18]. The fifth attack breaks the robustness in a novel way. It requires corruption of some senders and the first mix-server. This attack breaks also Jakobsson and Juels [15].

Place, publisher, year, edition, pages
BERLIN: Springer Verlag , 2004. 160-174 p.
, Lecture Notes in Computer Science, ISSN 0302-9743
National Category
Computer and Information Science
URN: urn:nbn:se:kth:diva-50924ISI: 000189504800012ISBN: 3-540-21370-8OAI: diva2:463070
10th Annual International Workshop on Selected Areas in Cryptography. Carleton Univ, Ottawa, CANADA. AUG 14-15, 2003
QC 20111209Available from: 2011-12-08 Created: 2011-12-08 Last updated: 2011-12-09Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Wikström, Douglas
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 7 hits
ReferencesLink to record
Permanent link

Direct link