796 search results - page 57 / 160 » The Anonymous Subgraph Problem |
105
click to vote
ICDE
2010
IEEE
15 years 5 months ago
2010
IEEE
-- Publishing person specific data while protecting privacy is an important problem. Existing algorithms that enforce the privacy principle called l-diversity are heuristic based d...
96
Voted
TIME
2006
IEEE
15 years 6 months ago
2006
IEEE
In this paper we extend the notion of k-anonymity in the context of databases with timestamped information in order to naturally define k-anonymous views of temporal data. We als...
INDOCRYPT
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We introduce a new undeniable signature scheme which is existentially unforgeable and anonymous under chosen message attacks in the standard model. The scheme is an embed...
125
click to vote
ICALP
2011
Springer
14 years 4 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
80
Voted
SERSCISA
2009
Springer
15 years 7 months ago
2009
Springer
Node lookup mechanisms constitute an integral part of any overlay network, and hence also of anonymous communication networks. Today, most anonymizers use centralized directories, ...