The following pages link to (Q3549600):
Displayed 50 items.
- Attacks on statistical databases: the highly noisy case (Q396611) (← links)
- Optimal data-independent noise for differential privacy (Q497639) (← links)
- Efficient money burning in general domains (Q506525) (← links)
- Confidentiality and differential privacy in the dissemination of frequency tables (Q1630396) (← links)
- Preserving differential privacy in convolutional deep belief networks (Q1698868) (← links)
- Privacy in implementation (Q1703368) (← links)
- Discrimination- and privacy-aware patterns (Q1715918) (← links)
- Differentially private nearest neighbor classification (Q1741355) (← links)
- Approximate relational Hoare logic for continuous random samplings (Q1744393) (← links)
- Processing text for privacy: an information flow perspective (Q2024330) (← links)
- The cost of privacy: optimal rates of convergence for parameter estimation with differential privacy (Q2054532) (← links)
- On the power of multiple anonymous messages: frequency estimation and selection in the shuffle model of differential privacy (Q2056803) (← links)
- Differentially private data release via statistical election to partition sequentially (Q2061387) (← links)
- Privacy, patience, and protection (Q2068909) (← links)
- A differentially private hybrid approach to traffic monitoring (Q2117054) (← links)
- Federated personalized random forest for human activity recognition (Q2130143) (← links)
- Efficient noise generation to achieve differential privacy with applications to secure multiparty computation (Q2145393) (← links)
- Secure random sampling in differential privacy (Q2148768) (← links)
- Measured continuous greedy with differential privacy (Q2151374) (← links)
- The backbone method for ultra-high dimensional sparse machine learning (Q2163249) (← links)
- Efficient and secure outsourcing of differentially private data publication (Q2167751) (← links)
- Preserving differential privacy in deep neural networks with relevance-based adaptive noise imposition (Q2185767) (← links)
- Comparative study of differentially private data synthesis methods (Q2218047) (← links)
- Learning privately with labeled and unlabeled examples (Q2223696) (← links)
- Discrete optimization methods for group model selection in compressed sensing (Q2235146) (← links)
- Differentially private distance learning in categorical data (Q2238340) (← links)
- Truthful Mechanisms with Implicit Payment Computation (Q2796397) (← links)
- The Geometry of Differential Privacy: The Small Database and Approximate Cases (Q2805515) (← links)
- Computing (and Life) Is All about Tradeoffs (Q2848971) (← links)
- SYLVESTER–GALLAI TYPE THEOREMS FOR APPROXIMATE COLLINEARITY (Q2879416) (← links)
- A Survey on Approximation Mechanism Design Without Money for Facility Games (Q2942465) (← links)
- Pufferfish (Q2943562) (← links)
- Buying Data from Privacy-Aware Individuals: The Effect of Negative Payments (Q2959821) (← links)
- The Core of the Participatory Budgeting Problem (Q2959845) (← 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)
- 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)
- Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds (Q3179373) (← links)
- Perturbation Paradigms of Maintaining Privacy-Preserving Monotonicity for Differential Privacy (Q3297522) (← 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)