Our Data, Ourselves: Privacy Via Distributed Noise Generation
From MaRDI portal
Recommendations
Cites work
- Advances in Cryptology – CRYPTO 2004
- Deterministic Extractors for Bit‐Fixing Sources and Exposure‐Resilient Cryptography
- Deterministic Extractors for Bit‐Fixing Sources by Obtaining an Independent Seed
- Distributed pseudo-random bit generators---a new way to speed-up shared coin tossing
- Foundations of Cryptography
- scientific article; zbMATH DE number 1820017 (Why is no real title available?)
- scientific article; zbMATH DE number 1256768 (Why is no real title available?)
- Randomness is linear in space
- The Byzantine Generals Problem
- Theory of Cryptography
- Theory of Cryptography
- Theory of Cryptography
Cited in
(only showing first 100 items - show all)- A compressive privacy approach to generalized information bottleneck and privacy funnel problems
- SPEED: secure, private, and efficient deep learning
- An optimal (, )-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 (,)-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
- Efficient noise generation to achieve differential privacy with applications to secure multiparty computation
- Measured continuous greedy with differential privacy
- On the properties that characterize privacy
- Distributed differentially private average consensus for multi-agent networks by additive functional Laplace noise
- Differentially private naive Bayes learning over multiple data sources
- On the behavioral implications of differential privacy
- Comparative study of differentially private data synthesis methods
- Learning privately with labeled and unlabeled examples
- 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
- Resilient consensus for multi-agent systems subject to differential privacy requirements
- Efficient algorithms for privately releasing marginals via convex relaxations
- 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
- Differential initial-value privacy and observability of linear dynamical systems
- Lower bounds on the error of query sets under the differentially-private matrix mechanism
- Concurrent composition of differential privacy
- The complexity of computing the optimal composition of differential privacy
- Order-revealing encryption and the hardness of private learning
- Pufferfish: a framework for mathematical privacy definitions
- Separating computational and statistical differential privacy in the client-server model
- Concentrated differential privacy: simplifications, extensions, and lower bounds
- Perturbation paradigms of maintaining privacy-preserving monotonicity for differential privacy
- Differentially Private Distributed Learning
- An improved private mechanism for small databases
- Distributed Private Data Analysis: Simultaneously Solving How and What
- Fingerprinting codes and the price of approximate differential privacy
- The complexity of computing the optimal composition of differential privacy
- Comment
- Rejoinder
- Differential privacy on finite computers
- Predictive learning on hidden tree-structured Ising models
- The complexity of differential privacy
- Preserving differential privacy under finite-precision semantics
- Model averaging with privacy-preserving
- Differentially private learning of geometric concepts
- Simultaneous private learning of multiple concepts
- Fingerprinting codes and the price of approximate differential privacy
- Analyze Gauss: optimal bounds for privacy-preserving principal component analysis
- 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: padded decomposition for minor-free graphs
- 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: an information complexity approach to the KRW composition conjecture
- Breaking the Minsky-Papert barrier for constant-depth circuits
- Economic efficiency requires interaction
- 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: non-clairvoyant scheduling under polyhedral constraints
- 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: optimal fault-tolerant spanners for doubling metrics
- 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
- The average sensitivity of an intersection of half spaces
- From average case complexity to improper learning complexity
- Bandits with switching costs, \(T^{2/3}\) regret
- 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
This page was built for publication: Our Data, Ourselves: Privacy Via Distributed Noise Generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3593113)
