Sciweavers

2237 search results - page 46 / 448
» On the Security of Random Sources
Sort
View
CRYPTO
2008
Springer
120views Cryptology» more  CRYPTO 2008»
14 years 11 months ago
The Random Oracle Model and the Ideal Cipher Model Are Equivalent
The Random Oracle Model and the Ideal Cipher Model are two well known idealised models of computation for proving the security of cryptosystems. At Crypto 2005, Coron et al. showed...
Jean-Sébastien Coron, Jacques Patarin, Yann...
CORR
2011
Springer
172views Education» more  CORR 2011»
14 years 4 months ago
Possibilities and impossibilities in Kolmogorov complexity extraction
Randomness extraction is the process of constructing a source of randomness of high quality from one or several sources of randomness of lower quality. The problem can be modeled ...
Marius Zimand
84
Voted
CRYPTO
2009
Springer
119views Cryptology» more  CRYPTO 2009»
15 years 4 months ago
How Risky Is the Random-Oracle Model?
RSA-FDH and many other schemes secure in the Random-Oracle Model (ROM) require a hash function with output size larger than standard sizes. We show that the random-oracle instanti...
Gaëtan Leurent, Phong Q. Nguyen
SP
2003
IEEE
15 years 3 months ago
Random Key Predistribution Schemes for Sensor Networks
Key establishment in sensor networks is a challenging problem because asymmetric key cryptosystems are unsuitable for use in resource constrained sensor nodes, and also because th...
Haowen Chan, Adrian Perrig, Dawn Xiaodong Song
DAM
2006
121views more  DAM 2006»
14 years 9 months ago
Fine-grained forward-secure signature schemes without random oracles
We propose the concept of fine-grained forward-secure signature schemes. Such signature schemes not only provide non-repudiation w.r.t. past time periods the way ordinary forward-...
Jan Camenisch, Maciej Koprowski