2237 search results - page 26 / 448 » On the Security of Random Sources |
CORR
2008
Springer
14 years 12 months ago
2008
Springer
In this work, we consider a distributed source coding problem with a joint distortion criterion depending on the sources and the reconstruction. This includes as a special case the...
ACSAC
2003
IEEE
15 years 5 months ago
2003
IEEE
There is a large gap between the theory and practice for random number generation. For example, on most operating systems, using /dev/random to generate a 256-bit AES key is highl...
129
click to vote
CHES
2011
Springer
13 years 11 months ago
2011
Springer
Randomness extractors are important tools in cryptography. Their goal is to compress a high-entropy source into a more uniform output. Beyond their theoretical interest, they have ...
106
click to vote
ASIACRYPT
2009
Springer
15 years 3 months ago
2009
Springer
Abstract. Public-key encryption schemes rely for their IND-CPA security on per-message fresh randomness. In practice, randomness may be of poor quality for a variety of reasons, le...
CORR
2006
Springer
14 years 12 months ago
2006
Springer
Although good encryption functions are probabilistic, most symbolic models do not capture this aspect explicitly. A typical solution, recently used to prove the soundness of such ...