1066 search results - page 48 / 214 » Computing Private Set Operations with Linear Complexities |
IACR
2011
13 years 9 months ago
2011
We put forward the notion of targeted malleability: given a homomorphic encryption scheme, in various scenarios we would like to restrict the homomorphic computations one can perf...
WG
1998
Springer
15 years 1 months ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
TOG
2002
14 years 9 months ago
2002
In this paper we present a general method for rapid prototyping of realistic character motion. We solve for the natural motion from a simple animation provided by the animator. Ou...
TCS
2008
14 years 9 months 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 ...
116
click to vote
ICDCS
2012
IEEE
13 years 3 days ago
2012
IEEE
Operational network data, management data such as customer care call logs and equipment system logs, is a very important source of information for network operators to detect prob...