Constant Rounds Almost Linear Complexity Multi-party Computation for Prefix Sum

Kazuma Ohara, Kazuo Ohta, Koutarou Suzuki, Kazuki Yoneyama. Constant Rounds Almost Linear Complexity Multi-party Computation for Prefix Sum. In David Pointcheval, Damien Vergnaud, editors, Progress in Cryptology - AFRICACRYPT 2014 - 7th International Conference on Cryptology in Africa, Marrakesh, Morocco, May 28-30, 2014. Proceedings. Volume 8469 of Lecture Notes in Computer Science, pages 285-299, Springer, 2014. [doi]

@inproceedings{OharaOSY14,
  title = {Constant Rounds Almost Linear Complexity Multi-party Computation for Prefix Sum},
  author = {Kazuma Ohara and Kazuo Ohta and Koutarou Suzuki and Kazuki Yoneyama},
  year = {2014},
  doi = {10.1007/978-3-319-06734-6_18},
  url = {http://dx.doi.org/10.1007/978-3-319-06734-6_18},
  researchr = {https://researchr.org/publication/OharaOSY14},
  cites = {0},
  citedby = {0},
  pages = {285-299},
  booktitle = {Progress in Cryptology - AFRICACRYPT 2014 - 7th International Conference on Cryptology in Africa, Marrakesh, Morocco, May 28-30, 2014. Proceedings},
  editor = {David Pointcheval and Damien Vergnaud},
  volume = {8469},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-06733-9},
}