CRYPTO
2006
Springer
13 years 8 months ago
2006
Springer
There are several candidate semantically secure encryption schemes, yet in many applications non-malleability of encryptions is crucial. We show how to transform any semantically s...
CSFW
2010
IEEE
13 years 8 months ago
2010
IEEE
—We establish formal bounds for the number of min-entropy bits that can be extracted in a timing attack against a cryptosystem that is protected by blinding, the state-of-the art...
PKC
1999
Springer
13 years 8 months ago
1999
Springer
This paper presents a simple and efficient conversion from a semantically secure public-key encryption scheme against passive adversaries to a non-malleable (or semantically secure...