Pages that link to "Item:Q3593113"

The following pages link to Our Data, Ourselves: Privacy Via Distributed Noise Generation (Q3593113):

Displaying 50 items.

• Lower bounds on the error of query sets under the differentially-private matrix mechanism (Q269340) (← links)
• Preserving differential privacy under finite-precision semantics (Q507371) (← links)
• A firm foundation for statistical disclosure control (Q830272) (← links)
• A compressive privacy approach to generalized information bottleneck and privacy funnel problems (Q1661460) (← links)
• SPEED: secure, private, and efficient deep learning (Q2051270) (← links)
• An optimal \((\epsilon, \delta )\)-differentially private learning of distributed deep fuzzy models (Q2055528) (← links)
• On the power of multiple anonymous messages: frequency estimation and selection in the shuffle model of differential privacy (Q2056803) (← links)
• Minimax optimal goodness-of-fit testing for densities and multinomials under a local differential privacy constraint (Q2073228) (← links)
• Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs (Q2089771) (← links)
• Private non-monotone submodular maximization (Q2091093) (← links)
• A novel fault-tolerant privacy-preserving cloud-based data aggregation scheme for lightweight health data (Q2092162) (← links)
• Efficient noise generation to achieve differential privacy with applications to secure multiparty computation (Q2145393) (← links)
• Measured continuous greedy with differential privacy (Q2151374) (← links)
• On the properties that characterize privacy (Q2173173) (← links)
• Distributed differentially private average consensus for multi-agent networks by additive functional Laplace noise (Q2181431) (← links)
• Differentially private naive Bayes learning over multiple data sources (Q2195313) (← links)
• On the behavioral implications of differential privacy (Q2202021) (← links)
• Comparative study of differentially private data synthesis methods (Q2218047) (← links)
• Learning privately with labeled and unlabeled examples (Q2223696) (← links)
• The optimal upper bound of the number of queries for Laplace mechanism under differential privacy (Q2224923) (← links)
• A smart privacy-preserving learning method by fake gradients to protect users items in recommender systems (Q2228145) (← links)
• Resilient consensus for multi-agent systems subject to differential privacy requirements (Q2280733) (← links)
• Efficient algorithms for privately releasing marginals via convex relaxations (Q2349860) (← links)
• Differentially private high dimensional sparse covariance matrix estimation (Q2661783) (← links)
• Modular control under privacy protection: fundamental trade-offs (Q2664252) (← links)
• Concentrated differentially private average consensus algorithm for a discrete-time network with heterogeneous dynamics (Q2667463) (← links)
• Differential initial-value privacy and observability of linear dynamical systems (Q2682283) (← links)
• Concurrent composition of differential privacy (Q2697876) (← links)
• The Complexity of Computing the Optimal Composition of Differential Privacy (Q2796124) (← links)
• Order-Revealing Encryption and the Hardness of Private Learning (Q2796125) (← links)
• The Geometry of Differential Privacy: The Small Database and Approximate Cases (Q2805515) (← links)
• Pufferfish (Q2943562) (← 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)
• 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)
• Perturbation Paradigms of Maintaining Privacy-Preserving Monotonicity for Differential Privacy (Q3297522) (← links)
• Differentially Private Distributed Learning (Q3386798) (← links)
• An Improved Private Mechanism for Small Databases (Q3448856) (← links)
• Distributed Private Data Analysis: Simultaneously Solving How and What (Q3600234) (← links)
• Fingerprinting Codes and the Price of Approximate Differential Privacy (Q4554072) (← links)
• (Q4568112) (← links)
• New algorithms and lower bounds for circuits with linear threshold gates (Q4612481) (← links)