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, Band 2612) Marc Joye

Marc Joye

ISBN 10: 3540008470 / ISBN 13: 9783540008477

Editore: Springer, 2003

Riguardo questo articolo

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, Band 2612) In deutscher Sprache. pages.

Codice articolo BN412408

Dati bibliografici

• Titolo: 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, Band 2612) Marc Joye
• Editore: Springer
• Data di pubblicazione: 2003
• Lingua: Inglese
• ISBN 10: 3540008470
• ISBN 13: 9783540008477
• Rilegatura: Brossura
• Condizione: gut
• Peso: 2000 grammi

Descrizione articolo

Riassunto

These are the proceedings of CT-RSA 2003, the Cryptographers’ Track at RSA Conference 2003. The proceedings of CT-RSA 2001 and CT-RSA 2002 were published in Springer-Verlag’s Lecture Notes in Computer Science series as LNCS 2020 and LNCS 2271, respectively. The Cryptographers’ Track is one of the many parallel tracks of the RSA Conference. With many thousands of participants, the RSA Conference is the largest security and cryptography event of the year. There were 97 submitted contributions this year, of which 26, or 27%, were selected for presentation. The program also included two invited talks by Tom Berson (“Cryptography After the Bubble: How to Make an Impact on the World”) and by Adi Shamir (“RSA Shortcuts”). All submissions were reviewed by at least three members of the program committee. I am very grateful to the 21 members of the program committee for their hard and e?cient work in assembling the program. My thanks also go to the 78 external referees who helped in the review process in their area of exp- tise: Gail-Joon Ahn, Toru Akishita, Kazumaro Aoki, Gildas Avoine, Joonsang Baek, Olivier Benoit, Alex Biryukov, Alexandra Boldyreva, Antoon Bosselaers, Emmanuel Bresson, Eric Brier, Brice Canvel, Dario Catalano, Chien Yuan Chen, Donghyeon Cheon, Jung Hee Cheon, Olivier Chevassut, Kilsoo Chun, Mathieu Ciet, Christophe Clavier, Jean-S´ebastien Coron, Reza Curtmola, Christophe De Canni`ere, Jean-Fran¸cois Dhem, Xuhua Ding, Pierre-Alain Fouque, Jacques Fournier, Fabien Germain, Jovan Dj. Goli´c, Philippe Golle, Louis Granboulan, Jorge Guajardo, D. J.

Contenuti

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.