Faster private release of marginals on small databases
From MaRDI portal
Publication:2988893
DOI10.1145/2554797.2554833zbMath1364.68153arXiv1304.3754OpenAlexW2124500503MaRDI QIDQ2988893
Andrew Wan, Karthekeyan Chandrasekaran, Justin Thaler, Jonathan R. Ullman
Publication date: 19 May 2017
Published in: Proceedings of the 5th conference on Innovations in theoretical computer science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.3754
Related Items (only showing first 100 items - show all)
Approximate Degree, Secret Sharing, and Concentration Phenomena ⋮ Hitting sets for multilinear read-once algebraic branching programs, in any order ⋮ 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 ⋮ Approximate Degree in Classical and Quantum Computing ⋮ Fingerprinting Codes and the Price of Approximate Differential Privacy ⋮ A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$ ⋮ 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 ⋮ PCPs and the hardness of generating synthetic data ⋮ Algorithmic Polynomials ⋮ Differential Privacy on Finite Computers ⋮ 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 ⋮ The hardest halfspace ⋮ Economic efficiency requires interaction ⋮ Order-Revealing Encryption and the Hardness of Private Learning ⋮ 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 ⋮ 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
Cites Work
- Unnamed Item
- A hierarchy of polynomial time lattice basis reduction algorithms
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- (Leveled) fully homomorphic encryption without bootstrapping
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Trapdoors for hard lattices and new cryptographic constructions
- Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness
- Evaluating Branching Programs on Encrypted Data
- Bounds for Width Two Branching Programs
- Fully homomorphic encryption using ideal lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
- New lattice-based cryptographic constructions
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- On lattices, learning with errors, random linear codes, and cryptography
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Faster private release of marginals on small databases
