Sciweavers

22 search results - page 4 / 5
» Private approximation of NP-hard functions
Sort
View
ECCC
2010
78views more  ECCC 2010»
13 years 5 months ago
PCPs and the Hardness of Generating Synthetic Data
Assuming the existence of one-way functions, we show that there is no polynomial-time, differentially private algorithm A that takes a database D ({0, 1}d )n and outputs a "...
Jonathan Ullman, Salil P. Vadhan
CCS
2006
ACM
13 years 9 months ago
Secure function evaluation with ordered binary decision diagrams
Privacy-preserving protocols allow multiple parties with private inputs to perform joint computation while preserving the privacy of their respective inputs. An important cryptogr...
Louis Kruger, Somesh Jha, Eu-Jin Goh, Dan Boneh
CORR
2010
Springer
142views Education» more  CORR 2010»
13 years 3 months ago
Budget Feasible Mechanisms
We study a novel class of mechanism design problems in which the outcomes are constrained by the payments. This basic class of mechanism design problems captures many common econom...
Christos H. Papadimitriou, Yaron Singer
FOCS
2010
IEEE
13 years 3 months ago
The Limits of Two-Party Differential Privacy
We study differential privacy in a distributed setting where two parties would like to perform analysis of their joint data while preserving privacy for both datasets. Our results ...
Andrew McGregor, Ilya Mironov, Toniann Pitassi, Om...
SIAMDM
2010
113views more  SIAMDM 2010»
13 years 9 days ago
The VPN Problem with Concave Costs
We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...
Samuel Fiorini, Gianpaolo Oriolo, Laura Sanit&agra...