Topics In Cryptology -- Ct-rsa 2011: The Cryptographers Track At The Rsa Conference 2011, San Francisco, Ca, Usa, February 14-18, 2011, Proceedings (lecture Notes In Computer Science)

Annotation This book constitutes the refereed proceedings of the Cryptographers' Track at the RSA Conference 2011, CT-RSA 2011, held in San Francisco, CA, USA, in 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, proofs of security, block ciphers, security notions, public-key encryption, crypto tools and parameters, and digital signatures Front Matter....Pages - Secure Set Intersection with Untrusted Hardware Tokens....Pages 1-16 Efficient Secure Two-Party Exponentiation....Pages 17-32 A General, Flexible and Efficient Proof of Inclusion and Exclusion....Pages 33-48 Non-interactive Confirmer Signatures....Pages 49-64 Communication-Efficient 2-Round Group Key Establishment from Pairings....Pages 65-76 Defeating RSA Multiply-Always and Message Blinding Countermeasures....Pages 77-88 Cryptanalysis of CLEFIA Using Differential Methods with Cache Trace Patterns....Pages 89-103 Improving Differential Power Analysis by Elastic Alignment....Pages 104-119 NSA’s Role in the Development of DES....Pages 120-120 Designing Efficient Authenticated Key Exchange Resilient to Leakage of Ephemeral Secret Keys....Pages 121-141 Contributory Password-Authenticated Group Key Exchange with Join Capability....Pages 142-160 Ideal Key Derivation and Encryption in Simulation-Based Security....Pages 161-179 Beyond Provable Security Verifiable IND-CCA Security of OAEP....Pages 180-196 (Second) Preimage Attacks on Step-Reduced RIPEMD/RIPEMD-128 with a New Local-Collision Approach....Pages 197-212 MJH: A Faster Alternative to MDC-2....Pages 213-236 Online Ciphers from Tweakable Blockciphers....Pages 237-249 Meet-in-the-Middle Attacks on Reduced-Round XTEA....Pages 250-267 Expedient Non-malleability Notions for Hash Functions....Pages 268-283 Stronger Difficulty Notions for Client Puzzles and Denial-of-Service-Resistant Protocols....Pages 284-301 On Shortening Ciphertexts: New Constructions for Compact Public Key and Stateful Encryption Schemes....Pages 302-318 Better Key Sizes (and Attacks) for LWE-Based Encryption....Pages 319-339 Binary Huff Curves....Pages 340-355 A Variant of the F4 Algorithm....Pages 356-375 Attribute-Based Signatures....Pages 376-392 Sub-linear Size Traceable Ring Signatures without Random Oracles....Pages 393-415 Back Matter....Pages -