Topics in Cryptology -- CT-RSA 2004: The Cryptographers' Track at the RSA Conference 2004, San Francisco, CA, USA, February 23-27, 2004, Proceedings

Front Cover
Tatsuaki Okamoto
Springer Science & Business Media, Feb 10, 2004 - Computers - 392 pages
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.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

New Security Notions and Constructions
1
RelatedKey Attacks on TripleDES and DESX Variants
15
Design of AES Based on Dual Cipher and Composite Field
25
Periodic Properties of Counter Assisted Stream Ciphers
39
A Fast Correlation Attack via Unequal Error Correcting LDPC Codes
54
kResilient IdentityBased Encryption in the Standard Model
67
A Generic Construction for IntrusionResilient PublicKey Encryption
81
A CertificateBased Signature Scheme
99
Improving Robustness of PGP Keyrings by Conflict Detection
194
Issues of Security with the OswaldAigner Exponentiation Algorithm
208
Hardware Countermeasures against DPA A Statistical Analysis of Their Effectiveness
222
SelfRandomized Exponentiation Algorithms
236
Flexible Hardware Design for RSA and Elliptic Curve Cryptosystems
250
HighSpeed Modular Multiplication
264
Yet Another Sieving Device
278
A Parallelizable Enciphering Mode
292

Identity Based Undeniable Signatures
112
Compressing Rabin Signatures
126
A Key Recovery System as Secure as Factoring
129
Server Assisted Signatures Revisited
143
Cryptanalysis of a ZeroKnowledge Identification Protocol of Eurocrypt 95
157
Universal Reencryption for Mixnets
163
Bit String Commitment Reductions with a Nonzero Rate
179
Padding Oracle Attacks on the ISO CBC Mode Encryption Standard
305
A 1 Gbits Partially Unrolled Architecture of Hash Functions SHA1 and SHA512
324
Fast Verification of Hash Chains
339
Almost Ideal Contrast Visual Cryptography with Reversing
353
Weak Fields for ECC
366
Author Index
387
Copyright

Other editions - View all

Common terms and phrases

Bibliographic information