Titlebook: Topics in Cryptology -- CT-RSA 2011; The Cryptographers‘ Aggelos Kiayias Conference proceedings 2011 Springer Berlin Heidelberg 2011 authe

recede

Designing Efficient Authenticated Key Exchange Resilient to Leakage of Ephemeral Secret Keyszyk (eCK) model proposed by LaMacchia, Lauter and Mityagin. To the best of our knowledge, this is the first approach for providing secure protocols based on the condition. With this condition, we propose a construction of two-pass AKE protocols, and the resulting two-pass AKE protocols are construct

Gossamer

indigenous

Ideal Key Derivation and Encryption in Simulation-Based Securityh protocols in a composable way, in this paper we extend an ideal functionality for symmetric and public-key encryption proposed in previous work by a mechanism for key derivation. We also equip this functionality with message authentication codes (MACs), digital signatures, and ideal nonce generati

Ovulation

Beyond Provable Security Verifiable IND-CCA Security of OAEPn years after the introduction of ., we present a machine-checked proof of its security against adaptive chosen-ciphertext attacks under the assumption that the underlying permutation is partial-domain one-way. The proof can be independently verified by running a small and trustworthy proof checker

nerve-sparing

MJH: A Faster Alternative to MDC-2functions, dubbed MJH, are provably collision resistant up to . queries in the iteration..When based on .-bit key blockciphers, our construction provides better provable security than MDC-2, the only known construction of a rate-1/2 double-length hash function based on an .-bit key blockcipher with

符合国情

Online Ciphers from Tweakable BlockciphersDefinitions, constructions, and applications for these objects were first given by Bellare, Boldyreva, Knudsen, and Namprempre. We simplify and generalize their work, showing that online ciphers are rather trivially constructed from tweakable blockciphers, a notion of Liskov, Rivest, and Wagner. We

antenna

indecipherable

Nerve-Block

Stronger Difficulty Notions for Client Puzzles and Denial-of-Service-Resistant Protocolse being granted access to a resource. However, recent client puzzle difficulty definitions (Stebila and Ustaoglu, 2009; Chen et al., 2009) do not ensure that solving . puzzles is . times harder than solving one puzzle. Motivated by examples of puzzles where this is the case, we present stronger defi

Indent

Conference proceedings 2011n February 2011. .The 24 revised full papers presented together with 1 invited lecture were carefully reviewed and selected from 79 submissions. The papers are organized in topical sections on secure two-party computation, cryptographic primitives, side channel attacks, authenticated key agreement,