44 search results - page 4 / 9 » eurocrypt 2008 |
163
click to vote
EUROCRYPT
2008
Springer
15 years 8 months ago
2008
Springer
We provide attacks and analysis that capture a tradeoff, in the ideal-permutation model, between the speed of a permutation-based hash function and its potential security. For coll...
178
click to vote
EUROCRYPT
2008
Springer
15 years 8 months ago
2008
Springer
A shuffle of a set of ciphertexts is a new set of ciphertexts with the same plaintexts in permuted order. Shuffles of homomorphic encryptions are a key component in mix-nets, whic...
186
click to vote
EUROCRYPT
2008
Springer
15 years 8 months ago
2008
Springer
In the model of perfectly secure message transmission schemes (PSMTs), there are n channels between a sender and a receiver. An infinitely powerful adversary A may corrupt (observe...
151
click to vote
EUROCRYPT
2008
Springer
15 years 8 months ago
2008
Springer
Abstract--We consider the use of threshold signatures in adhoc and dynamic groups such as MANETs ("mobile ad-hoc networks"). We first show that known threshold RSA signat...
160
click to vote
EUROCRYPT
2010
Springer
15 years 10 months ago
2010
Springer
At CRYPTO 2008 Stam [7] made the following conjecture: if an m + s-bit to s-bit compression function F makes r calls to a primitive f of n-bit input, then a collision for F can be ...