Workshop program

November 19, 2009

12:30: Welcome lunch

14:00: Session 1: Implementation

• Yves Edel and Andreas Klein. Computational aspects of fast correlation attacks. [pdf]
• Anthony Van Herrewege, Miroslav Knezevic, Lejla Batina, Ingrid Verbauwhede and Bart Preneel. Compact Implementations of Pairings. [pdf]
• Boris Skoric. Quantum readout of Physical Unclonable Functions. [pdf]

15:30: Coffee break

16:00: Invited talk by Alex Biryukov

• Related and Open Key Attacks on AES and other Block Ciphers
  In this talk we will describe recent research results on related-key attacks and open key attacks on AES. We will discuss properties of AES key schedule that allow to construct good related-key differentials. We will then explain how to use these differentials in various attacks. This methodology can be applied to the study of key schedules of other block ciphers. Our best attack on full AES-256 takes $2^{99}$ steps while our round-reduced attacks on up to 13 rounds out of 14 are marginally practical. We will discuss open key attacks on block ciphers and their relevance to the security of hashing modes of block ciphers.

17:00: Session 2: Side Channels

• Jorge Guajardo and Bart Mennink. Towards Side-Channel Resistant Block Cipher Usage or Can We Encrypt Without Side-Channel Countermeasures? [pdf]
• Jiqiang Lu, Jing Pan and Jerry den Hartog. Regarding the Security of AES against First and Second-Order Differential Power Analysis. [pdf]

18:00: Business meeting

18:30: Workshop dinner

20:00: Rump session

November 20, 2009

9:30: Session 3: Voting

• Feng Hao, Peter Ryan and Piotr Zielinski. Anonymous Voting by 2-Round Public Discussion. [pdf]
• Ben Smyth, Mark Ryan, Steve Kremer and Mounira Kourjieh. Election verifiability in electronic voting protocols.[html]
• Ben Adida, Olivier de Marneffe, Olivier Pereira and Jean-Jacques Quisquater. Electing a University President using Open-Audit Voting: Analysis of real-world use of Helios.[pdf]

11:00: Coffee break

11:30: Invited talk by Marc Girault

• Cryptology and Elliptic Curves : a 25-year love (?) story
  End of 1984 : a new factoring method emerges from H.W. Lenstra's brain, "... derived from the Pollard p-1-method by replacing the multiplicative group by a random elliptic curve". The algorithm is published in 1985, followed some months later by the idea from Miller and Koblitz to fit Diffie-Hellman and El-Gamal schemes to this new paradigm : ECC is born. In this talk, we try to tell the 25-year love (?) story of cryptology and elliptic curves, by positioning it in the more global context of modern cryptology.

12:30: Lunch

13:30: Session 4: Protocols

• Jorge Guajardo, Bart Mennink and Berry Schoenmakers. Modulo Reduction for Paillier Encryptions and Application to Secure Statistical Analysis.[pdf]
• Gildas Avoine, Christian Floerkemeier and Benjamin Martin. RFID Distance Bounding Multistate Enhancement (Short Version).[pdf]
• Yasser Phoulady. Sharing A Labeled Tree.[pdf]

15:00: Coffee break

15:30: Session 5: Security

• Damiano Bolzoni, Sandro Etalle and Pieter Hartel. Panacea: Automating Attack Classification for Anomaly-based Network Intrusion Detection Systems.[pdf]
• Wojciech Mostowski and Jip Hogenboom. Full Memory Attack on a Java Card.[pdf]

16:30: Closing