Topics in Cryptology - CT-RSA 2010

The RSA Conference is an annual event that attracts hundreds of vendors and thousands of participants from industry and academia. Since 2001, the conf- ence has included an academic Cryptographers'Track (CT-RSA). This year was the 10th anniversary of CT-RSA. Since its conception, the CT-RSA conference has become a major avenue for publishing high-quality research papers. The RSA conference was held in San Francisco, California, during March 1-5, 2010. This year we received94 submissions. Eachpaper gotassignedto three ref- ees. Papers submitted by the members of the Program Committee got assigned to?vereferees.Inthe?rststageofthereviewprocess,thesubmittedpaperswere read and evaluated by the ProgramCommittee members and then in the second stage, the papers were scrutinized during an extensive discussion. Finally, the Program Committee chose 25 papers to be included in the conference program. The authors of the accepted papers had two weeks for revision and preparation of ?nal versions.The revised papers were not subject to editorial review and the authors bear full responsibility for their contents. The submission and review process was supported by the iChair conference submission server. We thank Matthiew Finiasz and Thomas Baign` eres for letting us use iChair. The conf- ence proceedings were published by Springer in this volume of Lecture Notes in Computer Science.

Inhalt

Invited Talk.- The First 30 Years of Cryptographic Hash Functions and the NIST SHA-3 Competition.- Public-Key Cryptography.- Errors Matter: Breaking RSA-Based PIN Encryption with Thirty Ciphertext Validity Queries.- Efficient CRT-RSA Decryption for Small Encryption Exponents.- Resettable Public-Key Encryption: How to Encrypt on a Virtual Machine.- Plaintext-Awareness of Hybrid Encryption.- Speed Records for NTRU.- High-Speed Parallel Software Implementation of the ? T Pairing.- Refinement of Miller's Algorithm Over Edwards Curves.- Probabilistic Public Key Encryption with Equality Test.- Efficient CCA-Secure PKE from Identity-Based Techniques.- Anonymity from Asymmetry: New Constructions for Anonymous HIBE.- Making the Diffie-Hellman Protocol Identity-Based.- On Extended Sanitizable Signature Schemes.- Side-Channel Attacks.- Unrolling Cryptographic Circuits: A Simple Countermeasure Against Side-Channel Attacks.- Fault Attacks Against emv Signatures.- Revisiting Higher-Order DPA Attacks:.- Differential Cache-Collision Timing Attacks on AES with Applications to Embedded CPUs.- Cryptographic Protocols.- Usable Optimistic Fair Exchange.- Hash Function Combiners in TLS and SSL.- Improving Efficiency of an 'On the Fly' Identification Scheme by Perfecting Zero-Knowledgeness.- Cryptanalysis.- Linear Cryptanalysis of Reduced-Round PRESENT.- Dependent Linear Approximations: The Algorithm of Biryukov and Others Revisited.- Practical Key Recovery Attack against Secret-IV Edon- .- Rebound Attacks on the Reduced Grøstl Hash Function.- Symmetric Cryptography.- The Sum of CBC MACs Is a Secure PRF.- On Fast Verification of Hash Chains.