Sciweavers

438 search results - page 52 / 88
» The forest hiding problem
Sort
View
KDD
2006
ACM
128views Data Mining» more  KDD 2006»
16 years 7 days ago
On privacy preservation against adversarial data mining
Privacy preserving data processing has become an important topic recently because of advances in hardware technology which have lead to widespread proliferation of demographic and...
Charu C. Aggarwal, Jian Pei, Bo Zhang 0002
ICC
2007
IEEE
165views Communications» more  ICC 2007»
15 years 6 months ago
Oblivious Keyword Search Protocols in the Public Database Model
— Databases associated with keywords, can be public, private or hybrid, as a result the solutions to keyword search protocols for each type are different. In this paper, we study...
Huafei Zhu, Feng Bao
EUROCRYPT
2001
Springer
15 years 4 months ago
The Bit Security of Paillier's Encryption Scheme and Its Applications
At EuroCrypt’99, Paillier proposed a new encryption scheme based on higher residuosity classes. The new scheme was proven to be one-way under the assumption that computing N-resi...
Dario Catalano, Rosario Gennaro, Nick Howgrave-Gra...
ISCA
2012
IEEE
333views Hardware» more  ISCA 2012»
13 years 2 months ago
Reducing memory reference energy with opportunistic virtual caching
Most modern cores perform a highly-associative translation look aside buffer (TLB) lookup on every memory access. These designs often hide the TLB lookup latency by overlapping it...
Arkaprava Basu, Mark D. Hill, Michael M. Swift
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
15 years 1 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan