International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Efficient, Verifiable Shuffle Decryption and Its Requirement of Unlinkability

Authors:
Jun Furukawa
Download:
DOI: 10.1007/978-3-540-24632-9_23
URL: https://iacr.org/archive/pkc2004/29470317/29470317.pdf
Search ePrint
Search Google
Conference: PKC 2004
BibTeX
@inproceedings{pkc-2004-3340,
  title={Efficient, Verifiable Shuffle Decryption and Its Requirement of Unlinkability},
  booktitle={Public Key Cryptography - PKC 2004, 7th International Workshop on Theory and Practice in Public Key Cryptography, Singapore, March 1-4, 2004},
  series={Lecture Notes in Computer Science},
  publisher={Springer},
  volume={2947},
  pages={319-332},
  url={https://iacr.org/archive/pkc2004/29470317/29470317.pdf},
  doi={10.1007/978-3-540-24632-9_23},
  author={Jun Furukawa},
  year=2004
}