Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen. Completeness in two-party secure computation: a computational view. In László Babai, editor, Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004. pages 252-261, ACM, 2004. [doi]
@inproceedings{HarnikNRR04,
title = {Completeness in two-party secure computation: a computational view},
author = {Danny Harnik and Moni Naor and Omer Reingold and Alon Rosen},
year = {2004},
doi = {10.1145/1007352.1007395},
url = {http://doi.acm.org/10.1145/1007352.1007395},
tags = {completeness},
researchr = {https://researchr.org/publication/HarnikNRR04},
cites = {0},
citedby = {0},
pages = {252-261},
booktitle = {Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004},
editor = {László Babai},
publisher = {ACM},
isbn = {1-58113-852-0},
}