Cryptology ePrint Archive: Report 2005/199

Verifiable Shuffles: A Formal Model and a Paillier-based 3-Round Construction with Provable Security

Lan Nguyen and Rei Safavi-Naini and Kaoru Kurosawa

Abstract: We propose a formal model for security of verifiable shuffles and a new verifiable shuffle system based on the Paillier encryption scheme, and prove its security in the proposed model. The model is general, so it can be extended to verifiable shuffle decryption and provides a direction for provable security of mix-nets.

Category / Keywords: cryptographic protocols /

Date: received 27 Jun 2005, last revised 10 Sep 2005, withdrawn 28 Nov 2005

Contact author: ldn01 at uow edu au

Available formats: (-- withdrawn --)

Version: 20051128:070503 (All versions of this report)

Discussion forum: Show discussion | Start new discussion