Topics in Cryptology — CT-RSA 2001: The Cryptographers’ Track at RSA Conference 2001 San Francisco, CA, USA, April 8–12, 2001 Proceedings

Detlef Hühnlein (auth.), David Naccache (eds.)3540418989, 9783540418986

You are holding the rst in a hopefully long and successful series of RSA Cr- tographers’ Track proceedings. The Cryptographers’ Track (CT-RSA) is one of the many parallel tracks of the yearly RSA Conference. Other sessions deal with government projects, law and policy issues, freedom and privacy news, analysts’ opinions, standards, ASPs, biotech and healthcare, nance, telecom and wireless security, developers, new products, implementers, threats, RSA products, VPNs, as well as cryp- graphy and enterprise tutorials. RSA Conference 2001 is expected to continue the tradition and remain the largest computer security event ever staged: 250 vendors, 10,000 visitors and 3,000 class-going attendees are expected in San Francisco next year. I am very grateful to the 22 members of the program committee for their hard work. The program committee received 65 submissions (one of which was later withdrawn) for which review was conducted electronically; almost all papers had at least two reviews although most had three or more. Eventually, we accepted the 33 papers that appear in these proceedings. Revisions were not checked on their scienti c aspects and some authors will write nal versions of their papers for publication in refereed journals. As is usual, authors bear full scienti c and paternity responsibilities for the contents of their papers.

---

Table of contents :
Faster Generation of NICE-Schnorr-Type Signatures….Pages 1-12
New Key Agreement Protocols in Braid Group Cryptography….Pages 13-27
Improving SSL Handshake Performance via Batching….Pages 28-43
From Fixed-Length Messages to Arbitrary-Length Messages Practical RSA Signature Padding Schemes….Pages 44-51
An Advantage of Low-Exponent RSA with Modulus Primes Sharing Least Significant Bits….Pages 52-62
On the Strength of Simply-Iterated Feistel Ciphers with Whitening Keys….Pages 63-69
Analysis of SHA-1 in Encryption Mode….Pages 70-83
Fast Implementation and Fair Comparison of the Final Candidates for Advanced Encryption Standard Using Field Programmable Gate Arrays….Pages 84-99
Fair e-Lotteries and e-Casinos….Pages 100-109
Secure Mobile Gambling….Pages 110-125
Formal Security Proofs for a Signature Scheme with Partial Message Recovery….Pages 126-142
The Oracle Diffie-Hellman Assumptions and an Analysis of DHIES….Pages 143-158
REACT: Rapid Enhanced-Security Asymmetric Cryptosystem Transform….Pages 159-174
Security Weaknesses in Bluetooth….Pages 176-191
Distinguishing Exponent Digits by Observing Modular Subtractions….Pages 192-207
On the Power of Misbehaving Adversaries and Security Analysis of the Original EPOC….Pages 208-222
Modular Exponentiation on Fine-Grained FPGA….Pages 223-234
Scalable Algorithm for Montgomery Multiplication and its Implementation on the Coarse-Grain Reconfigurable Chip….Pages 235-249
Software Implementation of the NIST Elliptic Curves Over Prime Fields….Pages 250-265
The Security of Hidden Field Equations (HFE)….Pages 266-281
QUARTZ, 128-Bit Long Digital Signatures….Pages 282-297
FLASH, a Fast Multivariate Signature Algorithm….Pages 298-307
Analysis of the Weil Descent Attack of Gaudry, Hess and Smart….Pages 308-318
Using Fewer Qubits in Shor’s Factorization Algorithm via Simultaneous Diophantine Approximation….Pages 319-327
Relying Party Credentials Framework….Pages 328-343
Password Authentication Using Multiple Servers….Pages 344-360
More Efficient Password-Authenticated Key Exchange….Pages 361-377
Improved Boneh-Shaw Content Fingerprinting….Pages 378-391
Efficient Asymmetric Public-Key Traitor Tracing Without Trusted Agents….Pages 392-407
Targeted Advertising … and Privacy Too….Pages 408-424
Uncheatable Distributed Computations….Pages 425-440
Forward-Secure Threshold Signature Schemes….Pages 441-456
A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires….Pages 457-471