796 search results - page 50 / 160 » The Anonymous Subgraph Problem |
130
click to vote
ASIACRYPT
2008
Springer
15 years 4 months ago
2008
Springer
In this paper, we show that two variants of Stern's identification scheme [IEEE Transaction on Information Theory '96] are provably secure against concurrent attack unde...
116
click to vote
EDBT
2008
ACM
16 years 2 months ago
2008
ACM
Retrieving related graphs containing a query graph from a large graph database is a key issue in many graph-based applications, such as drug discovery and structural pattern recog...
121
click to vote
CORR
2012
Springer
13 years 10 months ago
2012
Springer
We consider Location-based Service (LBS) settings, where a LBS provider logs the requests sent by mobile device users over a period of time and later wants to publish/share these ...
129
click to vote
P2P
2006
IEEE
15 years 8 months ago
2006
IEEE
Peer discovery and route set-up are an integral part of the processes by which anonymizing peer-to-peer systems are made secure. When systems are large, and individual nodes only ...
125
click to vote
SODA
2001
ACM
15 years 3 months ago
2001
ACM
We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...