The following pages link to Theory of Cryptography (Q5898359):
Displaying 50 items.
- 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)
- Differential Privacy: A Survey of Results (Q3502629) (← links)
- Our Data, Ourselves: Privacy Via Distributed Noise Generation (Q3593113) (← links)
- Distributed Private Data Analysis: Simultaneously Solving How and What (Q3600234) (← links)
- Fingerprinting Codes and the Price of Approximate Differential Privacy (Q4554072) (← links)
- Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization (Q4575825) (← links)
- TIGHTER BOUNDS FOR THE DISCREPANCY OF BOXES AND POLYTOPES (Q4604484) (← links)
- New algorithms and lower bounds for circuits with linear threshold gates (Q4612481) (← links)
- A Generalized Approach for Social Network Integration and Analysis with Privacy Preservation (Q4631259) (← links)
- (Q4637057) (← links)
- On the Power of Learning from k-Wise Queries (Q4638095) (← links)
- Deciding First-Order Properties of Nowhere Dense Graphs (Q4640289) (← links)
- The Matching Polytope has Exponential Extension Complexity (Q4640350) (← links)
- Minimax Optimal Procedures for Locally Private Estimation (Q4690944) (← links)
- Comment (Q4690948) (← links)
- Comment (Q4690949) (← links)
- Rejoinder (Q4690950) (← links)
- Test Data Reuse for the Evaluation of Continuously Evolving Classification Algorithms Using the Area under the Receiver Operating Characteristic Curve (Q4959463) (← links)
- (Q4969048) (← links)
- Differential Privacy on Finite Computers (Q4993311) (← links)
- Finite Sample Differentially Private Confidence Intervals (Q4993312) (← links)
- Algorithmic Stability for Adaptive Data Analysis (Q4997321) (← links)
- (Q4998902) (← links)
- (Q4998959) (← links)
- Structure and Sensitivity in Differential Privacy: Comparing <i>K</i>-Norm Mechanisms (Q4999171) (← links)
- Privacy-Preserving Parametric Inference: A Case for Robust Statistics (Q4999173) (← links)
