This book constitutes the refereed proceedings of the Cryptographers' Track at the RSA Conference 2003, CT-RSA 2003, held in San Francisco, CA, USA, in April 2003.
The 26 revised full papers presented together with abstracts of 2 invited talks were carefully reviewed and selected from 97 submissions. The papers are organized in topical sections on key self-protection, message authentication, digital signatures, pairing based cryptography, multivariate and lattice problems, cryptographic architectures, new RSA-based cryptosystems, chosen-ciphertext security, broadcast encryption and PRF sharing, authentication structures, elliptic curves and pairings, threshold cryptography, and implementation issues.
Reihe
Sprache
Verlagsort
Verlagsgruppe
Illustrationen
Dateigröße
ISBN-13
978-3-540-36563-1 (9783540365631)
DOI
Schweitzer Klassifikation
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 andProvably 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.
