1100 search results - page 136 / 220 » Approximate distance oracles |
110
click to vote
CRYPTO
2009
Springer
15 years 4 months ago
2009
Springer
We study the design of cryptographic primitives resilient to key-leakage attacks, where an attacker can repeatedly and adaptively learn information about the secret key, subject o...
SRDS
2008
IEEE
15 years 4 months ago
2008
IEEE
Distributed storage systems often use data replication to mask failures and guarantee high data availability. Node failures can be transient or permanent. While the system must ge...
NDSS
2007
IEEE
15 years 4 months ago
2007
IEEE
The need for communication privacy over public networks is of growing concern in today’s society. As a result, privacy-preserving authentication and key exchange protocols have ...
COCO
2003
Springer
15 years 3 months ago
2003
Springer
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...
99
Voted
ASIACRYPT
2010
Springer
14 years 8 months ago
2010
Springer
Blind signatures (BS), introduced by Chaum, have become a cornerstone in privacy-oriented cryptography. Using hard lattice problems, such as the shortest vector problem, as the bas...