Paper 2012/016

Efficient Mix-Net Verication by Proofs of Random Blocks

Denise Demirel, Melanie Volkamer, and Hugo Jonker


In order for a mix-net to be usable in practice (e.g. in electronic voting), efficient verification is a must. Despite many advances in the last decade, zero-knowledge proofs remain too computationally intense. Two alternative proof approaches have been suggested: optimistic mix-net verification and randomized partial checking. Puiggalí et al. proposed a verification method combining these two approaches. This paper investigates their mix-net and proposes a verification method which offers both improved efficiency and more privacy.

Available format(s)
-- withdrawn --
Publication info
Published elsewhere. Unknown where it was published
mix-netefficient verificationbatch verificationprivacyrandomized partial checkingoptimistic mixingeVoting
Contact author(s)
denise demirel @ cased de
2012-02-07: withdrawn
2012-01-14: received
See all versions
Short URL
Creative Commons Attribution
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.