Topics in Cryptology – CT-RSA 2008 The Cryptographers’ Track at the RSA Conference 2008, San Francisco, CA, USA, April 8-11, 2008. Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Malkin, Tal (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2008.
• Σειρά: Lecture Notes in Computer Science, 4964
• Θέματα: Computer science.; Computer communication systems.; Computer security.; Data encryption (Computer science).; Algorithms.; Computer science > Mathematics.; Management information systems.; Computer Science.; 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.

 This book constitutes the refereed proceedings of the Cryptographers' Track at the RSA Conference 2008, CT-RSA 2008, held in San Francisco, CA, USA in April 2008. The 26 revised full papers presented together with the abstract of 1 invited talk were carefully reviewed and selected from 95 submissions. The papers are organized in topical sections on hash function cryptanalysis, cryptographic building blocks, fairness in secure computation, message authentication codes, improved aes implementations, public key encryption with special properties, side channel cryptanalysis, cryptography for limited devices, invited talk, key exchange, cryptanalysis, and cryptographic protocols. 

 Hash Function Cryptanalysis -- Security of MD5 Challenge and Response: Extension of APOP Password Recovery Attack -- Cryptanalysis of a Hash Function Based on Quasi-cyclic Codes -- Linear-XOR and Additive Checksums Don’t Protect Damgård-Merkle Hashes from Generic Attacks -- Cryptographic Building Blocks -- Efficient Fully-Simulatable Oblivious Transfer -- Separation Results on the “One-More” Computational Problems -- Fairness in Secure Computation -- An Efficient Protocol for Fair Secure Two-Party Computation -- Efficient Optimistic Fair Exchange Secure in the Multi-user Setting and Chosen-Key Model without Random Oracles -- Legally-Enforceable Fairness in Secure Two-Party Computation -- Message Authentication Codes -- Security of NMAC and HMAC Based on Non-malleability -- Aggregate Message Authentication Codes -- Improved AES Implementations -- Boosting AES Performance on a Tiny Processor Core -- A Fast and Cache-Timing Resistant Implementation of the AES -- Public Key Encryption with Special Properties -- Identity-Based Threshold Key-Insulated Encryption without Random Oracles -- CCA2 Secure IBE: Standard Model Efficiency through Authenticated Symmetric Encryption -- Public-Key Encryption with Non-interactive Opening -- Side Channel Cryptanalysis -- A Vulnerability in RSA Implementations Due to Instruction Cache Analysis and Its Demonstration on OpenSSL -- Fault Analysis Study of IDEA -- Susceptibility of UHF RFID Tags to Electromagnetic Analysis -- Cryptography for Limited Devices -- Online/Offline Signature Schemes for Devices with Limited Computing Capabilities -- RFID Security: Tradeoffs between Security and Efficiency -- Invited Talk -- Program Obfuscation and One-Time Programs -- Key Exchange -- Efficient Two-Party Password-Based Key Exchange Protocols in the UC Framework -- Beyond Secret Handshakes: Affiliation-Hiding Authenticated Key Exchange -- Cryptanalysis -- Improving the Efficiency of Impossible Differential Cryptanalysis of Reduced Camellia and MISTY1 -- Small Secret Key Attack on a Variant of RSA (Due to Takagi) -- Cryptographic Protocols -- Super-Efficient Verification of Dynamic Outsourced Databases -- A Latency-Free Election Scheme.