CT-RSA 2001: San Francisco, CA, USA

New Cryptosystems

• Detlef Hühnlein:
  Faster Generation of NICE-Schnorr-Type Signatures. 1-12
  
• Iris Anshel, Michael Anshel, Benji Fisher, Dorian Goldfeld:
  New Key Agreement Protocols in Braid Group Cryptography. 13-27
  

RSA

• Hovav Shacham, Dan Boneh:
  Improving SSL Handshake Performance via Batching. 28-43
  
• Geneviève Arboit, Jean-Marc Robert:
  From Fixed-Length Messages to Arbitrary-Length Messages Practical RSA Signature Padding Schemes. 44-51
  
• Ron Steinfeld, Yuliang Zheng:
  An Advantage of Low-Exponent RSA with Modulus Primes Sharing Least Significant Bits. 52-62
  

Symmetric Cryptography

• Paul Onions:
  On the Strength of Simply-Iterated Feistel Ciphers with Whitening Keys. 63-69
  
• Helena Handschuh, Lars R. Knudsen, Matthew J. B. Robshaw:
  Analysis of SHA-1 in Encryption Mode. 70-83
  
• Kris Gaj, Pawel Chodowiec:
  Fast Implementation and Fair Comparison of the Final Candidates for Advanced Encryption Standard Using Field Programmable Gate Arrays. 84-99
  

Gambling and Lotteries

• Eyal Kushilevitz, Tal Rabin:
  Fair e-Lotteries and e-Casinos. 100-109
  
• Markus Jakobsson, David Pointcheval, Adam L. Young:
  Secure Mobile Gambling. 110-125
  

Reductions, Constructions, and Security Proofs

• Daniel R. L. Brown, Donald Byron Johnson:
  Formal Security Proofs for a Signature Scheme with Partial Message Recovery. 126-142
  
• Michel Abdalla, Mihir Bellare, Phillip Rogaway:
  The Oracle Diffie-Hellman Assumptions and an Analysis of DHIES. 143-158
  
• Tatsuaki Okamoto, David Pointcheval:
  REACT: Rapid Enhanced-Security Asymmetric Cryptosystem Transform. 159-175
  

Flaws and Attacks

• Markus Jakobsson, Susanne Wetzel:
  Security Weaknesses in Bluetooth. 176-191
  
• Colin D. Walter, Susan Thompson:
  Distinguishing Exponent Digits by Observing Modular Subtractions. 192-207
  
• Marc Joye, Jean-Jacques Quisquater, Moti Yung:
  On the Power of Misbehaving Adversaries and Security Analysis of the Original EPOC. 208-222
  

Implementation

• Alexander Tiountchik, Elena Trichina:
  Modular Exponentiation on Fine-Grained FPGA. 223-234
  
• Elena Trichina, Alexander Tiountchik:
  Scalable Algorithm for Montgomery Multiplication and Its Implementation on the Coarse-Grain Reconfigurable Chip. 235-249
  
• Michael Brown, Darrel Hankerson, Julio López, Alfred Menezes:
  Software Implementation of the NIST Elliptic Curves Over Prime Fields. 250-265
  
• Nicolas Courtois:
  The Security of Hidden Field Equations (HFE). 266-281
  

Multivariate Cryptography

• Jacques Patarin, Nicolas Courtois, Louis Goubin:
  QUARTZ, 128-Bit Long Digital Signatures. 282-297
  
• Jacques Patarin, Nicolas Courtois, Louis Goubin:
  FLASH, a Fast Multivariate Signature Algorithm. 298-307
  

Number Theoretic Problems

• Alfred Menezes, Minghua Qu:
  Analysis of the Weil Descent Attack of Gaudry, Hess and Smart. 308-318
  
• Jean-Pierre Seifert:
  Using Fewer Qubits in Shor's Factorization Algorithm Via Simultaneous Diophantine Approximation. 319-327
  

Passwords and Credentials

• Amir Herzberg, Yosi Mass:
  Relying Party Credentials Framework. 328-343
  
• David P. Jablon:
  Password Authentication Using Multiple Servers. 344-360
  
• Philip D. MacKenzie:
  More Efficient Password-Authenticated Key Exchange. 361-377
  

Protocols I

• Yacov Yacobi:
  Improved Boneh-Shaw Content Fingerprinting. 378-391
  
• Yuji Watanabe, Goichiro Hanaoka, Hideki Imai:
  Efficient Asymmetric Public-Key Traitor Tracing without Trusted Agents. 392-407
  
• Ari Juels:
  Targeted Advertising ... And Privacy Too. 408-424
  

Protocols II

• Philippe Golle, Ilya Mironov:
  Uncheatable Distributed Computations. 425-440
  
• Michel Abdalla, Sara K. Miner, Chanathip Namprempre:
  Forward-Secure Threshold Signature Schemes. 441-456
  
• Marc Fischlin:
  A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires. 457-472
  

Last update Sun May 19 21:57:42 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page