The call for submissions has been archived on a separate page. Slides are now available from all presenters who agreed to have their slides officially online.

Authors Speaker Title Slides

Crypto 2012 rump session, Tuesday 21 August 2012

Session 1

19:30 Daniel J. Bernstein, Tanja Lange Daniel J. Bernstein Welcome to the rump session slides

19:32 Bart Preneel Bart Preneel IACR 2012 Fellows Induction Ceremony slides

19:47 Mitsuru Matsui Mitsuru Matsui Celebrating the 25th year of FEAL - A new prize problem slides

19:52 Jean-Jacques Quisquater and Yvo Desmedt Yvo Desmedt The relevance of the Chinese Lotto: 25 years outsourcing of cryptanalysis slides

19:56 Patrick Derbez, Pierre-Alain Fouque, Jérémy Jean Jérémy Jean Improved Key Recovery Attacks on Reduced-Round AES slides

20:00 Serge Vaudenay Serge Vaudenay The End of Encryption based on Card Shuffling slides

20:05 Meltem Sonmez Turan Meltem Sonmez Turan Perfect Hellman Tables using Bloom Filters slides

20:10 Nadia Heninger, Zakir Durumeric, Eric Wustrow, J. Alex Halderman Nadia Heninger Entropy slides

20:17 David Chaum David Chaum Online movies that cannot be copied slides

20:20 Ran Canetti Ran Canetti Double blind reviewing in IACR conferences, revisited slides

20:23 Yvo Desmedt Yvo Desmedt Does the ePrint Archive hurt Cryptographers? slides

20:25 Daniel J. Bernstein, Joppe Bos, Faith Chaza, Tanja Lange, Kristin Lauter, Michael Naehrig, Christof Paar Michael Naehrig The end of crypto slides

20:30 Break

Session 2

21:00 Jon Callas, Tamzen Cannoy, Nicko van Someren Jon Callas The Security of Very Dense Cryptography slides

21:05 Josep Balash, Baris Ege, Thomas Eisenbarth, Benoît Gérard, Zheng Gong, Tim Güneysu, Stefan Heyse, Sebastiaan Indesteege, Stephanie Kerckhof, Francois Koeune, Tomislav Nad, Thomas Plos, Thomas Pöppelman, Francesco Regazzoni, Francois-Xavier Standaert, Gilles Van Assche, Ingo von Maurich, Loïc van Oldeneel tot Oldenzeel Olivier Pereira Open Source Implementations of Hash Functions in an Atmel AtTiny45 slides

21:08 Bill Burr Bill Burr SHA--3 Update & NIST Thank You slides

21:13 Alexander Schlösser, Dmitry Nedospasov, Juliane Krämer, Susanna Orlic, Jean-Pierre Seifert Juliane Krämer Photonic Side Channel Analysis for the rest of us

21:18 Marc Joye Marc Joye Edwards Curves and Fault Attacks slides

21:23 Tomoko Yonemura, Taichi Isogai, Hirofumi Muratani, and Yoshikazu Hanatani (Toshiba Corporation) Hirofumi Muratani COTORI(TM): Cryptosystems On TORI slides

21:24 Takuya Hayashi, Takeshi Shimoyama, Naoyuki Shinohara, and Tsuyoshi Takagi Takuya Hayashi Breaking Pairing-based Cryptosystems using $\eta_T$ Pairing over $GF(3^{97})$ slides

21:28 Gilles Bartes, Juan Manuel Crespo, Martin Gagné, Benjamen Grégoire, César Kunz, Yassine Lakhnech and Santiago Zanella-Béguelin Martin Gagné Synthesis of OWF-based Encryption Schemes slides

21:32 Xavier Boyen Xavier Boyen Attribute-Based Encryption from Lattices slides

21:36 Tatsuaki Okamoto, Katsuyuki Takashima Katsuyuki Takashima Efficient (Hierarchical) Inner Product Encryption Tightly Reduced from the Decisional Linear Assumption slides

21:41 Tom Roeder and Christian Paquin Tom Roeder Padding Oracles Revisited slides

21:45 Break

Session 3

22:15 Nadia Heninger, Zakir Durumeric, Eric Wustrow, J. Alex Halderman Nadia Heninger The case of the RSA FUCK-A-DUCK certificate slides

22:22 Periklis A. Papakonstantinou & Guang Yang Guang Yang Cryptography in the Streaming Model slides

22:27 DongHoon Chang, Moti Yung Moti Yung Midgame Attacks slides

22:32 Danilo Gligoroski Danilo Gligoroski Coalition between Bob and Eve in the Man In The Middle Attack slides

22:35 Dario Fiore and Rosario Gennaro Rosario Gennaro Publicly Verifiable Delegation of Large Polynomials and Matrix Computations slides

22:40 Mohammad Mahmoody, Hemanta K. Maji, Manoj Prabhakaran Hemanta K. Maji How Useful are Random Oracles? slides

22:44 Vipul Goyal Vipul Goyal Positive results for concurrently secure computation in the plain model slides

22:48 Yvo Desmedt, Pyrros Chaidos Yvo Desmedt PKC + MPC + Internet voting implies ``secret endorsements'', or, how politicians can keep their friends slides

22:53 David Chaum David Chaum CryptINKgraphy slides

22:57 David Chaum David Chaum Random-Sample Elections: Far lower cost, better quality and more democratic slides

23:00 Fin!

Wednesday 22 August 2012, 15:30--16:45, outside Campbell: Randomness-generation BoF

applied-cryptographers-at-crypto+subscribe@googlegroups.com

3--6 March 2013: The Tenth Theory of Cryptography Conference (TCC2013), Tokyo, Japan, http://www.iacr.org

1--5 April 2013: Financial Cryptography and Data Security 2013 (FC'13), Okinawa, Japan, http://fc13.ifca.ai