Sciweavers

727 search results - page 3 / 146
» Private approximation of search problems
Sort
View
ICDE
2009
IEEE
180views Database» more  ICDE 2009»
14 years 7 months ago
Outsourcing Search Services on Private Spatial Data
Social networking and content sharing service providers, e.g., Facebook and Google Maps, enable their users to upload and share a variety of user-generated content, including locat...
Man Lung Yiu, Gabriel Ghinita, Christian S. Jensen...
PET
2010
Springer
13 years 9 months ago
Private Information Disclosure from Web Searches
As the amount of personal information stored at remote service providers increases, so does the danger of data theft. When connections to remote services are made in the clear and ...
Claude Castelluccia, Emiliano De Cristofaro, Danie...
ICALP
2005
Springer
13 years 11 months ago
New Approaches for Virtual Private Network Design
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo...
EUROCRYPT
2004
Springer
13 years 9 months ago
Efficient Private Matching and Set Intersection
We consider the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain. This problem has m...
Michael J. Freedman, Kobbi Nissim, Benny Pinkas
CORR
2011
Springer
180views Education» more  CORR 2011»
12 years 9 months ago
Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines
We study problems of scheduling jobs on related machines so as to minimize the makespan in the setting where machines are strategic agents. In this problem, each job j has a lengt...
Lisa Fleischer, Zhenghui Wang