ASIACRYPT 2006: Shanghai, China

Attacks on Hash Functions

• Christophe De Cannière, Christian Rechberger:
  Finding SHA-1 Characteristics: General Results and Applications. 1-20
  
• Yusuke Naito, Yu Sasaki, Takeshi Shimoyama, Jun Yajima, Noboru Kunihiro, Kazuo Ohta:
  Improved Collision Search for SHA-0. 21-36
  
• Scott Contini, Yiqun Lisa Yin:
  Forgery and Partial Key-Recovery Attacks on HMAC and NMAC Using Hash Collisions. 37-53
  

Stream Ciphers and Boolean Functions

• Bin Zhang, Dengguo Feng:
  New Guess-and-Determine Attack on the Self-Shrinking Generator. 54-68
  
• Souradyuti Paul, Bart Preneel:
  On the (In)security of Stream Ciphers Based on Arrays and Modular Addition. 69-83
  
• Na Li, Wen-Feng Qi:
  Construction and Analysis of Boolean Functions of 2t+1 Variables with Maximum Algebraic Immunity. 84-98
  

Biometrics and ECC Computation

• Qiming Li, Yagiz Sutcu, Nasir D. Memon:
  Secure Sketch for Biometric Templates. 99-113
  
• Pierrick Gaudry, T. Houtmann, D. Kohel, Christophe Ritzenthaler, A. Weng:
  The 2-Adic CM Method for Genus 2 Curves with Application to Cryptography. 114-129
  
• Roberto Maria Avanzi, Vassil S. Dimitrov, Christophe Doche, Francesco Sica:
  Extending Scalar Multiplication Using Double Bases. 130-144
  

ID-Based Schemes

• Sanjit Chatterjee, Palash Sarkar:
  HIBE With Short Public Parameters Without Random Oracle. 145-160
  
• Nuttapong Attrapadung, Jun Furukawa, Hideki Imai:
  Forward-Secure and Searchable Broadcast Encryption with Short Ciphertexts and Private Keys. 161-177
  
• David Galindo, Javier Herranz, Eike Kiltz:
  On the Generic Construction of Identity-Based Signatures with Additional Properties. 178-193
  

Public-Key Schemes

• Ron Steinfeld, Josef Pieprzyk, Huaxiong Wang:
  On the Provable Security of an Efficient RSA-Based Pseudorandom Generator. 194-209
  
• Alexandra Boldyreva, Marc Fischlin:
  On the Security of OAEP. 210-225
  
• Isamu Teranishi, Wakaha Ogata:
  Relationship Between Standard Model Plaintext Awareness and Message Hiding. 226-240
  

RSA and Factorization

• Gregor Leander, Andy Rupp:
  On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms. 241-251
  
• Pascal Paillier, Jorge Luis Villar:
  Trading One-Wayness Against Chosen-Ciphertext Security in Factoring-Based Encryption. 252-266
  
• Ellen Jochemsz, Alexander May:
  A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants. 267-282
  

Construction of Hash Function

• Donghoon Chang, Sangjin Lee, Mridul Nandi, Moti Yung:
  Indifferentiable Security Analysis of Popular Hash Functions with Prefix-Free Padding. 283-298
  
• Mihir Bellare, Thomas Ristenpart:
  Multi-Property-Preserving Hash Domain Extension and the EMD Transform. 299-314
  
• Thomas Peyrin, Henri Gilbert, Frédéric Muller, Matthew J. B. Robshaw:
  Combining Compression Functions and Block Cipher-Based Hash Functions. 315-331
  

Protocols

• Michel Abdalla, David Pointcheval:
  A Scalable Password-Based Group Key Exchange Protocol in the Standard Model. 332-347
  
• Ventzislav Nikov, Svetla Nikova, Bart Preneel:
  A Weakness in Some Oblivious Transfer and Zero-Knowledge Protocols. 348-363
  
• Satoshi Obana, Toshinori Araki:
  Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution. 364-379
  

Block Ciphers

• Thomas Baignères, Matthieu Finiasz:
  KFC - The Krazy Feistel Cipher. 380-395
  
• Jacques Patarin, Valérie Nachef, Côme Berbain:
  Generic Attacks on Unbalanced Feistel Schemes with Contracting Functions. 396-411
  
• Eli Biham, Orr Dunkelman, Nathan Keller:
  New Cryptanalytic Results on IDEA. 412-427
  

Signatures

• Kaoru Kurosawa, Tsuyoshi Takagi:
  New Approach for Selectively Convertible Undeniable Signature Schemes. 428-443
  
• Jens Groth:
  Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures. 444-459
  
• Zhengjun Cao:
  Analysis of One Popular Group Signature Scheme. 460-466