Sciweavers

8825 search results - page 32 / 1765
» All for one or one for all
Sort
View
SIGCOMM
2010
ACM
13 years 7 months ago
Trust no one: a decentralized matching service for privacy in location based services
We propose a new approach to ensure privacy in location based services, without requiring any support from a"trusted" entity. We observe that users of location based ser...
Sharad Jaiswal, Animesh Nandi
ADMA
2005
Springer
144views Data Mining» more  ADMA 2005»
14 years 1 months ago
One Dependence Augmented Naive Bayes
In real-world data mining applications, an accurate ranking is same important to a accurate classification. Naive Bayes (simply NB) has been widely used in data mining as a simple...
Liangxiao Jiang, Harry Zhang, Zhihua Cai, Jiang Su
EUROCRYPT
2010
Springer
14 years 14 days ago
Universal One-Way Hash Functions via Inaccessible Entropy
This paper revisits the construction of Universal One-Way Hash Functions (UOWHFs) from any one-way function due to Rompel (STOC 1990). We give a simpler construction of UOWHFs, whi...
Iftach Haitner, Thomas Holenstein, Omer Reingold, ...
CRYPTO
2009
Springer
82views Cryptology» more  CRYPTO 2009»
14 years 2 months ago
Solving Hidden Number Problem with One Bit Oracle and Advice
In the Hidden Number Problem (HNP), the goal is to find a hidden number s, when given p, g and access to an oracle that on query a returns the k most significant bits of s · ga ...
Adi Akavia
MDM
2010
Springer
152views Communications» more  MDM 2010»
14 years 13 days ago
Finding One-Of Probably Nearest Neighbors with Minimum Location Updates
—Location information is necessarily uncertain when objects are constantly moving. The cost can be high to maintain precise locations at the application server for all the object...
Mitzi McCarthy, Xiaoyang Sean Wang, Zhen He