Applied Cryptography and Network Security

1. Front Matter

   PDF

2. Public Key Encryption

   1. On the Broadcast and Validity-Checking Security of pkcs#1 v1.5 Encryption

      • Aurélie Bauer, Jean-Sébastien Coron, David Naccache, Mehdi Tibouchi, Damien Vergnaud

      Pages 1-18

   2. How to Construct Interval Encryption from Binary Tree Encryption

      • Huang Lin, Zhenfu Cao, Xiaohui Liang, Muxin Zhou, Haojin Zhu, Dongsheng Xing

      Pages 19-34

   3. Shrinking the Keys of Discrete-Log-Type Lossy Trapdoor Functions

      • Xavier Boyen, Brent Waters

      Pages 35-52

3. Digital Signature

   1. Trapdoor Sanitizable Signatures Made Easy

      • Dae Hyun Yum, Jae Woo Seo, Pil Joong Lee

      Pages 53-68

   2. Generic Constructions for Verifiably Encrypted Signatures without Random Oracles or NIZKs

      • Markus Rückert, Michael Schneider, Dominique Schröoder

      Pages 69-86

   3. Redactable Signatures for Tree-Structured Data: Definitions and Constructions

      • Christina Brzuska, Heike Busch, Oezguer Dagdelen, Marc Fischlin, Martin Franz, Stefan Katzenbeisser et al.

      Pages 87-104

4. Block Ciphers and Hash Functions

   1. Impossible Differential Cryptanalysis on Feistel Ciphers with SP and SPS Round Functions

      • Yuechuan Wei, Ping Li, Bing Sun, Chao Li

      Pages 105-122

   2. Multi-trail Statistical Saturation Attacks

      • Baudoin Collard, Francois-Xavier Standaert

      Pages 123-138

   3. Multiset Collision Attacks on Reduced-Round SNOW 3G and SNOW 3G ⊕

      • Alex Biryukov, Deike Priemuth-Schmid, Bin Zhang

      Pages 139-153

   4. High Performance GHASH Function for Long Messages

      • Nicolas Méloni, Christophe Négre, M. Anwar Hasan

      Pages 154-167

5. Side-Channel Attacks

   1. Principles on the Security of AES against First and Second-Order Differential Power Analysis

      • Jiqiang Lu, Jing Pan, Jerry den Hartog

      Pages 168-185

   2. Adaptive Chosen-Message Side-Channel Attacks

      • Nicolas Veyrat-Charvillon, François-Xavier Standaert

      Pages 186-199

   3. Secure Multiplicative Masking of Power Functions

      • Laurie Genelle, Emmanuel Prouff, Michaël Quisquater

      Pages 200-217

6. Zero Knowledge and Multi-party Protocols

   1. Batch Groth–Sahai

      • Olivier Blazy, Georg Fuchsbauer, Malika Izabachène, Amandine Jambert, Hervé Sibert, Damien Vergnaud

      Pages 218-235

   2. Efficient and Secure Evaluation of Multivariate Polynomials and Applications

      • Matthew Franklin, Payman Mohassel

      Pages 236-254

   3. Efficient Implementation of the Orlandi Protocol

      • Thomas P. Jakobsen, Marc X. Makkes, Janus Dam Nielsen

      Pages 255-272

   4. Improving the Round Complexity of Traitor Tracing Schemes

      • Aggelos Kiayias, Serdar Pehlivanoglu

      Pages 273-290

7. Key Management

   1. Password Based Key Exchange Protocols on Elliptic Curves Which Conceal the Public Parameters

      • Julien Bringer, Hervé Chabanne, Thomas Icart

      Pages 291-308

   2. Okamoto-Tanaka Revisited: Fully Authenticated Diffie-Hellman with Minimal Overhead

      • Rosario Gennaro, Hugo Krawczyk, Tal Rabin

      Pages 309-328

ACNS 2010, the 8th International Conference on Applied Cryptography and Network Security, was held in Beijing, China, during June 22-25, 2010. ACNS 2010 brought together individuals from academia and industry involved in m- tiple research disciplines of cryptography and security to foster the exchange of ideas. ACNS was initiated in 2003, and there has been a steady improvement in the quality of its program over the past 8 years: ACNS 2003 (Kunming, China), ACNS 2004 (Yellow Mountain, China), ACNS 2005 (New York, USA), ACNS 2006 (Singapore), ACNS 2007 (Zhuhai, China), ACNS 2008 (New York, USA), ACNS2009(Paris,France). Theaverageacceptanceratehasbeenkeptataround 17%, and the average number of participants has been kept at around 100. The conference received a total of 178 submissions from all over the world. Each submission was assigned to at least three committee members. Subm- sions co-authored by members of the Program Committee were assigned to at least four committee members. Due to the large number of high-quality s- missions, the review process was challenging and we are deeply grateful to the committee members and the external reviewers for their outstanding work. - ter extensive discussions, the Program Committee selected 32 submissions for presentation in the academic track, and these are the articles that are included in this volume (LNCS 6123). Additionally, a few other submissionswereselected for presentation in the non-archival industrial track.

• AES
• RFID
• RSA
• algorithms
• authentication
• calculus
• complexity
• cryptanalysis
• cryptography
• hash function
• algorithm analysis and problem complexity

• Institute for Infocomm Research, Singapore

  Jianying Zhou

• Computer Science Department, Google Inc. and Columbia University, New York, USA

  Moti Yung

Policies and ethics