Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A Description and Proof of a Generalised and Optimised Variant of Wikström's Mixnet (1901.08371v1)

Published 24 Jan 2019 in cs.CR

Abstract: In this paper, we describe an optimised variant of Wikstr\"om's mixnet which shuffles vectors of ElGamal ciphertexts in parallel. We then show in detail that this construction is secure. Wikstr\"om's verifiable mixnet as we refer to it here was first presented in "Proofs of Restricted Shuffles" by Terelius and Wikstr\"om, building on Wikstr\"om's previous work. Specifically we take the optimised variant for ElGamal which appears to be in common use; for instance, it is presented in Haenni et al's "Pseudo-Code Algorithms for Verifiable Re-Encryption Mix-Nets". We extend the mixnet to support parallel shuffles. (The possibility of doing this is proven by the Wikstr\"om's result but we wish to show that this particular instance with its optimisations is secure.)

Citations (4)

Summary

We haven't generated a summary for this paper yet.