TY  - BOOK
AU  - Joye,Marc
ED  - SpringerLink (Online service)
TI  - Topics in Cryptology — CT-RSA 2003: The Cryptographers’ Track at the RSA Conference 2003 San Francisco, CA, USA, April 13–17, 2003 Proceedings 
T2  - Lecture Notes in Computer Science,
SN  - 9783540365631
AV  - QA76.9.A25 
U1  - 005.82 23
PY  - 2003///
CY  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg
KW  - Computer science
KW  - Computer Communication Networks
KW  - Operating systems (Computers)
KW  - Data encryption (Computer science)
KW  - Computational complexity
KW  - Information Systems
KW  - Computer Science
KW  - Data Encryption
KW  - Operating Systems
KW  - Discrete Mathematics in Computer Science
KW  - Computers and Society
KW  - Management of Computing and Information Systems
N1  - 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
UR  - http://dx.doi.org/10.1007/3-540-36563-X
ER  -