30 April – 4 May 2017
Paris, France

Rump Session

The session chairs, Saqib and Olivier, kindly ask for your contribution. Presentations should be short and entertaining, and may cover everything ranging from research results over politics to sheer nonsense. We are also accepting CfPs and job advertisements. Additionally, we would invite you to submit single slides for powerpoint karaoke. Please use our online submission system to submit your contributions. The deadline is Tuesday 12pm CET.


Saqib A. Kakvi / Olivier Blazy
20:05CFP: Eurocrypt 2018
Orr Dunkelman
20:06CFP: CANS 2017
Yvo Desmedt
20:07CFP: Cryptographic Technologies for Securing Network Storage and their Mathematical Model
Yvo Desmedt
20:09Vector Encoding and Its Applications
Xiong Fan
20:11Fair security definitions
Dennis Hofheinz
20:15Crypto in Central Europe
Nicolas Courtois
20:18Quantum computers are a delusion - Feynman's joke
Steve Meyer
20:21GQ1, GQ2, GQ-tree?
Jean-Jacques Quiquater
20:24Lockable Obfuscation
Brent Waters
20:26Goal: standardizing VRFs
Leonid Reyzin
20:28Non-Full Sbox Linearization: Applications to Collision Attacks on Round-Reduced Keccak
Ling Song
20:30Cryptanalysis of VingCard
Krzysztof Pietrzak
20:33Watermarking Cryptographic Functionalities from Standard Lattice Assumptions
David J. Wu
20:35Speeding up Huff Form of Elliptic Curves
N. Orhon / H. Hisil
20:37CFP: Post-quantum
Tanja Lange
20:39CFP: Latincrypt 2017
T.Lange / O. Dunkelman
20:41Announcement of two profiles of the NIST Lightweight Crypto Project
Rene Peralta
20:43QR codes in Eurocrypt
Adrian Tillard
20:45Cocktail break
Olivier Blazy / Saqib A. Kakvi
21:32Make Eurocrypt great again
Orr Dunkelman
21:35CFP: Data Privacy / Workshop on CryptoCurrencies
Joaquin Garcia-Alfaro
21:37CFP: ICITS 2017
Junji Shikata
21:38How to land a job at a Patisserie, or: how to construct a leakage resilient trusted party
Mor Weiss
21:41University of Luxembourg: Open Positions
Moon Sung Lee
Aggelos Kiayias
21:44Are block ciphers secure against linear cryptanalysis?
Tomer Ashur
21:47TFHE library 1.0 is released
I. Chillotti/M. Georgieva
21:49Two killer apps for MPC
M. Keller / I. Damgård
21:52Authenticated Garbling for Malicious Secure Computation
Xiao Wang
21:54Strawberries versus Bananas
Pascal Paillier
21:56DiscreteLogDB: Database of computations of discrete logarithms
L. Grémy / A. Guillevic
21:58Functional Graph Revisited: Updates on (Second) Preimage Attacks on Hash Combiners
Z. Bao / L. Wang / J. Guo / D. Gu
22:00Range Proofs for Confidential Transactions
Benedikt Bünz
22:02Adventures in Standardizing Security by Obscurity
Harry Halpin
22:05CHES new publication model
Matthieu Rivain

Time constraints

For your presentation, certain time constraints will be enforced.

submission type maximum time
CfPs/Adversts 0.75 - 1 min
Informational 2 - 2.5 min
Funny 3 - 3.5 min

You may get bonus time for the following (but you may also be penalised at the discretion of the chairs):

  • Cheese Puns
  • Wine Puns
  • Pictures of food
  • Correct usage of French
  • Mentions of certain Parisian landmarks
  • Compliments to the chairs

Slides constraints

Please submit your slides in PDF format using our submission server.

To ensure a smooth transition between the talks we will collate the slides of all presentations into a single file. For this reason we only accept submissions in PDF format. We will insert unified title slides between each two presentations, with the following information:

  • title of talk
  • author names
  • affiliations

In particular, your submission should not include its own title page. In case you really really really insist that you cannot submit in PDF format (e.g., because animations are vital for your presentation), please contact the session chairs and request an exception. In this case, do not submit your contribution through the online system.