The round complexity of secure protocols

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: D. Beaver Harvard University, Aiken Computation Laboratory, Harvard University, Cambridge, MA 02138
S. Micali MIT, tMIT Laboratory for Computer Science, 545 Technology, Square, Cambridge, MA
P. Rogaway MIT, tMIT Laboratory for Computer Science, 545 Technology, Square, Cambridge, MA
Published in:
· Proceeding
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Pages 503-513
ACM New York, NY, USA ©1990
table of contents ISBN:0-89791-361-2 doi>10.1145/100216.100287
The round complexity of secure protocols Published by ACM 1990 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 6
· Downloads (12 Months): 55
· Downloads (cumulative): 627
· Citation Count: 90


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder