Change search
ReferencesLink to record
Permanent link

Direct link
A universally composable mix-net
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.ORCID iD: 0000-0003-4157-1371
2004 (English)In: THEORY OF CRYTOGRAPHY, PROCEEDINGS  Book Series: LECTURE NOTES IN COMPUTER SCIENCE / [ed] Naor, M, BERLIN: SPRINGER , 2004, Vol. 2951, 317-335 p.Conference paper (Refereed)
Abstract [en]

A mix-net is a cryptographic protocol executed by a set of mix-servers that provides anonymity for a group of senders. The main application is electronic voting. Numerous mix-net constructions and stand-alone definitions of security are proposed in the literature, but only partial proofs of security are given for most constructions and no construction has been proved secure with regards to any kind of composition. We define an ideal mix-net in the universally composable security framework of Canetti [6]. Then we describe a mix-net based on Feldman [13] and using similar ideas as Desmedt and Kurosawa [10], and prove that it securely realizes the ideal mix-net with respect to static adversaries that corrupt a minority of the mix-servers and arbitrarily many senders. The mix-net executes in a hybrid model with access to ideal distributed key generation, but apart from that our only assumption is the existence of a group in which the Decision Diffie-Hellman Problem is hard. If there are relatively few mix-servers or a strong majority of honest mix-servers our construction is practical.

Place, publisher, year, edition, pages
BERLIN: SPRINGER , 2004. Vol. 2951, 317-335 p.
Keyword [en]
public-key cryptosystem, practical mix, secure, encryption, attack
National Category
Computer Science
URN: urn:nbn:se:kth:diva-43986ISI: 000189415300018ScopusID: 2-s2.0-35048873776ISBN: 3-540-21000-8OAI: diva2:450872
1st Theory of Cryptography Conference (TCC 2004). MIT, Cambridge, MA. FEB 19-21, 2004
QC 20111024Available from: 2011-10-24 Created: 2011-10-19 Last updated: 2012-01-20Bibliographically approved

Open Access in DiVA

No full text


Search in DiVA

By author/editor
Wikström, Douglas
By organisation
Theoretical Computer Science, TCS
Computer 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: 26 hits
ReferencesLink to record
Permanent link

Direct link