85 search results - page 17 / 17 » stoc 2009 |
ASIACRYPT
2009
Springer
13 years 11 months ago
2009
Springer
We present a new construction of non-committing encryption schemes. Unlike the previous constructions of Canetti et al. (STOC ’96) and of Damg˚ard and Nielsen (Crypto ’00), ou...
CRYPTO
2009
Springer
13 years 11 months ago
2009
Springer
Most of the work in the analysis of cryptographic schemes is concentrated in abstract adversarial models that do not capture side-channel attacks. Such attacks exploit various for...
CRYPTO
2009
Springer
13 years 11 months ago
2009
Springer
The problem of carrying out cryptographic computations when the participating parties are rational in a game-theoretic sense has recently gained much attention. One problem that h...
WDAG
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
ASIACRYPT
2011
Springer
12 years 4 months ago
2011
Springer
A fundamental question in cryptography deals with understanding the role that randomness plays in cryptographic protocols and to what extent it is necessary. One particular line o...