International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction with Perfect Security

Authors:
Chao Ning
Qiuliang Xu
Download:
DOI: 10.1007/978-3-642-25385-0_31
URL: https://www.iacr.org/archive/asiacrypt2011/70730563/70730563.pdf
Search ePrint
Search Google
Conference: ASIACRYPT 2011
BibTeX
@inproceedings{asiacrypt-2011-24116,
  title={Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction with Perfect Security},
  booktitle={ASIACRYPT},
  series={Lecture Notes in Computer Science},
  publisher={Springer},
  volume={7073},
  pages={572-589},
  url={https://www.iacr.org/archive/asiacrypt2011/70730563/70730563.pdf},
  doi={10.1007/978-3-642-25385-0_31},
  author={Chao Ning and Qiuliang Xu},
  year=2011
}