The RSA Conference, with over 15,000 attendees and 300 exhibitors, is the largest computer security event of the year. The Cryptographers’ Track (CT- RSA) is a research conference within the RSA Conference. Starting in 2001, CT-RSA continues to its seventh year and is now regarded as one of the major regularly staged event for presenting the results of cryptographic research to a wide variety of audiences. The proceedings of CT-RSA 2007 contain 25 papers selected from 73 s- missions which cover all the topics of cryptography. All the submissions were reviewed by at least three reviewers, which was possible by the hard work of 23 Program Committee members and many external reviewers listed in the foll- ing pages. The papers were selected as a result of conscientious discussion. The program includes two invited talks, by Michel Rabin and Andrew Odlyzko. I would like to express my gratitude to the Program Committee members, whowereenthusiasticfromtheverybeginningofthis completedproject.Thanks also to the external reviewers including those who completed urgent reviews during the discussion phase. Special thanks to Shai Halevi for providing and maintaining the Web review system. Finally, I would like to thank Burt Kaliski of RSA Laboratories and the Steering Committee for their suggestions and c- tinuous assistance.
Author(s): Nathan Keller, Stephen D. Miller, Ilya Mironov, Ramarathnam Venkatesan (auth.), Masayuki Abe (eds.)
Series: Lecture Notes in Computer Science 4377 : Security and Cryptology
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2006
Language: English
Pages: 403
Tags: Data Encryption; Discrete Mathematics in Computer Science; Systems and Data Security; Management of Computing and Information Systems; Algorithm Analysis and Problem Complexity; Computer Communication Networks
Front Matter....Pages -
MV3: A New Word Based Stream Cipher Using Rapid Mixing and Revolving Buffers....Pages 1-19
A Simple Related-Key Attack on the Full SHACAL-1....Pages 20-30
Impossibility Proofs for RSA Signatures in the Standard Model....Pages 31-48
Selecting Secure Passwords....Pages 49-66
Human Identification Through Image Evaluation Using Secret Predicates....Pages 67-84
Cryptanalysis of Reduced Variants of the FORK-256 Hash Function....Pages 85-100
Second Preimages for SMASH....Pages 101-111
A Practical Optimal Padding for Signature Schemes....Pages 112-128
Directed Transitive Signature Scheme....Pages 129-144
Identity-Based Multi-signatures from RSA....Pages 145-162
Improved Efficiency for Private Stable Matching....Pages 163-177
Compact E-Cash from Bounded Accumulator....Pages 178-195
Batch Processing of Interactive Proofs....Pages 196-207
Timing Attacks on NTRUEncrypt Via Variation in the Number of Hash Calls....Pages 208-224
Predicting Secret Keys Via Branch Prediction....Pages 225-242
Template Attacks on Masking—Resistance Is Futile....Pages 243-256
Differential Power Analysis of Stream Ciphers....Pages 257-270
Cache Based Remote Timing Attack on the AES....Pages 271-286
Group Secret Handshakes Or Affiliation-Hiding Authenticated Group Key Agreement....Pages 287-308
Efficient Password-Authenticated Key Exchange Based on RSA....Pages 309-323
Non-degrading Erasure-Tolerant Information Authentication with an Application to Multicast Stream Authentication over Lossy Channels....Pages 324-338
A Practical and Tightly Secure Signature Scheme Without Hash Function....Pages 339-356
How to Strengthen Any Weakly Unforgeable Signature into a Strongly Unforgeable Signature....Pages 357-371
Public Key Cryptography and RFID Tags....Pages 372-384
A Bit-Slice Implementation of the Whirlpool Hash Function....Pages 385-401
Back Matter....Pages -
