Topics in Cryptology -- CT-RSA 2003: The Cryptographers' Track at the RSA Conference 2003, San Francisco, CA, USA April 13-17, 2003, Proceedings (Lecture Notes in Computer Science, 2612)

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. Forward-Security in Private-Key Cryptography....Pages 1-18 Intrusion-Resilient Public-Key Encryption....Pages 19-32 TMAC: Two-Key CBC MAC....Pages 33-49 Montgomery Prime Hashing for Message Authentication....Pages 50-67 An Analysis of Proxy Signatures: Is a Secure Channel Necessary?....Pages 68-79 Invisibility and Anonymity of Undeniable and Confirmer Signatures....Pages 80-97 A Secure Signature Scheme from Bilinear Maps....Pages 98-110 Access Control Using Pairing Based Cryptography....Pages 111-121 NTRUSign: Digital Signatures Using the NTRU Lattice....Pages 122-140 About the XL Algorithm over GF (2)....Pages 141-157 Efficient GF(p m ) Arithmetic Architectures for Cryptographic Applications....Pages 158-175 Hardware Performance Characterization of Block Cipher Structures....Pages 176-192 Simple Identity-Based Cryptography with Mediated RSA....Pages 193-210 Two Birds One Stone: Signcryption Using RSA....Pages 211-226 Cryptography after the Bubble: How to Make an Impact on the World....Pages 226-226 Rethinking Chosen-Ciphertext Security under Kerckhoffs’ Assumption....Pages 227-243 Provably Secure Public-Key Encryption for Length-Preserving Chaumian Mixes....Pages 244-262 Fault Tolerant and Distributed Broadcast Encryption....Pages 263-280 Shared Generation of Pseudo-Random Functions with Cumulative Maps....Pages 281-295 Authenticated Data Structures for Graph and Geometric Searching....Pages 295-313 Fractal Merkle Tree Representation and Traversal....Pages 314-326 RSA Shortcuts....Pages 327-327 The Width- w NAF Method Provides Small Memory and Fast Elliptic Scalar Multiplications Secure against Side Channel Attacks....Pages 328-343 Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation....Pages 343-354 Two Efficient and Provably Secure Schemes for Server-Assisted Threshold Signatures....Pages 355-373 Secure Applications of Pedersen’s Distributed Key Generation Protocol....Pages 373-390 Seeing through Mist Given a Small Fraction of an RSA Private Key....Pages 391-402 Simple Backdoors for RSA Key Generation....Pages 403-416 "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"--Publisher description