Crypto 2011 rump session

The Crypto 2011 rump session took place Tuesday 16 August 2011 from 19:30 PDT to 23:00 PDT. Daniel J. Bernstein and Tanja Lange served as chairs. Jim Hughes provided assistance in program selection. Christiane Peters served as horn-blower. Nadia Heninger prepared slides for the panel discussion. The rump session was broadcast live via

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.

Crypto 2011 rump session, Tuesday 16 August 2011
Session 1
19:30Bart PreneelBart PreneelThe 2011 IACR Fellowship Induction Ceremony
19:55Andy Clark, Whit Diffie, David Naccache, Jean-Jacques Quisquater, Peter RyanJean-Jacques QuisquaterAn historical call for papers ...slides
19:57Christiane PetersChristiane PetersPlaying "Spot the Difference" with Springerslides
20:00Eli Biham, Nathan Keller, Orr Dunkelman, Adi ShamirOrr DunkelmanRethinking IDEAslides
20:04Andrey Bogdanov, Dmitry Khovratovich, Christian RechbergerAndrey Bogdanov, Dmitry Khovratovich, Christian RechbergerBiclique cryptanalysis of the full AESslides
20:10Niels FergusonNiels FergusonObservations on H-PRESENT-128slides
20:14Faith Chaza and Ian GoldbergFaith Chaza and Ian GoldbergAn Application Of Frequency Shift Keying To Communication Resynchronisationslides
20:16Itai Dinur, Orr Dunkelman, Adi ShamirAdi ShamirGOSTBUSTERS 2
20:20Danilo GligoroskiDanilo GligoroskiPractical demonstration of Bananb Target Collisions for Skein with NIST KAT filesslides
20:23Dustin Moody and Souradyuti PaulSouradyuti PaulImproving the Indifferentiability Security Bounds for the Fast Wide-pipe and the JH Modesslides
20:27Yuji SugaYuji SugaVariants of Sponge-like Constructionslides
Session 2
20:50Danilo GligoroskiDanilo GligoroskiA silent competition for ultra-fast public key cryptographyslides
20:53Damien Robert, Adi ShamirAdi ShamirExtracting Discrete Logs in Edwards Curves From a Single Unknown Message
20:58Jon Callas, Tamzen Cannoy and Nicko van SomerenBrian LaMacchiaSecure Verification of Delegated Presentation Deliveryslides
21:01Gene Kopp, John Wiltshire-GordonGene Kopp, John Wiltshire-GordonRobust Coin Flippingslides
21:06Peter Schmidt-NielsenPeter Schmidt-NielsenFlipIt and the Cramér-Rao boundslides
21:09Moses Liskov and Orr DunkelmanMoses LiskovIllegitimi Non Irritatum (aut Lorem Ipsum Deserti Omnium)slides
21:14Eric Demaine, Martin Demaine, Jean-Jacques Quisquater, Michaël QuisquaterJean-Jacques QuisquaterAn update about HiDalgo: slides
21:17Ian Goldberg, Kevin McCurley, and Moti YungDaniel J. Bernstein (panel moderator)Panel discussion on leakageslides
21:20Abhishek Banerjee, Chris Peikert, Alon RosenChris PeikertPseudorandom Functions and Latticesslides
21:24Shweta Agrawal, David Freeman, Vinod VaikuntanathanShweta AgrawalPredicate Encryption for Inner Products from LWEslides
21:28Nadia Heninger and Henry CohnNadia HeningerA brief chat about approximate GCDsslides
21:32Daniele Micciancio and Chris PeikertChris PeikertTrapdoors for Lattices: Simpler, Tighter, Faster, Smallerslides
21:36Tom RoederTom RoederBounds on Cloud File Retrievabilityslides
Session 3
22:00Victor MillerVictor MillerFeel Safe at Last!slides
22:01Yvo Desmedt and Pyrros I. P. ChaidosYvo DesmedtBlinding ballot copying in Helios: from Condorcet to IACRslides
22:06David Chaum, Jeremy Clark, Aleks Essex, Ronald Rivest, Alan Sherman, Poorvi Vora, Filip ZagorskiFilip ZagorskiRemotegrityslides
22:11Nir Bitansky, Ran Canetti, Alessandro Chiesa, Eran TromerEran TromerThe Hunting of the SNARKslides
22:16Tatsuaki Okamoto, Katsuyuki TakashimaKatsuyuki TakashimaAdaptively Attribute-Hiding (Hierarchical) Inner Product Encryptionslides
22:20Stefan Dziembowski and Tomasz Kazana and Maciej ObremskiStefan DziembowskiNon-Malleable Codes in the Split-State Model
22:24NIST Computer Security DivisionRene PeraltaNIST Announcementsslides
22:28Yan Huang, David Evans, Jonathan Katz, Lior MalkaYan Huang(More) Efficient Secure Computation from Garbled Circuitsslides
22:33Harry Buhrman, Serge Fehr, Christian Schaffner, Florian SpeelmanChristian SchaffnerThe Garden-Hose Modelslides
22:37Benoit Libert and Moti YungMoti Yung"Extreme" Threshold Cryptosystemsslides
22:42Megumi Ando and Moses LiskovMoses LiskovConsensus in the Asynchronous Hybrid Byzantine Model with Optimal Resilienceslides
22:47Carl Bosley, Kristiyan Haralambiev, and Antonio NicolosiCarl BosleyHB^N: An HB-like protocol secure against Man-in-the-Middle attacksslides
22:51Dov Gordon, Jonathan Katz, Vladimir Kolesnikov, Tal Malkin, Mariana Raykova, Yevgeniy VahlisMariana RaykovaSecure Computation with Sublinear Amortized Workslides
22:55Tom Berson, Nigel Smart, Raphael C.-W. Phan, Orr Dunkelman, Dan PageOrr DunkelmanComputer-Aided Search Heuristic for Blind Revocable Identity Based Encryption Schemesslides
Joshua Davis is a journalist here: digital cash (New Yorker), crypto generally. Need coverage?
CHES2011, September 2011,
CARDIS: a conference about smart cards: September 2011, Leuven, Belgium
Lightweight Cryptography, 28-29 November 2011,
PQCrypto 2011, Taipei, 29 November-2 December,
ISC 2011, CANS2011, ASIACRYPT2012
ICITS 2012,
A Quick Reminder About the Existence of the IACR Forum,