Universally composable two-party and multi-party secure computation

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Ran Canetti IBM T.J. Watson Research Center, Yorktown Heights, NY
Yehuda Lindell The Weizmann Institute of Science, Rehovot, Israel
Rafail Ostrovsky Telcordia Technologies, Morristown, NJ
Amit Sahai Princeton University, Princeton, NJ
Universally composable two-party and multi-party secure computation Published by ACM 2002 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 84
· Downloads (cumulative): 978
· Citation Count: 140

Published in:
Cover Image
 
· Proceeding
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Pages 494 - 503
ACM New York, NY, USA ©2002
table of contents ISBN:1-58113-495-9 doi>10.1145/509907.509980

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