315 search results - page 36 / 63 » Algebraic Lower Bounds for Computing on Encrypted Data |
111
click to vote
TCS
2008
15 years 13 days ago
2008
A time-bound hierarchical key assignment scheme is a method to assign time-dependent encryption keys to a set of classes in a partially ordered hierarchy, in such a way that each ...
84
Voted
VLDB
1997
ACM
15 years 4 months ago
1997
ACM
The cpquantile of an ordered sequenceof data values is the element with rank ‘pn, where n is the total number of values. Accurate estimates of quantiles are required for the sol...
79
Voted
DRM
2007
Springer
15 years 6 months ago
2007
Springer
We introduce a data structure for program execution under a limited oblivious execution model. For fully oblivious execution along the lines of Goldreich and Ostrovsky [2], one tr...
96
Voted
AP2PC
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. The research in the paper is motivated by building a decentralized/P2P XML storage on top of a DHT (Distributed Hash Table). The storage must provide high data availabili...
192
Voted
GIS
2007
ACM
16 years 1 months ago
2007
ACM
The increasingly popular GPS technology and the growing amount of trajectory data it generates create the need for developing applications that efficiently store and query traject...