Completeness theorems for non-cryptographic fault-tolerant distributed
computation
M. Ben-Or, S. Goldwasser, and A. Wigderson. Proceedings of the twentieth annual ACM symposium on Theory of computing, page 1--10. New York, NY, USA, ACM, (1988)
Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 Ben-Or1988
%A Ben-Or, M.
%A Goldwasser, S.
%A Wigderson, A.
%B Proceedings of the twentieth annual ACM symposium on Theory of computing
%C New York, NY, USA
%D 1988
%I ACM
%K computation computation, multiparty secure
%P 1--10
%T Completeness theorems for non-cryptographic fault-tolerant distributed
computation
@inproceedings{Ben-Or1988,
added-at = {2009-12-14T10:58:50.000+0100},
address = {New York, NY, USA},
author = {Ben-Or, M. and Goldwasser, S. and Wigderson, A.},
biburl = {https://www.bibsonomy.org/bibtex/28d97ffa697fda41d1e71b8629dbe8d52/danfunky},
booktitle = {Proceedings of the twentieth annual ACM symposium on Theory of computing},
file = {Extended Abstract:conference\\ben-or1988.pdf:PDF},
interhash = {705bbbb9df2ae05a3927283c2b6ababa},
intrahash = {8d97ffa697fda41d1e71b8629dbe8d52},
keywords = {computation computation, multiparty secure},
owner = {Funky},
pages = {1--10},
publisher = {ACM},
timestamp = {2009-12-14T10:58:51.000+0100},
title = {Completeness theorems for non-cryptographic fault-tolerant distributed
computation},
year = 1988
}