scientific article
From MaRDI portal
Publication:3549600
zbMath1232.68047MaRDI QIDQ3549600
Frank McSherry, Cynthia Dwork, Kunal Talwar
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
error-correcting codesprivacy protectionerror ratesstatistical databasepolynomial-time decodable random linear codes
Database theory (68P15) Linear programming (90C05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Decoding (94B35) Error probability in coding theory (94B70)
Related Items (only showing first 100 items - show all)
Federated personalized random forest for human activity recognition ⋮ Confidentiality and differential privacy in the dissemination of frequency tables ⋮ An Improved Private Mechanism for Small Databases ⋮ Sample Complexity Bounds on Differentially Private Learning via Communication Complexity ⋮ 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 ⋮ Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds ⋮ Efficient noise generation to achieve differential privacy with applications to secure multiparty computation ⋮ Secure random sampling in differential privacy ⋮ Privacy and Truthful Equilibrium Selection for Aggregative Games ⋮ Measured continuous greedy with differential privacy ⋮ Fingerprinting Codes and the Price of Approximate Differential Privacy ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The backbone method for ultra-high dimensional sparse machine learning ⋮ Efficient and secure outsourcing of differentially private data publication ⋮ A Survey on Approximation Mechanism Design Without Money for Facility Games ⋮ Differentially Private Learning of Geometric Concepts ⋮ Preserving differential privacy in deep neural networks with relevance-based adaptive noise imposition ⋮ Attacks on statistical databases: the highly noisy case ⋮ Buying Data from Privacy-Aware Individuals: The Effect of Negative Payments ⋮ The Core of the Participatory Budgeting Problem ⋮ Preserving differential privacy in convolutional deep belief networks ⋮ Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes ⋮ An Almost-Optimally Fair Three-Party Coin-Flipping Protocol ⋮ Optimal CUR Matrix Decompositions ⋮ Privacy in implementation ⋮ EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS ⋮ Discrimination- and privacy-aware patterns ⋮ Comparative study of differentially private data synthesis methods ⋮ Learning privately with labeled and unlabeled examples ⋮ Perturbation Paradigms of Maintaining Privacy-Preserving Monotonicity for Differential Privacy ⋮ New algorithms and lower bounds for circuits with linear threshold gates ⋮ Discrete optimization methods for group model selection in compressed sensing ⋮ Optimal data-independent noise for differential privacy ⋮ Deciding First-Order Properties of Nowhere Dense Graphs ⋮ The Matching Polytope has Exponential Extension Complexity ⋮ Differentially private nearest neighbor classification ⋮ Differentially private distance learning in categorical data ⋮ Approximate relational Hoare logic for continuous random samplings ⋮ Efficient money burning in general domains ⋮ Unnamed Item ⋮ Economic efficiency requires interaction ⋮ Distributed Private Data Analysis: Simultaneously Solving How and What ⋮ Processing text for privacy: an information flow perspective ⋮ Truthful Mechanisms with Implicit Payment Computation ⋮ The Geometry of Differential Privacy: The Small Database and Approximate Cases ⋮ The cost of privacy: optimal rates of convergence for parameter estimation with differential privacy ⋮ On the power of multiple anonymous messages: frequency estimation and selection in the shuffle model of differential privacy ⋮ What Can We Learn Privately? ⋮ Differentially private data release via statistical election to partition sequentially ⋮ Privacy, patience, and protection ⋮ Bounds on the Sample Complexity for Private Learning and Private Data Release ⋮ Algorithmic Stability for Adaptive Data Analysis ⋮ Computing (and Life) Is All about Tradeoffs ⋮ 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 ⋮ The Complexity of Differential Privacy ⋮ A differentially private hybrid approach to traffic monitoring ⋮ Low rank matrix recovery with adversarial sparse noise* ⋮ SYLVESTER–GALLAI TYPE THEOREMS FOR APPROXIMATE COLLINEARITY
This page was built for publication:
