CT-RSA 2003: San Francisco, CA, USA
Marc Joye (Ed.): Topics in Cryptology - CT-RSA 2003, The Cryptographers' Track at the RSA Conference 2003, San Francisco, CA, USA, April 13-17, 2003, Proceedings. Springer 2003 Lecture Notes in Computer Science ISBN 3-540-00847-0
Key Self-protection
- Yevgeniy Dodis, Matthew K. Franklin, Jonathan Katz, Atsuko Miyaji, Moti Yung: Intrusion-Resilient Public-Key Encryption. 19-32
Message Authentication
Digital Signatures
- Jung-Yeun Lee, Jung Hee Cheon, Seungjoo Kim: An Analysis of Proxy Signatures: Is a Secure Channel Necessary? 68-79
- Steven D. Galbraith, Wenbo Mao: Invisibility and Anonymity of Undeniable and Confirmer Signatures. 80-97
Pairing Based Cryptography
- Nigel P. Smart: Access Control Using Pairing Based Cryptography. 111-121
Multivariate and Lattice Problems
- Jeffrey Hoffstein, Nick Howgrave-Graham, Jill Pipher, Joseph H. Silverman, William Whyte: NTRUSIGN: Digital Signatures Using the NTRU Lattice. 122-140
Cryptographic Architectures
- Guido Bertoni, Jorge Guajardo, Sandeep S. Kumar, Gerardo Orlando, Christof Paar, Thomas J. Wollinger: Efficient GF(pm) Arithmetic Architectures for Cryptographic Applications. 158-175
New RSA-based Cryptosystems
Invited Talk I
- Thomas A. Berson: Cryptography after the Bubble: How to Make an Impact on the World. 226
Chosen-Ciphertext Security
- Seungjoo Kim, Masahiro Mambo, Yuliang Zheng: Rethinking Chosen-Ciphertext Security under Kerckhoffs' Assumption. 227-243
- Bodo Möller: Provably Secure Public-Key Encryptionfor Length-Preserving Chaumian Mixes. 244-262
Broadcast Encryption and PRF Sharing
- Huaxiong Wang, Josef Pieprzyk: Shared Generation of Pseudo-Random Functions with Cumulative Maps. 281-294
Authentication Structures
- Michael T. Goodrich, Roberto Tamassia, Nikos Triandopoulos, Robert F. Cohen: Authenticated Data Structures for Graph and Geometric Searching. 295-313
- Markus Jakobsson, Frank Thomson Leighton, Silvio Micali, Michael Szydlo: Fractal Merkle Tree Representation and Traversal. 314-326
Invited Talk II
- Adi Shamir: RSA Shortcuts. 327
Elliptic Curves and Pairings
- Katsuyuki Okeya, Tsuyoshi Takagi: The Width-w NAF Method Provides Small Memory and Fast Elliptic Scalar Multiplications Secure against Side Channel Attacks. 328-342
- Kirsten Eisenträger, Kristin Lauter, Peter L. Montgomery: Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation. 343-354
Threshold Cryptography
- Shouhuai Xu, Ravi S. Sandhu: Two Efficient and Provably Secure Schemes for Server-Assisted Threshold Signatures. 355-372
- Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, Tal Rabin: Secure Applications of Pedersen's Distributed Key Generation Protocol. 373-390
Implementation Issues
- Colin D. Walter: Seeing through MIST Given a Small Fraction of an RSA Private Key. 391-402
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T193522 by the dblp team