158
click to vote
CTRSA
14 years 15 days ago
2011 Springer 
We analyze the concrete security and key sizes of theoretically sound lattice-based encryption schemes based on the “learning with errors” (LWE) problem. Our main contribution...
105
click to vote
CTRSA
14 years 15 days ago
2011 Springer 
Non-malleability of a cryptographic primitive is a fundamental security property which ensures some sort of independence of cryptographic values. The notion has been extensively st...
120
click to vote
CTRSA
14 years 15 days ago
2011 Springer
Abstract. Many real-world protocols, such as SSL/TLS, SSH, IPsec, IEEE 802.11i, DNSSEC, and Kerberos, derive new keys from other keys. To be able to analyze such protocols in a com...
110
click to vote
CTRSA
14 years 15 days ago
2011 Springer
Abstract. Online ciphers are deterministic length-preserving permutations EK : ({0, 1}n )+ → ({0, 1}n )+ where the i-th block of ciphertext depends only on the first i blocks of...
|
Cryptology