The following pages link to Kobbi Nissim (Q271587):
Displaying 50 items.
- Efficient set intersection with simulation-based security (Q271588) (← links)
- (Q394746) (redirect page) (← links)
- Denials leak information: simulatable auditing (Q394747) (← links)
- Attacks on statistical databases: the highly noisy case (Q396611) (← links)
- (Q434342) (redirect page) (← links)
- Efficient set operations in the presence of malicious adversaries (Q434343) (← links)
- Private approximation of clustering and vertex cover (Q626661) (← links)
- On cutting a few vertices from a graph (Q1811082) (← links)
- On the round complexity of the shuffle model (Q2119066) (← links)
- Separating adaptive streaming from oblivious streaming using the bounded storage model (Q2128990) (← links)
- Learning privately with labeled and unlabeled examples (Q2223696) (← links)
- Bounds on the sample complexity for private learning and private data release (Q2251471) (← links)
- How should we solve search problems privately? (Q2267364) (← links)
- On the hardness of approximating \({\mathcal N}{\mathcal P}\) witnesses (Q2753732) (← links)
- Simultaneous private learning of multiple concepts (Q2800585) (← links)
- Approximately optimal mechanism design via differential privacy (Q2826057) (← links)
- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy (Q2851871) (← links)
- Hiding the Input-Size in Secure Two-Party Computation (Q2867168) (← links)
- Private approximation of search problems (Q2931376) (← links)
- Secure multiparty computation of approximations (Q2944525) (← links)
- Characterizing the sample complexity of private learners (Q2986862) (← links)
- Redrawing the boundaries on purchasing data from privacy-sensitive individuals (Q2988895) (← links)
- Approximating the minimum bisection size (extended abstract) (Q3192022) (← links)
- Bounds on the Sample Complexity for Private Learning and Private Data Release (Q3408209) (← links)
- Efficient Set Operations in the Presence of Malicious Adversaries (Q3562905) (← links)
- Private Approximation of Clustering and Vertex Cover (Q3596391) (← links)
- Distributed Private Data Analysis: Simultaneously Solving How and What (Q3600234) (← links)
- How Should We Solve Search Problems Privately? (Q3612543) (← links)
- Private Approximation of Search Problems (Q3642862) (← links)
- (Q4250781) (← links)
- (Q4535073) (← links)
- (Q4617630) (← links)
- (Q4969048) (← links)
- Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols (Q5138779) (← links)
- Private coresets (Q5172730) (← links)
- Impossibility of Differentially Private Universally Optimal Mechanisms (Q5173246) (← links)
- Private approximation of NP-hard functions (Q5176013) (← links)
- Communication preserving protocols for secure function evaluation (Q5176017) (← links)
- (Q5214179) (← links)
- (Q5214238) (← links)
- Segmentation, Incentives, and Privacy (Q5219697) (← links)
- Advances in Cryptology - EUROCRYPT 2004 (Q5307243) (← links)
- Advances in Cryptology – CRYPTO 2004 (Q5311555) (← links)
- Learning Privately with Labeled and Unlabeled Examples (Q5363036) (← links)
- Advances in Cryptology - CRYPTO 2003 (Q5428116) (← links)
- Theory of Cryptography (Q5711650) (← links)
- Private learning and sanitization: pure vs. approximate differential privacy (Q5741634) (← links)
- (Q5875525) (← links)
- Theory of Cryptography (Q5898372) (← links)
- Algorithmic Number Theory (Q5899277) (← links)
