## CT-RSA 2003These 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. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

ForwardSecurity in PrivateKey Cryptography | 1 |

IntrusionResilient PublicKey Encryption | 19 |

TwoKey CBC MAC | 33 |

Montgomery Prime Hashing for Message Authentication | 50 |

Is a Secure Channel Necessary? | 68 |

Invisibility and Anonymity of Undeniable and Confirmer Signatures | 80 |

A Secure Signature Scheme from Bilinear Maps | 98 |

Access Control Using Pairing Based Cryptography | 111 |

Rethinking ChosenCiphertext Security under Kerckhoffs Assumption | 227 |

Provably Secure PublicKey Encryptionfor LengthPreserving Chaumian Mixes | 244 |

Fault Tolerant and DistributedBroadcast Encryption | 263 |

Shared Generation of PseudoRandom Functions with Cumulative Maps | 281 |

Authenticated Data Structures for Graph and Geometric Searching | 295 |

Fractal Merkle Tree Representation and Traversal | 314 |

RSA Shortcuts | 327 |

The Widthomega NAF Method Provides Small Memory and Fast Elliptic Scalar Multiplications Secure against Side Channel Attack | 328 |

Digital Signatures Using the NTRU Lattice | 122 |

About the XL Algorithm over GF2 | 141 |

Efficient GFpm Arithmetic Architectures for Cryptographic Applications | 158 |

Hardware Performance Characterization of Block Cipher Structures | 176 |

Simple IdentityBased Cryptography with Mediated RSA | 193 |

Signcryption Using RSA | 211 |

How to Make an Impact on the World | 227 |

Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation | 343 |

Two Efficient and Provably Secure Schemes for ServerAssisted Threshold Signatures | 355 |

Secure Applications of Pedersens Distributed Key Generation Protocol | 373 |

Seeing through Mist Given a Small Fraction of an RSA Private Key | 391 |

Simple Backdoors for RSA Key Generation | 403 |

417 | |

### Other editions - View all

Topics in Cryptology -- CT-RSA 2003: The Cryptographers' Track at the RSA ... Marc Joye Limited preview - 2003 |

### Common terms and phrases

access structure Advances in Cryptology adversary algorithm assumption attack block cipher broadcast chosen ciphertext attack chosen-ciphertext ciphertext Computer Science construction corresponding CRYPTO cryptographic Cryptology cryptosystems CT-RSA cumulative map data structure decryption oracle defined denote distribution efficient elements elliptic curve encryption scheme equations exponent Feistel network forward-secure hardware hash function IB-mRSA implemented input integer lattice Lecture Notes Lemma LNCS method modulus node Notes in Computer NTRUSign obtain output pair path players polynomial prime private key probability problem proof provably secure proxy signature proxy signer pseudorandom pseudorandom bit public key queries random oracle model requires Rogaway S-boxes scalar multiplication Schnorr secret key secret sharing Section security parameter servers Side Channel Attacks signcryption signing simulation Springer-Verlag string subset Tate pairings Theorem threshold cryptosystems TPAKE TPAKE-HTSig tree verifier Weil pairing width-w NAF