Progress in Cryptology - INDOCRYPT 2012

1. Front Matter

   PDF

2. Invited Papers

   1. How to Compute on Encrypted Data

      • Vinod Vaikuntanathan

      Pages 1-15

   2. From Multiple Encryption to Knapsacks – Efficient Dissection of Composite Problems

      • Orr Dunkelman

      Pages 16-16

   3. Using the Cloud to Determine Key Strengths

      • Thorsten Kleinjung, Arjen K. Lenstra, Dan Page, Nigel P. Smart

      Pages 17-39

3. Protocol

   1. A Unified Characterization of Completeness and Triviality for Secure Function Evaluation

      • Hemanta K. Maji, Manoj Prabhakaran, Mike Rosulek

      Pages 40-59

   2. On the Non-malleability of the Fiat-Shamir Transform

      • Sebastian Faust, Markulf Kohlweiss, Giorgia Azzurra Marson, Daniele Venturi

      Pages 60-79

   3. Another Look at Symmetric Incoherent Optimal Eavesdropping against BB84

      • Arpita Maitra, Goutam Paul

      Pages 80-99

   4. On-Line/Off-Line Leakage Resilient Secure Computation Protocols

      • Chaya Ganesh, Vipul Goyal, Satya Lokam

      Pages 100-119

4. Side Channel

   1. Leakage Squeezing of Order Two

      • Claude Carlet, Jean-Luc Danger, Sylvain Guilley, Houssem Maghrebi

      Pages 120-139

   2. ROSETTA for Single Trace Analysis

      • Christophe Clavier, Benoit Feix, Georges Gagnerot, Christophe Giraud, Mylène Roussellet, Vincent Verneuil

      Pages 140-155

5. Hash Functions and Stream Cipher

   1. Collision Attack on the Hamsi-256 Compression Function

      • Mario Lamberger, Florian Mendel, Vincent Rijmen

      Pages 156-171

   2. Generalized Iterated Hash Fuctions Revisited: New Complexity Bounds for Multicollision Attacks

      • Tuomas Kortelainen, Ari Vesanen, Juha Kortelainen

      Pages 172-190

   3. A Differential Fault Attack on the Grain Family under Reasonable Assumptions

      • Subhadeep Banik, Subhamoy Maitra, Santanu Sarkar

      Pages 191-208

   4. Cryptanalysis of Pseudo-random Generators Based on Vectorial FCSRs

      • Thierry P. Berger, Marine Minier

      Pages 209-224

6. Cryptanalysis of Block Ciphers

   1. Faster Chosen-Key Distinguishers on Reduced-Round AES

      • Patrick Derbez, Pierre-Alain Fouque, Jérémy Jean

      Pages 225-243

   2. The Higher-Order Meet-in-the-Middle Attack and Its Application to the Camellia Block Cipher

      • Jiqiang Lu, Yongzhuang Wei, Jongsung Kim, Enes Pasalic

      Pages 244-264

   3. Double-SP Is Weaker Than Single-SP: Rebound Attacks on Feistel Ciphers with Several Rounds

      • Yu Sasaki

      Pages 265-282

   4. Automatic Search of Truncated Impossible Differentials for Word-Oriented Block Ciphers

      • Shengbao Wu, Mingsheng Wang

      Pages 283-302

7. Time Memory Trade-Off

   1. High-Speed Parallel Implementations of the Rainbow Method in a Heterogeneous System

      • Jung Woo Kim, Jungjoo Seo, Jin Hong, Kunsoo Park, Sung-Ryul Kim

      Pages 303-316

   2. Computing Small Discrete Logarithms Faster

      • Daniel J. Bernstein, Tanja Lange

      Pages 317-338

This book constitutes the refereed proceedings of the 12th International Conference on Cryptology in India, INDOCRYPT 2011, held in Chennai, India, in December 2011. The 22 revised full papers presented together with the abstracts of 3 invited talks and 3 tutorials were carefully reviewed and selected from 127 submissions. The papers are organized in topical sections on side-channel attacks, secret-key cryptography, hash functions, pairings, and protocols.

• algorithm analysis and problem complexity

• Department of Mathematics, University of Auckland, Auckland, New Zealand

  Steven Galbraith

• Indian Statistical Institute, Applied Statistics Unit, Kolkata, India

  Mridul Nandi

Up to date results

Fast conference proceedings

Unique visiblility

Policies and ethics