The Cryptographers’ Track (CT-RSA) is a research conference within the RSA conference, the largest, regularly staged computer security event. CT-RSA 2004 was the fourth year of the Cryptographers’ Track, and it is now an established venue for presenting practical research results related to cryptography and data security. The conference received 77 submissions, and the program committee sel- ted 28 of these for presentation. The program committee worked very hard to evaluate the papers with respect to quality, originality, and relevance to cryp- graphy. Each paper was reviewed by at least three program committee members. Extended abstracts of the revised versions of these papers are in these proc- dings. The program also included two invited lectures by Dan Boneh and Silvio Micali. I am extremely grateful to the program committee members for their en- mous investment of time and e?ort in the di?cult and delicate process of review and selection. Many of them attended the program committee meeting during the Crypto 2003 conference at the University of California, Santa Barbara.
Author(s): Alexandra Boldyreva, Nut Taesombut (auth.), Tatsuaki Okamoto (eds.)
Series: Lecture Notes in Computer Science 2964
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2004
Language: English
Pages: 392
Tags: Data Encryption; Computer Communication Networks; Operating Systems; Algorithm Analysis and Problem Complexity; Discrete Mathematics in Computer Science; Management of Computing and Information Systems
Front Matter....Pages -
Online Encryption Schemes: New Security Notions and Constructions....Pages 1-14
Related-Key Attacks on Triple-DES and DESX Variants....Pages 15-24
Design of AES Based on Dual Cipher and Composite Field....Pages 25-38
Periodic Properties of Counter Assisted Stream Ciphers....Pages 39-53
A Fast Correlation Attack via Unequal Error Correcting LDPC Codes....Pages 54-66
k -Resilient Identity-Based Encryption in the Standard Model....Pages 67-80
A Generic Construction for Intrusion-Resilient Public-Key Encryption....Pages 81-98
A Certificate-Based Signature Scheme....Pages 99-111
Identity Based Undeniable Signatures....Pages 112-125
Compressing Rabin Signatures....Pages 126-128
A Key Recovery System as Secure as Factoring....Pages 129-142
Server Assisted Signatures Revisited....Pages 143-156
Cryptanalysis of a Zero-Knowledge Identification Protocol of Eurocrypt ‘95....Pages 157-162
Universal Re-encryption for Mixnets....Pages 163-178
Bit String Commitment Reductions with a Non-zero Rate....Pages 179-193
Improving Robustness of PGP Keyrings by Conflict Detection....Pages 194-207
Issues of Security with the Oswald-Aigner Exponentiation Algorithm....Pages 208-221
Hardware Countermeasures against DPA – A Statistical Analysis of Their Effectiveness....Pages 222-235
Self-Randomized Exponentiation Algorithms....Pages 236-249
Flexible Hardware Design for RSA and Elliptic Curve Cryptosystems....Pages 250-263
High-Speed Modular Multiplication....Pages 264-277
Yet Another Sieving Device....Pages 278-291
A Parallelizable Enciphering Mode....Pages 292-304
Padding Oracle Attacks on the ISO CBC Mode Encryption Standard....Pages 305-323
A 1 Gbit/s Partially Unrolled Architecture of Hash Functions SHA-1 and SHA-512....Pages 324-338
Fast Verification of Hash Chains....Pages 339-352
Almost Ideal Contrast Visual Cryptography with Reversing....Pages 353-365
Weak Fields for ECC....Pages 366-386
Back Matter....Pages -
