The following pages link to Theory of Cryptography (Q5898359):
Displayed 50 items.
- Population recovery and partial identification (Q255358) (← links)
- Lower bounds on the error of query sets under the differentially-private matrix mechanism (Q269340) (← links)
- Limits on the usefulness of random oracles (Q290382) (← links)
- Denials leak information: simulatable auditing (Q394747) (← links)
- Differential privacy based on importance weighting (Q399916) (← links)
- Simulation extrapolation estimation in parametric models with Laplace measurement error (Q470488) (← links)
- Optimal data-independent noise for differential privacy (Q497639) (← links)
- Perturbation of convex risk minimization and its application in differential private learning algorithms (Q504548) (← links)
- Preserving differential privacy under finite-precision semantics (Q507371) (← links)
- Data confidentiality: a review of methods for statistical disclosure limitation and methods for assessing privacy (Q1950328) (← links)
- Bounds on the sample complexity for private learning and private data release (Q2251471) (← links)
- Statistical active learning algorithms for noise tolerance and differential privacy (Q2345952) (← links)
- Selling privacy at auction (Q2347786) (← links)
- Efficient algorithms for privately releasing marginals via convex relaxations (Q2349860) (← links)
- Perturbed robust linear estimating equations for confidentiality protection in remote analysis (Q2361456) (← links)
- Differentially private average consensus: obstructions, trade-offs, and optimal algorithm design (Q2409238) (← links)
- A lower bound on the release of differentially private integer partitions (Q2410571) (← links)
- On some connections between statistics and cryptology (Q2437860) (← links)
- Worst- and average-case privacy breaches in randomization mechanisms (Q2517234) (← 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)
- 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)
- Privacy and Truthful Equilibrium Selection for Aggregative Games (Q3460796) (← links)
- How to deal with malicious users in privacy‐preserving distributed data mining (Q3497744) (← links)