International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

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

Authors:
Lan Nguyen
Rei Safavi-Naini
Kaoru Kurosawa
Download:
URL: http://eprint.iacr.org/2005/199
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2005-12535,
  title={Verifiable Shuffles: A Formal Model and a Paillier-based 3-Round Construction with Provable Security},
  booktitle={IACR Eprint archive},
  keywords={cryptographic protocols /},
  url={http://eprint.iacr.org/2005/199},
  note={ ldn01@uow.edu.au 13115 received 27 Jun 2005, last revised 10 Sep 2005, withdrawn 28 Nov 2005},
  author={Lan Nguyen and Rei Safavi-Naini and Kaoru Kurosawa},
  year=2005
}