International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation

Authors:
Martin Hirt
Jesper Buus Nielsen
Download:
DOI: 10.1007/11593447_5
URL: https://iacr.org/archive/asiacrypt2005/079/079.pdf
Search ePrint
Search Google
Conference: ASIACRYPT 2005
BibTeX
@inproceedings{asiacrypt-2005-288,
  title={Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation},
  booktitle={Advances in Cryptology - ASIACRYPT 2005, 11th International Conference on the Theory and Application of Cryptology and Information Security, Chennai, India, December 4-8, 2005, Proceedings},
  series={Lecture Notes in Computer Science},
  publisher={Springer},
  volume={3788},
  pages={79-99},
  url={https://iacr.org/archive/asiacrypt2005/079/079.pdf},
  doi={10.1007/11593447_5},
  author={Martin Hirt and Jesper Buus Nielsen},
  year=2005
}