The following pages link to Theory of Cryptography (Q5898359):
Displayed 50 items.
- Worst- and average-case privacy breaches in randomization mechanisms (Q2517234) (← links)
- Inferring ground truth from crowdsourced data under local attribute differential privacy (Q2661780) (← links)
- Differentially private high dimensional sparse covariance matrix estimation (Q2661783) (← links)
- Differentially private precision matrix estimation (Q2663280) (← links)
- Modular control under privacy protection: fundamental trade-offs (Q2664252) (← links)
- Privacy protection with heavy-tailed noise for linear dynamical systems (Q2665370) (← links)
- Differentially private distributed optimization for multi-agent systems via the augmented Lagrangian algorithm (Q2666749) (← links)
- Differentially private SGD with non-smooth losses (Q2667048) (← links)
- A survey of privacy-preserving mechanisms for heterogeneous data types (Q2668381) (← links)
- Computing payoff allocations in the approximate core of linear programming games in a privacy-preserving manner (Q2670475) (← links)
- Model checking differentially private properties (Q2680992) (← links)
- Differential initial-value privacy and observability of linear dynamical systems (Q2682283) (← links)
- Privacy-preserving dual stochastic push-sum algorithm for distributed constrained optimization (Q2696990) (← links)
- Concurrent composition of differential privacy (Q2697876) (← links)
- Secrecy Without Perfect Randomness: Cryptography with (Bounded) Weak Sources (Q2794527) (← links)
- The Complexity of Computing the Optimal Composition of Differential Privacy (Q2796124) (← links)
- Order-Revealing Encryption and the Hardness of Private Learning (Q2796125) (← links)
- Answering $n^2+o(1)$ Counting Queries with Differential Privacy is Hard (Q2805511) (← links)
- The Geometry of Differential Privacy: The Small Database and Approximate Cases (Q2805515) (← links)
- Towards Privacy-Preserving Data Mining in Online Social Networks: Distance-Grained and Item-Grained Differential Privacy (Q2817460) (← links)
- Practical Fault-Tolerant Data Aggregation (Q2822685) (← links)
- Private Matchings and Allocations (Q2832895) (← links)
- Pufferfish (Q2943562) (← links)
- Authentication in Constrained Settings (Q2947097) (← links)
- Buying Data from Privacy-Aware Individuals: The Effect of Negative Payments (Q2959821) (← links)
- Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes (Q2968149) (← links)
- An Almost-Optimally Fair Three-Party Coin-Flipping Protocol (Q2968163) (← links)
- Optimal CUR Matrix Decompositions (Q2968164) (← links)
- EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS (Q2971052) (← links)
- Large Margin Multiclass Gaussian Classification with Differential Privacy (Q3003503) (← links)
- Protecting Privacy in Data Release (Q3092170) (← links)
- What Can We Learn Privately? (Q3093624) (← links)
- Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region (Q3177756) (← links)
- Communication is Bounded by Root of Rank (Q3177758) (← links)
- Are Lock-Free Concurrent Algorithms Practically Wait-Free? (Q3177807) (← links)
- Robust Protocols for Securely Expanding Randomness and Distributing Keys Using Untrusted Quantum Devices (Q3177810) (← links)
- The Power of Localization for Efficiently Learning Linear Separators with Noise (Q3177877) (← links)
- Separating Computational and Statistical Differential Privacy in the Client-Server Model (Q3179372) (← links)
- Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds (Q3179373) (← links)
- Strong Hardness of Privacy from Weak Traitor Tracing (Q3179374) (← links)
- Smart Contract-Driven Mechanism Design to Mitigate Information Diffusion in Social Networks (Q3294793) (← links)
- Perturbation Paradigms of Maintaining Privacy-Preserving Monotonicity for Differential Privacy (Q3297522) (← links)
- Differentially Private Distributed Learning (Q3386798) (← links)
- Differentially Private Significance Tests for Regression Coefficients (Q3391253) (← links)
- Bounds on the Sample Complexity for Private Learning and Private Data Release (Q3408209) (← links)
- An Improved Private Mechanism for Small Databases (Q3448856) (← links)
- Sample Complexity Bounds on Differentially Private Learning via Communication Complexity (Q3454521) (← links)
- Bloom Filters in Adversarial Environments (Q3457085) (← links)
- Privacy and Truthful Equilibrium Selection for Aggregative Games (Q3460796) (← links)
- How to deal with malicious users in privacy‐preserving distributed data mining (Q3497744) (← links)