Verifiable shuffles: A formal model and a Paillier-based efficient construction with provable security

Abstract

We propose a formal model for security of verifiable shuffles and prove security of a number of recently proposed shuffle schemes in this model. The model is general and can be extended to mix-nets and verifiable shuffle decryption. We propose a new efficient verifiable shuffle system based on Paillier encryption scheme and prove its security in the proposed model. © Springer-Verlag Berlin Heidelberg 2004.