Topics in Cryptology -- CT-RSA 2003 The Cryptographers' Track at the RSA Conference 2003, San Francisco, CA, USA April 13-17, 2003, Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Joye, Marc (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003.
• Έκδοση: 1st ed. 2003.
• Σειρά: Lecture Notes in Computer Science, 2612
• Θέματα: Data encryption (Computer science).; Computer communication systems.; Operating systems (Computers).; Computer science-Mathematics.; Computers and civilization.; Management information systems.; Computer science.; Cryptology.; Computer Communication Networks.; Operating Systems.; Discrete Mathematics in Computer Science.; Computers and Society.; Management of Computing and Information Systems.

Πίνακας περιεχομένων:

• Key Self-protection
• Forward-Security in Private-Key Cryptography
• Intrusion-Resilient Public-Key Encryption
• Message Authentication
• TMAC: Two-Key CBC MAC
• Montgomery Prime Hashing for Message Authentication
• Digital Signatures
• An Analysis of Proxy Signatures: Is a Secure Channel Necessary?
• Invisibility and Anonymity of Undeniable and Confirmer Signatures
• Pairing Based Cryptography
• A Secure Signature Scheme from Bilinear Maps
• Access Control Using Pairing Based Cryptography
• Multivariate and Lattice Problems
• NTRUSign: Digital Signatures Using the NTRU Lattice
• About the XL Algorithm over GF(2)
• Cryptographic Architectures
• Efficient GF(p m ) Arithmetic Architectures for Cryptographic Applications
• Hardware Performance Characterization of Block Cipher Structures
• New RSA-based Cryptosystems
• Simple Identity-Based Cryptography with Mediated RSA
• Two Birds One Stone: Signcryption Using RSA
• Invited Talk I
• Cryptography after the Bubble: How to Make an Impact on the World
• Chosen-Ciphertext Security
• Rethinking Chosen-Ciphertext Security under Kerckhoffs' Assumption
• Provably Secure Public-Key Encryption for Length-Preserving Chaumian Mixes
• Broadcast Encryption and PRF Sharing
• Fault Tolerant and Distributed Broadcast Encryption
• Shared Generation of Pseudo-Random Functions with Cumulative Maps
• Authentication Structures
• Authenticated Data Structures for Graph and Geometric Searching
• Fractal Merkle Tree Representation and Traversal
• Invited Talk II
• RSA Shortcuts
• Elliptic Curves and Pairings
• The Width-w NAF Method Provides Small Memory and Fast Elliptic Scalar Multiplications Secure against Side Channel Attacks
• Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation
• Threshold Cryptography
• Two Efficient and Provably Secure Schemes for Server-Assisted Threshold Signatures
• Secure Applications of Pedersen's Distributed Key Generation Protocol
• Implementation Issues
• Seeing through Mist Given a Small Fraction of an RSA Private Key
• Simple Backdoors for RSA Key Generation.