Advances in Cryptology - ASIACRYPT 2000

1. Number Theoretic Algorithms

   1. Construction of Hyperelliptic Curves with CM and Its Application to Cryptosystems

      • Jinhui Chao, Kazuto Matsuo, Hiroto Kawashiro, Shigeo Tsujii

      Pages 259-273

2. Symmetric-Key Schemes I

   1. Provable Security for the Skipjack-like Structure against Differential Cryptanalysis and Linear Cryptanalysis

      • Jaechul Sung, Sangjin Lee, Jongin Lim, Seokhie Hong, Sangjoon Park

      Pages 274-288

   2. On the Pseudorandomness of Top-Level Schemes of Block Ciphers

      • Shiho Moriai, Serge Vaudenay

      Pages 289-302

   3. Exploiting Multiples of the Connection Polynomial in Word-Oriented Stream Ciphers

      • Philip Hawkes, Gregory G. Rose

      Pages 303-316

   4. Encode-Then-Encipher Encryption: How to Exploit Nonces or Redundancy in Plaintexts for Efficient Cryptography

      • Mihir Bellare, Phillip Rogaway

      Pages 317-330

3. Protocols II

   1. Verifiable Encryption, Group Encryption, and Their Applications to Separable Group Signatures and Signature Sharing Schemes

      • Jan Camenisch, Ivan Damgård

      Pages 331-345

   2. Addition of El Gamal Plaintexts

      • Markus Jakobsson, Ari Juels

      Pages 346-358

   3. Improved Methods to Perform Threshold RSA

      • Brian King

      Pages 359-372

   4. Commital Deniable Proofs and Electronic Campaign Finance

      • Matt Franklin, Tomas Sander

      Pages 373-387

   5. Provably Secure Metering Scheme

      • Wakaha Ogata, Kaoru Kurosawa

      Pages 388-398

4. Invited Lecture

   1. CRYPTREC Project Cryptographic Evaluation Project for the Japanese Electronic Government

      • Hideki Imai, Atsuhiro Yamagishi

      Pages 399-400

5. Fingerprinting

   1. Anonymous Fingerprinting with Direct Non-repudiation

      • Birgit P. Pfitzmann, Ahmad-Reza Sadeghi

      Pages 401-414

   2. Efficient Anonymous Fingerprinting with Group Signatures

      • Jan Camenisch

      Pages 415-428

6. Zero-Knowledge and Provable Security

   1. Increasing the Power of the Dealer in Non-interactive Zero-Knowledge Proof Systems

      • Danny Gutfreund, Michael Ben-Or

      Pages 429-442

   2. Zero-Knowledge and Code Obfuscation

      • Satoshi Hada

      Pages 443-457

   3. A Note on Security Proofs in the Generic Model

      • Marc Fischlin

      Pages 458-469

7. Boolean Functions

   1. On Relationships among Avalanche, Nonlinearity, and Correlation Immunity

      • Yuliang Zheng, Xian-Mo Zhang

      Pages 470-482

8. Cryptanalysis II

   1. Cryptanalysis of the Yi-Lam Hash

      • David Wagner

      Pages 483-488

   2. Power Analysis, What Is Now Possible...

      • Mehdi-Laurent Akkar, Régis Bevan, Paul Dischamp, Didier Moyart

      Pages 489-502

9. Pseudorandomness

   1. Concrete Security Characterizations of PRFs and PRPs: Reductions and Applications

      • Anand Desai, Sara Miner

      Pages 503-516

ASIACRYPT 2000 was the sixth annual ASIACRYPT conference. It was sp- sored by the International Association for Cryptologic Research (IACR) in - operation with the Institute of Electronics, Information, and Communication Engineers (IEICE). The ?rst conference with the name ASIACRYPT took place in 1991, and the series of ASIACRYPT conferences were held in 1994, 1996, 1998, and 1999, in cooperation with IACR. ASIACRYPT 2000 was the ?rst conference in the series to be sponsored by IACR. The conference received 140 submissions (1 submission was withdrawn by the authors later), and the program committee selected 45 of these for presen- tion. Extended abstracts of the revised versions of these papers are included in these proceedings. The program also included two invited lectures by Thomas Berson (Cryptography Everywhere: IACR Distinguished Lecture) and Hideki Imai (CRYPTREC Project – Cryptographic Evaluation Project for the Japanese Electronic Government). Abstracts of these talks are included in these proce- ings. The conference program also included its traditional “rump session” of short, informal or impromptu presentations, kindly chaired by Moti Yung. Those p- sentations are not re?ected in these proceedings. The selection of the program was a challenging task as many high quality submissions were received. The program committee worked very hard to evaluate the papers with respect to quality, originality, and relevance to cryptography. I am extremely grateful to the program committee members for their en- mous investment of time and e?ort in the di?cult and delicate process of review and selection.

• Cryptography
• RSA
• algorithms
• calculus
• cryptanalysis
• cryptographic protocools
• cryptology
• data encryption
• data security
• digital payment
• information security
• privacy
• security
• systems security
• verification
• algorithm analysis and problem complexity

• NTT Laboratories, Nippon Telegraph and Telephone Corporation, Kanagawa-ken, Japan

  Tatsuaki Okamoto

Policies and ethics