727 search results - page 4 / 146 » Private approximation of search problems |
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. We propose an authentication scheme where forgery (a.k.a. impersonation) seems infeasible without finding the prover's long-term private key. The latter is equivalen...
EUROCAST
2009
Springer
14 years 4 months ago
2009
Springer
In this paper we present new local search algorithms for the Probabilistic Traveling Salesman Problem (PTSP) using sampling and ad-hoc approximation. These algorithms improve both...
ECCC
2010
13 years 10 months ago
2010
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 "...
ASIACRYPT
1999
Springer
14 years 2 months ago
1999
Springer
Problems of secure communication and computation have been studied extensively in network models. Goldreich, Goldwasser, and Linial, Franklin and Yung, and Franklin and Wright have...
TCC
2012
Springer
12 years 5 months ago
2012
Springer
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...