Privacy-preserving datamining on vertically partitioned databases
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Data confidentiality: a review of methods for statistical disclosure limitation and methods for assessing privacy
- Privacy, patience, and protection
- Oblivious sampling with applications to two-party k-means clustering
- PCPs and the hardness of generating synthetic data
- Geometrizing rates of convergence under local differential privacy constraints
- Efficient algorithms for privately releasing marginals via convex relaxations
- Privacy and confidentiality in an e-commerce world: data mining, data warehousing, matching and disclosure limitation
- A cubic-wise balance approach for privacy preservation in data cubes.
- Large margin multiclass Gaussian classification with differential privacy
- Noiseless database privacy
- Strong hardness of privacy from weak traitor tracing
- An improved private mechanism for small databases
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- Distributed Private Data Analysis: Simultaneously Solving How and What
- Further results on the security of partitioned dynamic statistical databases
- Denials leak information: simulatable auditing
- Attacks on statistical databases: the highly noisy case
- Privacy preserving data mining
- Fingerprinting codes and the price of approximate differential privacy
- scientific article; zbMATH DE number 6860834 (Why is no real title available?)
- Split leverage: attacking the confidentiality of linked databases by partitioning
- 2-compromise usability in 1-dimensional statistical databases
- Optimal data-independent noise for differential privacy
- The complexity of differential privacy
- 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
- 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: approximating node-capacitated network design and energy efficient routing
- 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 (extended abstract)
- Breaking the quadratic barrier for 3-LCC's over the reals
- Optimal error rates for interactive coding. I: Adaptivity and other settings
- The asymptotic \(k\)-SAT threshold
- Satisfiability threshold for random regular NAE-SAT
- Efficient deterministic approximate counting for low-degree polynomial threshold functions
This page was built for publication: Privacy-preserving datamining on vertically partitioned databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311555)
