1562 search results - page 241 / 313 » Mathematics, Cryptology, Security |
EUROCRYPT
2005
Springer
15 years 3 months ago
2005
Springer
We present a general framework for constructing two-message oblivious transfer protocols using a modification of Cramer and Shoup’s notion of smooth projective hashing (2002). ...
EUROCRYPT
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In the bounded-storage model (BSM) for information-theoretically secure encryption and key-agreement one uses a random string R whose length t is greater than the assumed...
100
click to vote
EUROCRYPT
2003
Springer
15 years 3 months ago
2003
Springer
Classical distributed protocols like broadcast or multi-party computation provide security as long as the number of malicious players f is bounded by some given threshold t, i.e., ...
CHES
2009
Springer
15 years 10 months ago
2009
Springer
We have devised a frequency injection attack which is able to destroy the source of entropy in ring-oscillator-based true random number generators (TRNGs). A TRNG will lock to freq...
CHES
2009
Springer
15 years 10 months ago
2009
Springer
Random delays are a countermeasure against a range of side channel and fault attacks that is often implemented in embedded software. We propose a new method for generation of rando...