796 search results - page 80 / 160 » The Anonymous Subgraph Problem |
104
Voted
ASIACRYPT
2005
Springer
15 years 6 months ago
2005
Springer
We introduce a new cryptographic primitive called the blind coupon mechanism (BCM). In effect, the BCM is an authenticated bit commitment scheme, which is AND-homomorphic. It has n...
109
click to vote
PET
2010
Springer
15 years 4 months ago
2010
Springer
In this work, we propose a new platform to enable service providers, such as web site operators, on the Internet to block past abusive users of anonymizing networks (for example, T...
91
Voted
ISAAC
1998
Springer
15 years 5 months ago
1998
Springer
Abstract. We study the two-layer planarization problems that have applications in Automatic Graph Drawing. We are searching for a two-layer planar subgraph of maximumweight in a gi...
107
click to vote
SIAMDM
2008
15 years 21 days ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
105
click to vote
ESORICS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. The ubiquity of smartphones and other location-aware handheld devices has resulted in a dramatic increase in popularity of locationbased services (LBS) tailored to user l...