2967 search results - page 460 / 594 » Cryptology |
183
click to vote
ASIACRYPT
2009
Springer
16 years 1 months ago
2009
Springer
Computational puzzles are mildly difficult computational problems that require resources (processor cycles, memory, or both) to solve. Puzzles have found a variety of uses in secu...
200
click to vote
ASIACRYPT
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We describe a public-key encryption scheme based on lattices — specifically, based on the hardness of the learning with error (LWE) problem — that is secure against ...
167
click to vote
ASIACRYPT
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Physical attacks on cryptographic implementations and devices have become crucial. In this context a recent line of research on a new class of side-channel attacks, calle...
165
click to vote
ASIACRYPT
2009
Springer
16 years 1 months ago
2009
Springer
The design of cryptographic hash functions is a very complex and failure-prone process. For this reason, this paper puts forward a completely modular and fault-tolerant approach to...
171
click to vote
ASIACRYPT
2009
Springer
16 years 1 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...