796 search results - page 11 / 160 » The Anonymous Subgraph Problem |
AICT
2006
IEEE
14 years 1 months ago
2006
IEEE
An open problem in structured overlay networks is related to the anonymity to be provided to recipients, namely, those nodes who respond to request messages. Such a feature is of ...
NDSS
1999
IEEE
13 years 11 months ago
1999
IEEE
Anonymity of ballots in electronic voting schemes usually relies on the existence of some kind of anonymous channel between voters and ballot collecting authorities. Currently, th...
SODA
2004
ACM
13 years 8 months ago
2004
ACM
Given an undirected graph, finding either a minimum 2-edge-connected spanning subgraph or a minimum 2vertex-connected (biconnected) spanning subgraph is MaxSNP-hard. We show that ...
CARDIS
2006
Springer
13 years 11 months ago
2006
Springer
In this paper we propose three smartcard-based variants of anonymous authentication using unique one-time pseudonyms. The first variant can be used to authenticate a user. However,...
ESWS
2008
Springer
13 years 9 months ago
2008
Springer
A fundamental problem related to graph structured databases is searching for substructures. One issue with respect to optimizing such searches is the ability to estimate the freque...