Sciweavers

1446 search results - page 238 / 290
» Similarity of Cardinal Directions
Sort
View
TCC
2009
Springer
124views Cryptology» more  TCC 2009»
14 years 8 months ago
Universally Composable Multiparty Computation with Partially Isolated Parties
It is well known that universally composable multiparty computation cannot, in general, be achieved in the standard model without setup assumptions when the adversary can corrupt a...
Ivan Damgård, Jesper Buus Nielsen, Daniel Wi...
PKC
2009
Springer
126views Cryptology» more  PKC 2009»
14 years 8 months ago
Verifiable Rotation of Homomorphic Encryptions
Similar to verifiable shuffling (or, mixing), we consider the problem of verifiable rotating (and random re-encrypting) a given list of homomorphic encryptions. The offset by which...
Sebastiaan de Hoogh, Berry Schoenmakers, Boris Sko...
KDD
2009
ACM
133views Data Mining» more  KDD 2009»
14 years 8 months ago
On the tradeoff between privacy and utility in data publishing
In data publishing, anonymization techniques such as generalization and bucketization have been designed to provide privacy protection. In the meanwhile, they reduce the utility o...
Tiancheng Li, Ninghui Li
PERCOM
2009
ACM
14 years 8 months ago
Mobile Ad Hoc Networks: the DHT paradigm
In this paper, a DHT-based routing protocol which integrates at the network layer both traditional direct routing, i.e. MANET routing, and indirect key-based routing, i.e. P2P rout...
Marcello Caleffi
KDD
2007
ACM
227views Data Mining» more  KDD 2007»
14 years 8 months ago
Fast best-effort pattern matching in large attributed graphs
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
Hanghang Tong, Christos Faloutsos, Brian Gallagher...