Topics in Cryptology - CT-RSA 2010: The Cryptographers’ Track at the RSA Conference 2010, San Francisco, CA, USA, March 1-5, 2010. Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This book constitutes the refereed proceedings of the Cryptographers' Track at the RSA Conference 2010, CT-RSA 2010, held in San Francisco, CA, USA in April 2010. The 25 revised full papers presented together with 1 invited lecture were carefully reviewed and selected from 94 submissions. The papers are organized in topical sections on public-key cryptography, side-channel attacks, cryptographic protocols, cryptanalysis, and symmetric cryptography.

Author(s): Bart Preneel (auth.), Josef Pieprzyk (eds.)
Series: Lecture Notes in Computer Science 5985
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2010

Language: English
Pages: 397
Tags: Data Encryption; Discrete Mathematics in Computer Science; Systems and Data Security; Computer Communication Networks; Algorithm Analysis and Problem Complexity

Front Matter....Pages -
The First 30 Years of Cryptographic Hash Functions and the NIST SHA-3 Competition....Pages 1-14
Errors Matter: Breaking RSA-Based PIN Encryption with Thirty Ciphertext Validity Queries....Pages 15-25
Efficient CRT-RSA Decryption for Small Encryption Exponents....Pages 26-40
Resettable Public-Key Encryption: How to Encrypt on a Virtual Machine....Pages 41-56
Plaintext-Awareness of Hybrid Encryption....Pages 57-72
Speed Records for NTRU....Pages 73-88
High-Speed Parallel Software Implementation of the η T Pairing....Pages 89-105
Refinement of Miller’s Algorithm Over Edwards Curves....Pages 106-118
Probabilistic Public Key Encryption with Equality Test....Pages 119-131
Efficient CCA-Secure PKE from Identity-Based Techniques....Pages 132-147
Anonymity from Asymmetry: New Constructions for Anonymous HIBE....Pages 148-164
Making the Diffie-Hellman Protocol Identity-Based....Pages 165-178
On Extended Sanitizable Signature Schemes....Pages 179-194
Unrolling Cryptographic Circuits: A Simple Countermeasure Against Side-Channel Attacks....Pages 195-207
Fault Attacks Against emv Signatures....Pages 208-220
Revisiting Higher-Order DPA Attacks:....Pages 221-234
Differential Cache-Collision Timing Attacks on AES with Applications to Embedded CPUs....Pages 235-251
Usable Optimistic Fair Exchange....Pages 252-267
Hash Function Combiners in TLS and SSL....Pages 268-283
Improving Efficiency of an ‘On the Fly’ Identification Scheme by Perfecting Zero-Knowledgeness....Pages 284-301
Linear Cryptanalysis of Reduced-Round PRESENT....Pages 302-317
Dependent Linear Approximations: The Algorithm of Biryukov and Others Revisited....Pages 318-333
Practical Key Recovery Attack against Secret-IV Edon - $\mathcal R$ ....Pages 334-349
Rebound Attacks on the Reduced Grøstl Hash Function....Pages 350-365
The Sum of CBC MACs Is a Secure PRF....Pages 366-381
On Fast Verification of Hash Chains....Pages 382-396
Back Matter....Pages -