Topics in Cryptology -- CT-RSA 2004 [electronic resource] : The Cryptographers' Track at the RSA Conference 2004, San Francisco, CA, USA, February 23-27, 2004, Proceedings / edited by Tatsuaki Okamoto.

1st ed. 2004.
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2004.
Computer Science (Springer-11645)
Lecture notes in computer science 0302-9743 ; 2964
Lecture Notes in Computer Science, 0302-9743 ; 2964
1 online resource (XII, 392 pages)
Data encryption (Computer science).
Computer networks.
Operating systems (Computers).
Computer science-Mathematics.
Management information systems.
Computer science.
Local subjects:
Cryptology. (search)
Computer Communication Networks. (search)
Operating Systems. (search)
Algorithm Analysis and Problem Complexity. (search)
Discrete Mathematics in Computer Science. (search)
Management of Computing and Information Systems. (search)
System Details:
text file PDF
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.
Symmetric Encryption
Online Encryption Schemes: New Security Notions and Constructions
Related-Key Attacks on Triple-DES and DESX Variants
Design of AES Based on Dual Cipher and Composite Field
Periodic Properties of Counter Assisted Stream Ciphers
A Fast Correlation Attack via Unequal Error Correcting LDPC Codes
Aymmetric Encryption
k-Resilient Identity-Based Encryption in the Standard Model
A Generic Construction for Intrusion-Resilient Public-Key Encryption
Digital Signatures
A Certificate-Based Signature Scheme
Identity Based Undeniable Signatures
Compressing Rabin Signatures
A Key Recovery System as Secure as Factoring
Server Assisted Signatures Revisited
Cryptanalysis of a Zero-Knowledge Identification Protocol of Eurocrypt '95
Universal Re-encryption for Mixnets
Bit String Commitment Reductions with a Non-zero Rate
Improving Robustness of PGP Keyrings by Conflict Detection
Side-Channel Attacks
Issues of Security with the Oswald-Aigner Exponentiation Algorithm
Hardware Countermeasures against DPA - A Statistical Analysis of Their Effectiveness
Self-Randomized Exponentiation Algorithms
Flexible Hardware Design for RSA and Elliptic Curve Cryptosystems
High-Speed Modular Multiplication
Yet Another Sieving Device
Mode of Operations
A Parallelizable Enciphering Mode
Padding Oracle Attacks on the ISO CBC Mode Encryption Standard
Hash and Hash Chains
A 1 Gbit/s Partially Unrolled Architecture of Hash Functions SHA-1 and SHA-512
Fast Verification of Hash Chains
Visual Cryptography
Almost Ideal Contrast Visual Cryptography with Reversing
Ellictic Curve Cryptosystems
Weak Fields for ECC.
Okamoto, Tatsuaki, editor., Editor,
SpringerLink (Online service)
Contained In:
Springer eBooks
Other format:
Printed edition:
Printed edition:
Publisher Number:
10.1007/b95630 doi
Access Restriction:
Restricted for use by site license.
Location Notes Your Loan Policy
Description Status Barcode Your Loan Policy