TY  - BOOK
AU  - Pieprzyk,Josef
ED  - SpringerLink (Online service)
TI  - Topics in Cryptology - CT-RSA 2010: The Cryptographers’ Track at the RSA Conference 2010, San Francisco, CA, USA, March 1-5, 2010. Proceedings 
T2  - Lecture Notes in Computer Science,
SN  - 9783642119255
AV  - QA76.9.A25 
U1  - 005.82 23
PY  - 2010///
CY  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg
KW  - Computer science
KW  - Computer Communication Networks
KW  - Data protection
KW  - Data encryption (Computer science)
KW  - Computer software
KW  - Computational complexity
KW  - Computer Science
KW  - Data Encryption
KW  - Discrete Mathematics in Computer Science
KW  - Systems and Data Security
KW  - Algorithm Analysis and Problem Complexity
N1  - 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
UR  - http://dx.doi.org/10.1007/978-3-642-11925-5
ER  -