You are looking at a specific version 20051128:070503 of this paper.
See the latest version.
Paper 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.
Metadata
- Available format(s)
- -- withdrawn --
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Unknown where it was published
- Contact author(s)
- ldn01 @ uow edu au
- History
- 2005-11-28: withdrawn
- 2005-06-29: received
- See all versions
- Short URL
- https://ia.cr/2005/199
- License
-
CC BY
