4529 search results - page 132 / 906 » Position Based Cryptography |
173
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Complex systems exhibit emergent patterns of behavior at different levels of organization. Powerful network analysis methods, developed in physics and social sciences, have been s...
178
click to vote
COCO
2005
Springer
15 years 12 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
180
Voted
TCC
2004
Springer
15 years 11 months ago
2004
Springer
Quantum 2-party cryptography differs from its classical counterpart in at least one important way: Given blak-box access to a perfect commitment scheme there exists a secure 1−2...
161
click to vote
CC
2007
Springer
15 years 6 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
151
click to vote
LOCA
2007
Springer
16 years 14 days ago
2007
Springer
We analyze the feasibility of boostrapping a location service through geocoded postal addresses rather than the common wardriving technique. A location service that contains the MA...