D. Beaver, S. Micali, and P. Rogaway. Proceedings of the twenty-second annual ACM symposium on Theory of
computing, page 503--513. New York, NY, USA, ACM, (1990)
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 Beaver1990
%A Beaver, D.
%A Micali, S.
%A Rogaway, P.
%B Proceedings of the twenty-second annual ACM symposium on Theory of
computing
%C New York, NY, USA
%D 1990
%I ACM
%K computation, constant multiparty protocol, rounds secure
%P 503--513
%T The round complexity of secure protocols
@inproceedings{Beaver1990,
added-at = {2009-12-14T10:58:50.000+0100},
address = {New York, NY, USA},
author = {Beaver, D. and Micali, S. and Rogaway, P.},
biburl = {https://www.bibsonomy.org/bibtex/2c721da11eb0b6a43cc76b7afe62866d4/danfunky},
booktitle = {Proceedings of the twenty-second annual ACM symposium on Theory of
computing},
file = {Extended Abstract:conference\\beaver1990.pdf:PDF},
interhash = {f79c259a8ba57f5fd2e7732ebcfa2b3f},
intrahash = {c721da11eb0b6a43cc76b7afe62866d4},
keywords = {computation, constant multiparty protocol, rounds secure},
owner = {Funky},
pages = {503--513},
publisher = {ACM},
timestamp = {2009-12-14T10:58:51.000+0100},
title = {The round complexity of secure protocols},
year = 1990
}