Talk submission

Important dates

Submissions

DIAC 2016 calls for submissions of talks on the topics listed below.

Talk submissions should be related to the field of authenticated encryption. Talk submissions addressing latest updates of CAESAR candidates are welcomed. This type should identify themselves as such; for fairness there should be only one submission per candidate. A talk of this type is expected to highlight the latest comparisons, upcomming tweaks, proofs, software/hardware implementations, etc.

Submissions are expected to be on the very latest results and ideas, including work in progress. Submissions are therefore not expected to be full papers; they are expected to be explanations of what talks will contain. However, detailed explanations will help in selecting and organizing talks, and there is no prohibition on submission of papers in cases where papers are available.

DIAC 2016 will not publish formal conference proceedings. There is no prohibition on talk submissions for papers that have been submitted to conferences with proceedings. We plan to make the slides online.

To submit a talk, see Talk Submission. Submissions are not expected to be anonymous.

Topics

• Components and combinations
• Block ciphers
• Dedicated stream ciphers
• Stream ciphers based on block ciphers
• Dedicated hash functions, sponges, etc.
• Hash functions based on block ciphers
• Dedicated MACs
• MACs based on hash functions
• MACs based on block ciphers
• Authenticated encryption based on any of the above
• Dedicated ciphers with built-in authentication
• Attacks
• Cryptanalysis of symmetric systems
• Side-channel attacks on symmetric systems
• Real-world costs of attacks
• Implementations
• APIs
• Software
• FPGAs
• ASICs
• Comparisons
• Requirements
• Quantitative security: e.g., is 80 bits enough?
• Qualitative security: e.g., MAC vs. PRF, INT-PTXT vs. INT-CTXT
• Robustness: e.g., security under nonce reuse, security against idiots
• Side-channel resistance
• Handling of limited randomness
• Safety of using a key for many messages: 2^32? 2^64?
• Key agility
• Throughput in software, FPGA, ASIC
• Parallelizability, incrementality, etc.
• ASIC area budgets, FPGA slice budgets, etc.
• Power limits, energy limits, etc.
• Bandwidth: short plaintexts, ciphertexts, authenticators
• Flexibility: e.g., variable authenticator lengths
• Convenience: e.g., one-pass, intermediate tags
• Use cases

Acknowledgments

The list of topics above is copied from the DIAC 2015, DIAC 2014, DIAC 2013 and DIAC 2012 workshops, which in turn draws on discussions at the January 2012 Dagstuhl workshop on Symmetric Cryptography, including suggestions from Jean-Philippe Aumasson, Eli Biham, Joan Daemen, Orr Dunkelman, Lars Knudsen, Bart Preneel, and Greg Rose.