CT-RSA 2008: San Francisco, CA, USA

Hash Function Cryptanalysis

• Yu Sasaki, Lei Wang, Kazuo Ohta, Noboru Kunihiro:
  Security of MD5 Challenge and Response: Extension of APOP Password Recovery Attack. 1-18
  
• Pierre-Alain Fouque, Gaëtan Leurent:
  Cryptanalysis of a Hash Function Based on Quasi-cyclic Codes. 19-35
  
• Praveen Gauravaram, John Kelsey:
  Linear-XOR and Additive Checksums Don't Protect Damgård-Merkle Hashes from Generic Attacks. 36-51
  

Cryptographic Building Blocks

• Andrew Y. Lindell:
  Efficient Fully-Simulatable Oblivious Transfer. 52-70
  
• Emmanuel Bresson, Jean Monnerat, Damien Vergnaud:
  Separation Results on the "One-More" Computational Problems. 71-87
  

Fairness in Secure Computation

• Mehmet S. Kiraz, Berry Schoenmakers:
  An Efficient Protocol for Fair Secure Two-Party Computation. 88-105
  
• Qiong Huang, Guomin Yang, Duncan S. Wong, Willy Susilo:
  Efficient Optimistic Fair Exchange Secure in the Multi-user Setting and Chosen-Key Model without Random Oracles. 106-120
  
• Andrew Y. Lindell:
  Legally-Enforceable Fairness in Secure Two-Party Computation. 121-137
  

Message Authentication Codes

• Marc Fischlin:
  Security of NMACand HMACBased on Non-malleability. 138-154
  
• Jonathan Katz, Andrew Y. Lindell:
  Aggregate Message Authentication Codes. 155-169
  

Improved AES Implementations

• Stefan Tillich, Christoph Herbst:
  Boosting AES Performance on a Tiny Processor Core. 170-186
  
• Robert Könighofer:
  A Fast and Cache-Timing Resistant Implementation of the AES. 187-202
  

Public Key Encryption with Special Properties

• Jian Weng, Shengli Liu, Kefei Chen, Dong Zheng, Weidong Qiu:
  Identity-Based Threshold Key-Insulated Encryption without Random Oracles. 203-220
  
• Eike Kiltz, Yevgeniy Vahlis:
  CCA2 Secure IBE: Standard Model Efficiency through Authenticated Symmetric Encryption. 221-238
  
• Ivan Damgård, Dennis Hofheinz, Eike Kiltz, Rune Thorbek:
  Public-Key Encryption with Non-interactive Opening. 239-255
  

Side Channel Cryptanalysis

• Onur Aciiçmez, Werner Schindler:
  A Vulnerability in RSA Implementations Due to Instruction Cache Analysis and Its Demonstration on OpenSSL. 256-273
  
• Christophe Clavier, Benedikt Gierlichs, Ingrid Verbauwhede:
  Fault Analysis Study of IDEA. 274-287
  
• Thomas Plos:
  Susceptibility of UHF RFID Tags to Electromagnetic Analysis. 288-300
  

Cryptography for Limited Devices

• Ping Yu, Stephen R. Tate:
  Online/Offline Signature Schemes for Devices with Limited Computing Capabilities. 301-317
  
• Ivan Damgård, Michael Østergaard Pedersen:
  RFID Security: Tradeoffs between Security and Efficiency. 318-332
  

Invited Talk

• Shafi Goldwasser:
  Program Obfuscation and One-Time Programs. 333-334
  

Key Exchange

• Michel Abdalla, Dario Catalano, Céline Chevalier, David Pointcheval:
  Efficient Two-Party Password-Based Key Exchange Protocols in the UC Framework. 335-351
  
• Stanislaw Jarecki, Jihye Kim, Gene Tsudik:
  Beyond Secret Handshakes: Affiliation-Hiding Authenticated Key Exchange. 352-369
  

Cryptanalysis

• Jiqiang Lu, Jongsung Kim, Nathan Keller, Orr Dunkelman:
  Improving the Efficiency of Impossible Differential Cryptanalysis of Reduced Camellia and MISTY1. 370-386
  
• Kouichi Itoh, Noboru Kunihiro, Kaoru Kurosawa:
  Small Secret Key Attack on a Variant of RSA (Due to Takagi). 387-406
  

Cryptographic Protocols

• Michael T. Goodrich, Roberto Tamassia, Nikos Triandopoulos:
  Super-Efficient Verification of Dynamic Outsourced Databases. 407-424
  
• Kristian Gjøsteen:
  A Latency-Free Election Scheme. 425-436