- Sublinear Algorithms for Approximating String Compressibility
- Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem
- Differential Privacy for Statistics: What we Know and What we Want to Learn
- Research Statement --Adam Smith Cryptography is, broadly, the science of communication and computing in the presence of a malicious
- What Can We Learn Privately? Shiva Prasad Kasiviswanathan
- Calibrating Noise to Sensitivity in Private Data Cynthia Dwork1
- Differentially Private Combinatorial Optimization Anupam Gupta Katrina Ligett Frank McSherry Aaron Roth Kunal Talwar
- A Learning Theory Approach to Non-Interactive Database Privacy
- Boosting the Accuracy of Differentially Private Histograms Through Consistency
- Revealing Information while Preserving Privacy Irit Dinur Kobbi Nissim
- Practical Privacy: The SuLQ Framework Avrim Blum, Cynthia Dwork, Frank McSherry, and Kobbi Nissim
- Composition Attacks and Auxiliary Information in Data Srivatsava Ranjit Ganta
- New Efficient Attacks on Statistical Disclosure Control Mechanisms
- On the Geometry of Differential Privacy Moritz Hardt
- Privacy-preserving logistic regression Kamalika Chaudhuri
- Approximate Testing of Visual Properties Sofya Raskhodnikova 1
- Sublinear Algorithms for Approximating String Compressibility and the Distribution Support Size
- A Note on Adaptivity in Testing Properties of Bounded Degree Graphs
- Monotonicity Testing Sofya Raskhodnikova
- Lower Bounds for Embeddings of Edit Distance into Normed Spaces ENS, France
- A Sublinear Algorithm for Weakly Approximating Edit gkan Batu #
- Monotonicity testing over general poset domains [Extended Abstract]
- Improved Testing Algorithms for Monotonicity Yevgeniy Dodis \Lambda Oded Goldreich y Eric Lehman z Sofya Raskhodnikova x
- Property Testing: Theory and Applications Sofya Raskhodnikova
- Approximate Testing of Visual Properties Sofya Raskhodnikova1
- Private Analysis of Graph Structure Vishesh Karwa, Sofya Raskhodnikova, Adam Smith, Grigory Yaroslavtsev
- Shame on Trust in Distributed Systems Trent Jaeger, Patrick McDaniel, Luke St. Clair
- Deformed Lattice Detection in Real-World Images Using Mean-Shift Belief Propagation
- Algebraic geometry of 2 2 contingency tables Aleksandra B. Slavkovic
- Scrambling Adversarial Errors Using Few Random Bits, Optimal Information Reconciliation,
- Monotonicity testing over general poset domains [Extended Abstract]
- Shiva Prasad Kasiviswanathan IBM T.J. Watson Research Center Phone: +1-(814)-404-6946
- Smooth Sensitivity and Sampling in Private Data Analysis Kobbi Nissim
- Non-Volatile Memory and Disks: Avenues for Policy Architectures
- Presidential Management Fellows (PMF) Program--Nomination Request Form Office of Graduate Fellowships and Awards Administration; 209 Kern Graduate Building, University Park, PA 16802; 814-865-2514; 814-863-1091 (fax)
- Improved Approximation for the Directed Spanner Piotr Bermana
- CSE 598D / STAT 598B: Data Privacy Course Announcement
- From Trusted to Secure: Building and Executing Applications that Enforce System Security
- Towards a Secure and Efficient System for End-to-End Provenance Patrick McDaniel, Kevin Butler,
- Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
- Graham Endowed Fellowship--IGDP Nomination Form Office of Graduate Fellowships and Awards Administration; 209 Kern Building, University Park, PA 16802; 814-865-2514; 814-863-1091 (fax)
- Transitive-Closure Spanners Arnab Bhattacharyya
- Valid Statistical Analysis for Logistic Regression with Multiple Sources
- Design, Implementation and Evaluation of Security in iSCSI-based Network Storage Systems
- Property Testing: Theory and Applications Sofya Raskhodnikova
- Differential Privacy for Clinical Trial Data: Preliminary Evaluations
- Partial Information Releases for Confidential Contingency Table Entries: Present and Future Research Efforts
- Sublinear Algorithms for Approximating String Compressibility
- Finding Sparser Directed Spanners Piotr Berman1
- Approximation Algorithms for Min-Max Generalization Problems
- Sublinear Algorithms for Approximating String Compressibility and the Distribution Support Size
- Mitigating Attacks on Open Functionality in SMS-Capable Cellular Networks
- Submitted to the Annals of Applied Statistics CAUSAL INFERENCE IN TRANSPORTATION SAFETY
- Stephen E. McLaughlin Computer Science and Engineering Pennsylvania State University
- Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure
- A Survey of Statistical Approaches to Preserving Confidentiality of Contingency Table Entries
- "Secure" Logistic Regression of Horizontally and Vertically Partitioned Distributed Databases
- Statistical disclosure limitation (SDL) and confidentiality have
- Exploiting Open Functionality in SMS-Capable Cellular William Enck, Patrick Traynor, Patrick McDaniel, and Thomas La Porta
- Bunton-Waller Graduate Awards Program-for IGDPs Office of Graduate Fellowships and Awards Administration; 209 Kern Building, University Park, PA 16802; 814-865-2514; 814-863-1091 (fax) U.Ed.GRD08-13
- IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. ?, NO. ?, AUG 2009 1 Skewed Rotation Symmetry Group Detection
- USENIX Association Proceedings of the
- Data Mining and Knowledge Discovery, 11, 155180, 2005 c 2005 Springer Science+Business Media, Inc. Manufactured in The Netherlands.
- A Sublinear Algorithm for Weakly Approximating Edit Tugkan Batu
- A Note on Adaptivity in Testing Properties of Bounded Degree Graphs
- Electronic Journal of Statistics ISSN: 1935-7524
- SIAM J. COMPUT. c 2009 Society for Industrial and Applied Mathematics Vol. 39, No. 3, pp. 813842
- Cold Spring Harbor Asia High Throughput Biology
- Rootkit-Resistant Disks Kevin R. B. Butler, Stephen McLaughlin and Patrick D. McDaniel
- Steiner Transitive-Closure Spanners of Low-Dimensional Posets
- Hamparsum Bozdogan Statistical Data Mining and
- Property Testing Lower Bounds Via Communication Complexity Carnegie Mellon University
- Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem
