Our Data, Ourselves: Privacy Via Distributed Noise Generation

From MaRDI portal

Publication:3593113

Jump to:navigation, search

DOI10.1007/11761679_29zbMath1140.94336OpenAlexW1557833142MaRDI QIDQ3593113

Cynthia Dwork, Krishnaram Kenthapadi, Ilya Mironov, Moni Naor, Frank McSherry

Publication date: 24 September 2007

Published in: Advances in Cryptology - EUROCRYPT 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11761679_29

Mathematics Subject Classification ID

Database theory (68P15) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items

Phase transitions for support recovery under local differential privacy, A Survey of Differentially Private Regression for Clinical and Epidemiological Research, A data‐based private learning framework for enhanced security against replay attacks in cyber‐physical systems, An accurate, scalable and verifiable protocol for federated differentially private averaging, Reconciling privacy and utility: an unscented Kalman filter-based framework for differentially private machine learning, Privacy-preserving set-based estimation using partially homomorphic encryption, Distribution-invariant differential privacy, Secure sampling with sublinear communication, Privacy amplification for wireless federated learning with Rényi differential privacy and subsampling, A Feasibility Study of Differentially Private Summary Statistics and Regression Analyses with Evaluations on Administrative and Survey Data, Comparing approximate and probabilistic differential privacy parameters, Differentially private range query on shortest paths, Differential privacy: getting more for less, Helmholtz machine with differential privacy, Unnamed Item, Asymmetric Distances for Approximate Differential Privacy, Efficient Simultaneous Broadcast, Inference using noisy degrees: differentially private \(\beta\)-model and synthetic graphs, Limitations of Local Filters of Lipschitz and Monotone Functions, Bandits with switching costs, Online local learning via semidefinite programming, How to use indistinguishability obfuscation, How to delegate computations, Circuits resilient to additive attacks with applications to secure computation, On the existence of extractable one-way functions, Black-box non-black-box zero knowledge, Dichotomies in equilibrium computation, and complementary pivot algorithms for a new class of non-separable utility functions, Query complexity of approximate nash equilibria, Constant rank bimatrix games are PPAD-hard, Approximation algorithms for bipartite matching with metric and geometric costs, Distributed approximation algorithms for weighted shortest paths, Parallel algorithms for geometric graph problems, Fourier PCA and robust tensor decomposition, Smoothed analysis of tensor decompositions, Efficient density estimation via piecewise polynomial approximation, Analytical approach to parallel repetition, A characterization of strong approximation resistance, A strongly polynomial algorithm for generalized flow maximization, Approximate distance oracles with constant query time, Faster all-pairs shortest paths via circuit complexity, Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs, Zig-zag sort, Community detection thresholds and the weak Ramanujan property, Distributed computability in Byzantine asynchronous systems, Multiway cut, pairwise realizable distributions, and descending thresholds, Cluster before you hallucinate, Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing, Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements, Every list-decodable code for high noise has abundant near-optimal rate puncturings, Non-malleable codes from additive combinatorics, Breaking the quadratic barrier for 3-LCC's over the reals, Optimal error rates for interactive coding I, The asymptotic k-SAT threshold, Satisfiability threshold for random regular NAE-SAT, Efficient deterministic approximate counting for low-degree polynomial threshold functions, Communication lower bounds via critical block sensitivity, Computing with a full memory, Hitting sets for multilinear read-once algebraic branching programs, in any order, Lower bounds on the error of query sets under the differentially-private matrix mechanism, A firm foundation for statistical disclosure control, An Improved Private Mechanism for Small Databases, Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region, Communication is Bounded by Root of Rank, Are Lock-Free Concurrent Algorithms Practically Wait-Free?, Robust Protocols for Securely Expanding Randomness and Distributing Keys Using Untrusted Quantum Devices, The Power of Localization for Efficiently Learning Linear Separators with Noise, Separating Computational and Statistical Differential Privacy in the Client-Server Model, Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds, Efficient noise generation to achieve differential privacy with applications to secure multiparty computation, Measured continuous greedy with differential privacy, Fingerprinting Codes and the Price of Approximate Differential Privacy, Unnamed Item, Rejoinder, Comment, A compressive privacy approach to generalized information bottleneck and privacy funnel problems, Model averaging with privacy-preserving, On the properties that characterize privacy, Differentially private high dimensional sparse covariance matrix estimation, Modular control under privacy protection: fundamental trade-offs, Concentrated differentially private average consensus algorithm for a discrete-time network with heterogeneous dynamics, Differentially Private Learning of Geometric Concepts, Distributed differentially private average consensus for multi-agent networks by additive functional Laplace noise, Differential initial-value privacy and observability of linear dynamical systems, Unnamed Item, Differentially private naive Bayes learning over multiple data sources, On the behavioral implications of differential privacy, Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes, An Almost-Optimally Fair Three-Party Coin-Flipping Protocol, Optimal CUR Matrix Decompositions, EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS, The average sensitivity of an intersection of half spaces, Concurrent composition of differential privacy, Comparative study of differentially private data synthesis methods, Learning privately with labeled and unlabeled examples, Differential Privacy on Finite Computers, The optimal upper bound of the number of queries for Laplace mechanism under differential privacy, A smart privacy-preserving learning method by fake gradients to protect users items in recommender systems, Perturbation Paradigms of Maintaining Privacy-Preserving Monotonicity for Differential Privacy, New algorithms and lower bounds for circuits with linear threshold gates, Deciding First-Order Properties of Nowhere Dense Graphs, The Matching Polytope has Exponential Extension Complexity, Preserving differential privacy under finite-precision semantics, Economic efficiency requires interaction, Distributed Private Data Analysis: Simultaneously Solving How and What, Resilient consensus for multi-agent systems subject to differential privacy requirements, Unnamed Item, The Complexity of Computing the Optimal Composition of Differential Privacy, Order-Revealing Encryption and the Hardness of Private Learning, The Geometry of Differential Privacy: The Small Database and Approximate Cases, SPEED: secure, private, and efficient deep learning, Differentially Private Distributed Learning, An optimal \((\epsilon, \delta )\)-differentially private learning of distributed deep fuzzy models, On the power of multiple anonymous messages: frequency estimation and selection in the shuffle model of differential privacy, Minimax optimal goodness-of-fit testing for densities and multinomials under a local differential privacy constraint, Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs, Private non-monotone submodular maximization, A novel fault-tolerant privacy-preserving cloud-based data aggregation scheme for lightweight health data, Pufferfish, Fingerprinting codes and the price of approximate differential privacy, Analyze gauss, Private matchings and allocations, Rounding sum-of-squares relaxations, Constant factor approximation for balanced cut in the PIE model, Entropy, optimization and counting, Polynomial bounds for the grid-minor theorem, An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem, Cops, robbers, and threatening skeletons, Pseudorandom generators with optimal seed length for non-boolean poly-size circuits, On derandomizing algorithms that err extremely rarely, Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas, Lower bounds for depth 4 formulas computing iterated matrix multiplication, The limits of depth reduction for arithmetic formulas, A super-polynomial lower bound for regular arithmetic formulas, A characterization of locally testable affine-invariant properties via decomposition theorems, L _p -testing, Turnstile streaming algorithms might as well be linear sketches, Linear time construction of compressed text indices in compact space, Formulas vs. circuits for small distance connectivity, Toward better formula lower bounds, Breaking the minsky-papert barrier for constant-depth circuits, The sample complexity of revenue maximization, Optimal competitive auctions, Homological product codes, A quantum algorithm for computing the unit group of an arbitrary degree number field, Primal beats dual on online packing LPs in the random-order model, Competitive algorithms from competitive equilibria, Minimum bisection is fixed parameter tractable, An efficient parallel solver for SDD linear systems, Solving SDD linear systems in nearly m log ^1/2 n time, From hierarchical partitions to hierarchical covers, Shortest paths on polyhedral surfaces and terrains, Embedding and canonizing graphs of bounded genus in logspace, Testing surface area with arbitrary accuracy, Coin flipping of any constant bias implies one-way functions, Infinite randomness expansion with a constant number of devices, From average case complexity to improper learning complexity, The Complexity of Differential Privacy, Efficient algorithms for privately releasing marginals via convex relaxations

Uses Software

SuLQ

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3593113&oldid=17005415"