Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Topics in Cryptology – CT-RSA 2008

The Cryptographers' Track at the RSA Conference 2008, San Francisco, CA, USA, April 8-11, 2008, Proceedings

  • Conference proceedings
  • © 2008

Overview

Editors:
  1. Tal Malkin
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

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

Included in the following conference series:

Conference proceedings info: CT-RSA 2008.

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 (27 papers)

  1. Front Matter

    Download chapter PDF

  2. Hash Function Cryptanalysis

    1. Security of MD5 Challenge and Response: Extension of APOP Password Recovery Attack

      • Yu Sasaki, Lei Wang, Kazuo Ohta, Noboru Kunihiro
      Pages 1-18

    2. Cryptanalysis of a Hash Function Based on Quasi-cyclic Codes

      • Pierre-Alain Fouque, Gaëtan Leurent
      Pages 19-35

    3. Linear-XOR and Additive Checksums Don’t Protect Damgård-Merkle Hashes from Generic Attacks

      • Praveen Gauravaram, John Kelsey
      Pages 36-51

  3. Cryptographic Building Blocks

    1. Efficient Fully-Simulatable Oblivious Transfer

      • Andrew Y. Lindell
      Pages 52-70

    2. Separation Results on the “One-More” Computational Problems

      • Emmanuel Bresson, Jean Monnerat, Damien Vergnaud
      Pages 71-87

  4. Fairness in Secure Computation

    1. An Efficient Protocol for Fair Secure Two-Party Computation

      • Mehmet S. Kiraz, Berry Schoenmakers
      Pages 88-105

    2. Efficient Optimistic Fair Exchange Secure in the Multi-user Setting and Chosen-Key Model without Random Oracles

      • Qiong Huang, Guomin Yang, Duncan S. Wong, Willy Susilo
      Pages 106-120

    3. Legally-Enforceable Fairness in Secure Two-Party Computation

      • Andrew Y. Lindell
      Pages 121-137

  5. Message Authentication Codes

    1. Security of NMAC and HMAC Based on Non-malleability

      • Marc Fischlin
      Pages 138-154

    2. Aggregate Message Authentication Codes

      • Jonathan Katz, Andrew Y. Lindell
      Pages 155-169

  6. Improved AES Implementations

    1. Boosting AES Performance on a Tiny Processor Core

      • Stefan Tillich, Christoph Herbst
      Pages 170-186

    2. A Fast and Cache-Timing Resistant Implementation of the AES

      • Robert Könighofer
      Pages 187-202

  7. Public Key Encryption with Special Properties

    1. Identity-Based Threshold Key-Insulated Encryption without Random Oracles

      • Jian Weng, Shengli Liu, Kefei Chen, Dong Zheng, Weidong Qiu
      Pages 203-220

    2. CCA2 Secure IBE: Standard Model Efficiency through Authenticated Symmetric Encryption

      • Eike Kiltz, Yevgeniy Vahlis
      Pages 221-238

    3. Public-Key Encryption with Non-interactive Opening

      • Ivan Damgård, Dennis Hofheinz, Eike Kiltz, Rune Thorbek
      Pages 239-255

  8. Side Channel Cryptanalysis

    1. A Vulnerability in RSA Implementations Due to Instruction Cache Analysis and Its Demonstration on OpenSSL

      • Onur Acıiçmez, Werner Schindler
      Pages 256-273

    2. Fault Analysis Study of IDEA

      • Christophe Clavier, Benedikt Gierlichs, Ingrid Verbauwhede
      Pages 274-287

    3. Susceptibility of UHF RFID Tags to Electromagnetic Analysis

      • Thomas Plos
      Pages 288-300

  9. Cryptography for Limited Devices

    1. Online/Offline Signature Schemes for Devices with Limited Computing Capabilities

      • Ping Yu, Stephen R. Tate
      Pages 301-317
Back to top

Other volumes

  1. Topics in Cryptology – CT-RSA 2008

Keywords

About this book

The RSA Conference is the largest regularly-staged computer security event, with over 350 vendors and many thousands of attendees. The Cryptographers’ Track (CT-RSA) is a research conference within the RSA Conference. CT-RSA began in 2001, and has become one of the major established venues for presenting cryptographic research papers to a wide variety of audiences. CT-RSA 2008 was held in San Francisco, California from April 8 to April 11. The proceedings of CT-RSA 2008 contain 26 papers selected from 95 subm- sions pertaining to all aspects of cryptography. Each submission was reviewed by at least three reviewers, which was made possible by the hard work of 27 P- gram Committee members and many external reviewers listed on the following pages. The papers were selected following a detailed online discussion among the Program Committee members. The program included an invited talk by Sha? Goldwasser. The current proceedings include a short abstract of her talk. I would like to express my deep gratitude to the Program Committee m- bers, who volunteered their expertise and hard work over several months, as well as to the external reviewers. Special thanks to Shai Halevi for providing and maintaining the Web review system used for paper submission, reviewing, and ?nal-version preparation. Finally, I would like to thank Burt Kaliski and Ari Juels of RSA Laboratories, as well as the RSA conference team, especially Bree LaBollita, for their assistance throughout the process.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation