1446 search results - page 66 / 290 » Local zero knowledge |
111
Voted
ESORICS
2009
Springer
16 years 2 months ago
2009
Springer
In this paper, we propose a novel ID-based secure distance bounding protocol. Unlike traditional secure distance measurement protocols, our protocol is based on standard insecure d...
112
click to vote
EVOW
2010
Springer
15 years 8 months ago
2010
Springer
Discriminating between secreted and membrane proteins is a challenging task. This is particularly true for discriminating between transmembrane segments and signal peptides because...
116
click to vote
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
We consider the problem of constructing efficient locally decodable codes in the presence of a computationally bounded adversary. Assuming the existence of one-way functions, we c...
89
Voted
ICMCS
2006
IEEE
15 years 8 months ago
2006
IEEE
This paper presents a localized coarse-to-fine algorithm for efficient and accurate pedestrian localization and silhouette extraction for the Gait Challenge data sets. The coars...
163
click to vote
TAINN
2005
Springer
15 years 7 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...