Sciweavers

Share
5 search results - page 1 / 1
» ctrsa 2011
Sort
View
CTRSA
2011
Springer
243views Cryptology» more  CTRSA 2011»
7 years 9 months ago
Better Key Sizes (and Attacks) for LWE-Based Encryption
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...
Richard Lindner, Chris Peikert
CTRSA
2011
Springer
189views Cryptology» more  CTRSA 2011»
7 years 9 months ago
Online Ciphers from Tweakable Blockciphers
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...
Phillip Rogaway, Haibin Zhang
CTRSA
2011
Springer
189views Cryptology» more  CTRSA 2011»
7 years 9 months ago
Ideal Key Derivation and Encryption in Simulation-Based Security
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...
Ralf Küsters, Max Tuengerthal
CTRSA
2011
Springer
223views Cryptology» more  CTRSA 2011»
7 years 9 months ago
Expedient Non-malleability Notions for Hash Functions
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...
Paul Baecher, Marc Fischlin, Dominique Schröd...
IACR
2011
104views more  IACR 2011»
7 years 6 months ago
Short Transitive Signatures for Directed Trees
A transitive signature scheme allows to sign a graph in such a way that, given the signatures of edges (a, b) and (b, c), it is possible to compute the signature for the edge (or ...
Philippe Camacho, Alejandro Hevia
books