On the complexity of differentially private data release: efficient algorithms and hardness results

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Cynthia Dwork Microsoft Research SVC, Mountain View, CA, USA
Moni Naor Weizmann Institute of Science, Rehovot, Israel
Omer Reingold Weizmann Institute of Science, Rehovot, Israel
Guy N. Rothblum MIT, Cambridge, MA, USA
Salil Vadhan Harvard University, Cambridge, MA, USA
On the complexity of differentially private data release: efficient algorithms and hardness results Published by ACM 2009 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 69
· Downloads (cumulative): 370
· Citation Count: 25

Published in:
Cover Image
 
· Proceeding
STOC '09 Proceedings of the 41st annual ACM symposium on Theory of computing
Pages 381-390
ACM New York, NY, USA ©2009
table of contents ISBN: 978-1-60558-506-2 doi>10.1145/1536414.1536467

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