2237 search results - page 30 / 448 » On the Security of Random Sources |
DCC
2004
IEEE
15 years 11 months ago
2004
IEEE
In this paper, we build multi-resolution source codes using entropy constrained dithered scalar quantizers. We demonstrate that for n-dimensional random vectors, dithering followe...
119
click to vote
EUROCRYPT
2004
Springer
15 years 3 months ago
2004
Springer
An extended abstract of this paper appears in C. Cachin and J. Camenisch, editors, Advances in Cryptology-EUROCRYPT 2004, volume 3027 of Lecture Notes in Computer Science, pages 22...
112
click to vote
FSE
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. “Hash then encrypt” is an approach to message authentication, where first the message is hashed down using an ε-universal hash function, and then the resulting k-bi...
CRYPTO
2007
Springer
15 years 6 months ago
2007
Springer
An elliptic curve random number generator (ECRNG) has been approved in a NIST standards and proposed for ANSI and SECG draft standards. This paper proves that, if three conjecture...
122
click to vote
DCC
2008
IEEE
15 years 11 months ago
2008
IEEE
In this paper, we formally prove that padding the plaintext with a random bit-string provides the semantic security against chosen plaintext attack (IND-CPA) for the McEliece (and ...