Kobbi Nissim

According to our database1, Kobbi Nissim authored at least 79 papers between 1999 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Practical Locally Private Heavy Hitters.
J. Mach. Learn. Res., 2020

Private Summation in the Multi-Message Shuffle Model.
CoRR, 2020

The Power of Synergy in Differential Privacy: Combining a Small Curator with Local Randomizers.
Proceedings of the 1st Conference on Information-Theoretic Cryptography, 2020

The Complexity of Verifying Loop-Free Programs as Differentially Private.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019
Concentration Bounds for High Sensitivity Functions Through Differential Privacy.
J. Priv. Confidentiality, 2019

Simultaneous Private Learning of Multiple Concepts.
J. Mach. Learn. Res., 2019

Characterizing the Sample Complexity of Pure Private Learners.
J. Mach. Learn. Res., 2019

The Complexity of Verifying Circuits as Differentially Private.
CoRR, 2019

Improved Summation from Shuffling.
CoRR, 2019

Differentially Private Summation with Multi-Message Shuffling.
CoRR, 2019

Towards Formalizing the GDPR's Notion of Singling Out.
CoRR, 2019

The Privacy Blanket of the Shuffle Model.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

Private Center Points and Learning of Halfspaces.
Proceedings of the Conference on Learning Theory, 2019

Exploring Differential Obliviousness.
Proceedings of the Approximation, 2019

2018
Segmentation, Incentives, and Privacy.
Math. Oper. Res., 2018

Computational Two-Party Correlation.
Electronic Colloquium on Computational Complexity (ECCC), 2018

Linear Program Reconstruction in Practice.
CoRR, 2018

The Limits of Post-Selection Generalization.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

Clustering Algorithms for the Centralized and Local Models.
Proceedings of the Algorithmic Learning Theory, 2018

2017
Accessing Data while Preserving Privacy.
CoRR, 2017

Private Incremental Regression.
Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017

2016
Mechanism Design and Differential Privacy.
Encyclopedia of Algorithms, 2016

Private Learning and Sanitization: Pure vs. Approximate Differential Privacy.
Theory Comput., 2016

Calibrating Noise to Sensitivity in Private Data Analysis.
J. Priv. Confidentiality, 2016

Efficient Set Intersection with Simulation-Based Security.
J. Cryptology, 2016

PSI (Ψ): a Private data Sharing Interface.
CoRR, 2016

Algorithmic stability for adaptive data analysis.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Locating a Small Cluster Privately.
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

Adaptive Learning with Robust Generalization Guarantees.
Proceedings of the 29th Conference on Learning Theory, 2016

Generic Attacks on Secure Outsourced Databases.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2015
GRECS: Graph Encryption for Approximate Shortest Distance Queries.
IACR Cryptol. ePrint Arch., 2015

Learning Privately with Labeled and Unlabeled Examples.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Differentially Private Release and Learning of Threshold Functions.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Fair Information Sharing for Treasure Hunting.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Impossibility of Differentially Private Universally Optimal Mechanisms.
SIAM J. Comput., 2014

Bounds on the sample complexity for private learning and private data release.
Mach. Learn., 2014

Redrawing the boundaries on purchasing data from privacy-sensitive individuals.
Proceedings of the Innovations in Theoretical Computer Science, 2014

2013
Denials leak information: Simulatable auditing.
J. Comput. Syst. Sci., 2013

Attacks on statistical databases: The highly noisy case.
Inf. Process. Lett., 2013

Analyzing Graphs with Node Differential Privacy.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Characterizing the sample complexity of private learners.
Proceedings of the Innovations in Theoretical Computer Science, 2013

2012
Efficient Set Operations in the Presence of Malicious Adversaries.
J. Cryptology, 2012

Hiding the Input-Size in Secure Two-Party Computation.
IACR Cryptol. ePrint Arch., 2012

Privacy-aware mechanism design.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Approximately optimal mechanism design via differential privacy.
Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

2011
What Can We Learn Privately?
SIAM J. Comput., 2011

2010
How Should We Solve Search Problems Privately?
J. Cryptology, 2010

Bounds on the Sample Complexity for Private Learning and Private Data Release.
Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

2009
First Issue Editorial.
J. Priv. Confidentiality, 2009

Private Approximation of Clustering and Vertex Cover.
Comput. Complex., 2009

Private coresets.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

2008
Private Data Analysis via Output Perturbation - A Rigorous Approach to Constructing Sanitizers and Privacy Preserving Algorithms.
Proceedings of the Privacy-Preserving Data Mining - Models and Algorithms, 2008

Distributed Private Data Analysis: Simultaneously Solving How and What.
Proceedings of the Advances in Cryptology, 2008

2007
Communication vs. Computation.
Comput. Complex., 2007

Smooth sensitivity and sampling in private data analysis.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

2006
Secure multiparty computation of approximations.
ACM Trans. Algorithms, 2006

Hard Instances of the Constrained Discrete Logarithm Problem.
IACR Cryptol. ePrint Arch., 2006

Communication Efficient Secure Linear Algebra.
Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

2005
Private Approximation of Search Problems
Electronic Colloquium on Computational Complexity (ECCC), 2005

Evaluating 2-DNF Formulas on Ciphertexts.
Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

Simulatable auditing.
Proceedings of the Twenty-fourth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2005

Practical privacy: the SuLQ framework.
Proceedings of the Twenty-fourth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2005

2004
Firmato: A novel firewall management toolkit.
ACM Trans. Comput. Syst., 2004

Communication Versus Computation.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Efficient Private Matching and Set Intersection.
Proceedings of the Advances in Cryptology, 2004

Privacy-Preserving Datamining on Vertically Partitioned Databases.
Proceedings of the Advances in Cryptology, 2004

2003
On Cutting a Few Vertices from a Graph.
Discret. Appl. Math., 2003

Revealing information while preserving privacy.
Proceedings of the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2003

Extending Oblivious Transfers Efficiently.
Proceedings of the Advances in Cryptology, 2003

2001
Communication Complexity and Secure Function Evaluation
Electronic Colloquium on Computational Complexity (ECCC), 2001

Communication preserving protocols for secure function evaluation.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Private approximation of NP-hard functions.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

2000
Certificate revocation and certificate update.
IEEE J. Sel. Areas Commun., 2000

Approximating the minimum bisection size (extended abstract).
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

On the hardness of approximating N P witnesses.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2000

1999
On the Security of Pay-per-Click and Other Web Advertising Schemes.
Comput. Networks, 1999

Firmato: A Novel Firewall Management Toolkit.
Proceedings of the 1999 IEEE Symposium on Security and Privacy, 1999

Efficient Communication-Storage Tradeoffs for Multicast Encryption.
Proceedings of the Advances in Cryptology, 1999


  Loading...