My Account Log in

1 option

Topics in Cryptology - CT-RSA 2008 : The Cryptographers' Track at the RSA Conference 2008, San Francisco, CA, USA, April 8-11, 2008, Proceedings / edited by Tal Malkin.

SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online

View online
Format:
Book
Contributor:
Malkin, Tal, editor.
SpringerLink (Online service)
Series:
Computer Science (Springer-11645)
LNCS sublibrary. Security and cryptology ; SL 4, 4964.
Security and Cryptology ; 4964
Language:
English
Subjects (All):
Data encryption (Computer science).
Computer science--Mathematics.
Computer science.
Computer security.
Management information systems.
Algorithms.
Computer networks.
Cryptology.
Discrete Mathematics in Computer Science.
Systems and Data Security.
Management of Computing and Information Systems.
Algorithm Analysis and Problem Complexity.
Computer Communication Networks.
Local Subjects:
Cryptology.
Discrete Mathematics in Computer Science.
Systems and Data Security.
Management of Computing and Information Systems.
Algorithm Analysis and Problem Complexity.
Computer Communication Networks.
Physical Description:
1 online resource (XI, 437 pages).
Edition:
First edition 2008.
Contained In:
Springer eBooks
Place of Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2008.
System Details:
text file PDF
Summary:
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.
Contents:
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.
Other Format:
Printed edition:
ISBN:
978-3-540-79263-5
9783540792635
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Library Catalog Using Articles+ Library Account