Change search
ReferencesLink to record
Permanent link

Direct link
A sender verifiable mix-net and a new proof of a shuffle
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.ORCID iD: 0000-0003-4157-1371
2005 (English)In: ADVANCES IN CRYPTOLOGY ASIACRYPT 200 / [ed] Roy, B, BERLIN: SPRINGER-VERLAG BERLIN , 2005, Vol. 3788, 273-292 p.Conference paper (Refereed)
Abstract [en]

We introduce the first El Carnal based mix-net in which each mix-server partially decrypts and permutes its input, i.e., no reencryption is necessary. An interesting property of the construction is that a sender can verify non-interactively that its message is processed correctly. We call this sender verifiability. The mix-net is provably UC-secure against static adversaries corrupting any minority of the mix-servers. The result holds under the decision Diffie-Hellman assumption, and assuming an ideal bulletin board and an ideal zero-knowledge proof of knowledge of a correct shuffle. Then we construct the first proof of a decryption-permutation shuffle, and show how this can be transformed into a zero-knowledge proof of knowledge in the UC-framework. The protocol is sound under the strong RSA-assumption and the discrete logarithm assumption. Our proof of a shuffle is not a variation of existing methods. It is based on a novel idea of independent interest, and we argue that it is at least as efficient as previous constructions.

Place, publisher, year, edition, pages
BERLIN: SPRINGER-VERLAG BERLIN , 2005. Vol. 3788, 273-292 p.
National Category
Computer Science
URN: urn:nbn:se:kth:diva-42690ISI: 000234879200015ScopusID: 2-s2.0-33646794034ISBN: 3-540-30684-6OAI: diva2:447503
11th International Conference on the Theory and Application of Cryptology and Information Security. Chennai, INDIA. DEC 04-08, 2005
QC 20111011Available from: 2011-10-12 Created: 2011-10-11 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: 14 hits
ReferencesLink to record
Permanent link

Direct link