SIGN IN
SIGN UP
Secure multiparty computation of approximations
Full Text:
Pdf
Buy this Article
Authors:
Joan Feigenbaum
Yale University, New Haven, CT
Yuval Ishai
Technion, Haifa, Israel
Tal Malkin
Columbia University, New York, NY
Kobbi Nissim
Ben-Gurion University, Beer Sheva, Israel
Martin J. Strauss
University of Michigan, Ann Arbor, MI
Rebecca N. Wright
Stevens Institute of Technology, Hoboken, NJ
2006 Article
Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 51
· Downloads (cumulative): 711
· Citation Count: 22
Published in:
· Journal
ACM Transactions on Algorithms (TALG)
TALG Homepage
archive
Volume 2 Issue 3, July 2006
Pages 435 - 472
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1159892.1159900
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
analysis of algorithms and problem complexity
distributed data processing
privacy
security
sublinear communication
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder