International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

An Efficient Scheme for Proving a Shuffle

Authors:
Jun Furukawa
Kazue Sako
Download:
DOI: 10.1007/3-540-44647-8_22 (login may be required)
URL: https://iacr.org/archive/crypto2001/21390366.pdf
Search ePrint
Search Google
Conference: CRYPTO 2001
BibTeX
@inproceedings{crypto-2001-1315,
  title={An Efficient Scheme for Proving a Shuffle},
  booktitle={Advances in Cryptology - CRYPTO 2001, 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19-23, 2001, Proceedings},
  series={Lecture Notes in Computer Science},
  publisher={Springer},
  volume={2139},
  pages={368-387},
  url={https://iacr.org/archive/crypto2001/21390366.pdf},
  doi={10.1007/3-540-44647-8_22},
  author={Jun Furukawa and Kazue Sako},
  year=2001
}