Sciweavers

1662 search results - page 6 / 333
» Privately Finding Specifications
Sort
View
STOC
2001
ACM
119views Algorithms» more  STOC 2001»
14 years 7 months ago
Private approximation of NP-hard functions
d Abstract] Shai Halevi Robert Krauthgamer Eyal Kushilevitz Kobbi Nissim ? The notion of private approximation was introduced recently by Feigenbaum, Fong, Strauss and Wright. Inf...
Shai Halevi, Robert Krauthgamer, Eyal Kushilevitz,...
CRYPTO
1995
Springer
135views Cryptology» more  CRYPTO 1995»
13 years 10 months ago
Committed Oblivious Transfer and Private Multi-Party Computation
Abstract. In this paper we present an eficient protocol for “Committed Oblivious Transfer” to perform oblivious transfer on committed bits: suppose Alice is committed to bits 0...
Claude Crépeau, Jeroen van de Graaf, Alain ...
EUROCRYPT
2000
Springer
13 years 10 months ago
One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval
We show that general one-way trapdoor permutations are sufficient to privately retrieve an entry from a database of size n with total communication complexity strictly less than n....
Eyal Kushilevitz, Rafail Ostrovsky
COOPIS
2002
IEEE
13 years 11 months ago
Finding Trading Partners to Establish Ad-hoc Business Processes
Enabling technology for realizing ad-hoc business processes currently is becoming more and more popular, like for example web services. Ad-hoc business processes are semantically c...
Andreas Wombacher, Bendick Mahleko
WWW
2009
ACM
14 years 7 months ago
Releasing search queries and clicks privately
The question of how to publish an anonymized search log was brought to the forefront by a well-intentioned, but privacy-unaware AOL search log release. Since then a series of ad-h...
Aleksandra Korolova, Krishnaram Kenthapadi, Nina M...