## Topics in Cryptology -- CT-RSA 2003: The Cryptographers' Track at the RSA Conference 2003, San Francisco, CA, USA April 13-17, 2003, ProceedingsThis 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. |

### What people are saying - Write a review

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

### Contents

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

### 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 length 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 Schnorr signature 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 width-w NAF