510 search results - page 1 / 102 » How Should We Solve Search Problems Privately |
CRYPTO
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
We consider several private database query problems. The starting point of this work is the element rank problem: the server holds a database of n integers, and the user an integer...
AI
2005
Springer
13 years 4 months ago
2005
Springer
Because of privacy concerns, agents may not want to reveal information that could be of use in problem solving. As a result, there are potentially important tradeoffs between main...
AIPS
1998
13 years 6 months ago
1998
The choice of an appropriate problem-solving method, from available methods, is a crucial skill for experts in many areas. We describe a technique for the automatic selection amon...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
Abstract. We proposed a new search heuristic using the scuba diving metaphor. This approach is based on the concept of evolvability and tends to exploit neutrality which exists in ...