On the Complexity of Additively Homomorphic UC Commitments

Tore Kasper Frederiksen, Thomas P. Jakobsen, Jesper Buus Nielsen, Roberto Trifiletti. On the Complexity of Additively Homomorphic UC Commitments. In Eyal Kushilevitz, Tal Malkin, editors, Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I. Volume 9562 of Lecture Notes in Computer Science, pages 542-565, Springer, 2016. [doi]

@inproceedings{FrederiksenJNT16,
  title = {On the Complexity of Additively Homomorphic UC Commitments},
  author = {Tore Kasper Frederiksen and Thomas P. Jakobsen and Jesper Buus Nielsen and Roberto Trifiletti},
  year = {2016},
  doi = {10.1007/978-3-662-49096-9_23},
  url = {http://dx.doi.org/10.1007/978-3-662-49096-9_23},
  researchr = {https://researchr.org/publication/FrederiksenJNT16},
  cites = {0},
  citedby = {0},
  pages = {542-565},
  booktitle = {Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I},
  editor = {Eyal Kushilevitz and Tal Malkin},
  volume = {9562},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-662-49095-2},
}