Skip to main content
SpringerLink
Log in

Topics in Cryptology -- CT-RSA 2011

The Cryptographers' Track at the RSA Conference 2011, San Francisco, CA, USA, February 14-18, 2011, Proceedings

  • Conference proceedings
  • © 2011

Overview

Editors:
  1. Aggelos Kiayias

    1. Department of Informatics and Telecommunications, National and Kapodistrian University of Athen, Athens, Greece

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Fast track conference proceedings
  • Unique visibility
  • State of the art research

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 6558)

Part of the book sub series: Security and Cryptology (LNSC)

Included in the following conference series:

Conference proceedings info: CT-RSA 2011.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (25 papers)

  1. Front Matter

    Download chapter PDF

  2. Secure Two-Party Computation

    1. Secure Set Intersection with Untrusted Hardware Tokens

      • Marc Fischlin, Benny Pinkas, Ahmad-Reza Sadeghi, Thomas Schneider, Ivan Visconti
      Pages 1-16

    2. Efficient Secure Two-Party Exponentiation

      • Ching-Hua Yu, Sherman S. M. Chow, Kai-Min Chung, Feng-Hao Liu
      Pages 17-32

  3. Cryptographic Primitives

    1. A General, Flexible and Efficient Proof of Inclusion and Exclusion

      • Kun Peng
      Pages 33-48

    2. Non-interactive Confirmer Signatures

      • Sherman S. M. Chow, Kristiyan Haralambiev
      Pages 49-64

    3. Communication-Efficient 2-Round Group Key Establishment from Pairings

      • Kashi Neupane, Rainer Steinwandt
      Pages 65-76

  4. Side Channel Attacks

    1. Defeating RSA Multiply-Always and Message Blinding Countermeasures

      • Marc F. Witteman, Jasper G. J. van Woudenberg, Federico Menarini
      Pages 77-88

    2. Cryptanalysis of CLEFIA Using Differential Methods with Cache Trace Patterns

      • Chester Rebeiro, Debdeep Mukhopadhyay
      Pages 89-103

    3. Improving Differential Power Analysis by Elastic Alignment

      • Jasper G. J. van Woudenberg, Marc F. Witteman, Bram Bakker
      Pages 104-119

  5. Invited Talk

    1. NSA’s Role in the Development of DES

      • Richard M. George
      Pages 120-120

  6. Authenticated Key Agreement

    1. Designing Efficient Authenticated Key Exchange Resilient to Leakage of Ephemeral Secret Keys

      • Atsushi Fujioka, Koutarou Suzuki
      Pages 121-141

    2. Contributory Password-Authenticated Group Key Exchange with Join Capability

      • Michel Abdalla, Céline Chevalier, Louis Granboulan, David Pointcheval
      Pages 142-160

  7. Proofs of Security

    1. Ideal Key Derivation and Encryption in Simulation-Based Security

      • Ralf Küsters, Max Tuengerthal
      Pages 161-179

    2. Beyond Provable Security Verifiable IND-CCA Security of OAEP

      • Gilles Barthe, Benjamin Grégoire, Yassine Lakhnech, Santiago Zanella Béguelin
      Pages 180-196

    3. (Second) Preimage Attacks on Step-Reduced RIPEMD/RIPEMD-128 with a New Local-Collision Approach

      • Lei Wang, Yu Sasaki, Wataru Komatsubara, Kazuo Ohta, Kazuo Sakiyama
      Pages 197-212

    4. MJH: A Faster Alternative to MDC-2

      • Jooyoung Lee, Martijn Stam
      Pages 213-236

  8. Block Ciphers

    1. Online Ciphers from Tweakable Blockciphers

      • Phillip Rogaway, Haibin Zhang
      Pages 237-249

    2. Meet-in-the-Middle Attacks on Reduced-Round XTEA

      • Gautham Sekar, Nicky Mouha, Vesselin Velichkov, Bart Preneel
      Pages 250-267

  9. Security Notions

    1. Expedient Non-malleability Notions for Hash Functions

      • Paul Baecher, Marc Fischlin, Dominique Schröder
      Pages 268-283

    2. Stronger Difficulty Notions for Client Puzzles and Denial-of-Service-Resistant Protocols

      • Douglas Stebila, Lakshmi Kuppusamy, Jothi Rangasamy, Colin Boyd, Juan Gonzalez Nieto
      Pages 284-301
Back to top

Other volumes

  1. Topics in Cryptology – CT-RSA 2011

Keywords

About this book

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.

Editors and Affiliations

  • Department of Informatics and Telecommunications, National and Kapodistrian University of Athen, Athens, Greece

    Aggelos Kiayias

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation