In Cooperation
with IACR


The mathematical theory and practice of cryptography and coding underpins the provision of effective security and reliability for data communication, processing and storage. Theoretical and practical advances in the fields of cryptography and coding are therefore a key factor in facilitating the growth of data communications and data networks of various types. Thus, this fifteenth International Conference in an established and successful IMA series on the theme of "Cryptography and Coding" was both timely and relevant. Original research papers on all technical aspects of cryptography and coding were presented.

The program featured 18 contributed talks and 4 invited talks by Sihem Mesnager, Alexander May, Allison Bishop and Daniel Wichs. The program can be found here and the abstracts of the invited talks here. The proceedings were published in Springer's Lecture Notes in Computer Science series volume 9496. The full versions of all accepted papers are available online; you can find links to them below together with the slides when made available by the presenters.


  1. Sihem Mesnager: Bent functions and their connections to coding theory and cryptography.
  2. Alexander May: Recent Advances in Decoding Binary Linear Codes and their Implication for Cryptography
  3. Allison Bishop: Steps Towards a Unified Coding Theory for Distributed Algorithms
  4. Daniel Wichs: Tamper Detection and Non-malleable codes


  1. Codes of length 2 correcting single errors of limited size
    Torleiv Kløve
    University of Bergen
    Full version
  2. Soft distance metric decoding of polar codes
    Monica C. Liberatori; Leonardo J. Arnone; Jorge Castiñeira Moreira; Patrick G. Farrell
    Electronics Department, Engineering School, Mar del Plata University, Argentina; Electronics Department, Engineering School, Mar del Plata University, Argentina; Electronics Department, Engineering School, Mar del Plata University, Argentina; University of Kent, Kent, UK
    Full version
  3. Zero-Knowledge Interactive Proof Systems for New Lattice Problems
    Claude Crépeau; Raza Ali Kazmi
    School of Computer Science, McGill University; School of Computer Science, McGill University
    Full version
  4. A New Approach To Efficient Revocable Attribute-Based Anonymous Credentials
    David Derler; Christian Hanser; Daniel Slamanig
    IAIK, Graz University of Technology; IAIK, Graz University of Technology; IAIK, Graz University of Technology
    Full version     Slides
  5. Security Against Related Randomness Attacks via Reconstructive Extractors
    Kenneth G. Paterson; Jacob C. N. Schuldt; Dale L. Sibborn; Hoeteck Wee
    Royal Holloway, University of London; Research Center for Information Security, AIST; Royal Holloway, University of London; ENS, Paris
    Full version
  6. On the diffusion property of iterated functions
    Jian Liu; Sihem Mesnager; Lusheng Chen
    School of Computer Software, Tianjin University, Tianjin 300072, P. R. China and CNRS, UMR 7539, LAGA, Paris, France; Department of Mathematics, University of Paris VIII, University of Paris XIII, CNRS, UMR 7539 LAGA and Telecom ParisTech, Paris, France; School of Mathematical Sciences, Nankai University, Tianjin 300071, P. R. China
    Full version     Slides
  7. Continuous After-the-fact Leakage-Resilient eCK-secure Key Exchange
    Janaka Alawatugoda; Douglas Stebila; Colin Boyd
    Queensland University of Technology; Queensland University of Technology; Norwegian University of Science and Technology
    Full version     Slides
  8. A Leakage Resilient MAC
    Daniel P. Martin; Elisabeth Oswald; Martijn Stam; Marcin Wójcik
    University of Bristol; University of Bristol; University of Bristol; University of Bristol
    Full version
  9. Robust Authenticated Encryption and the Limits of Symmetric Cryptography
    Christian Badertscher; Christian Matt; Ueli Maurer; Phillip Rogaway; Björn Tackmann
    ETH Zurich; ETH Zurich; ETH Zurich; UC Davis; UC San Diego
    Full version     Slides
  10. Leakage-Resilient Identification Schemes from Zero-Knowledge Proofs of Storage
    Giuseppe Ateniese; Antonio Faonio; Seny Kamara
    Sapienza Univ. of Rome and John Hopkins University; Aarhus University; Microsoft Research
    Full version
  11. Bent and semi-bent functions via linear translators
    Neşe Koçak; Sihem Mesnager; Ferruh Özbudak
    ASELSAN Inc. Ankara, Turkey; University of Paris VIII, University of Paris XIII, CNRS and Telecom ParisTech, France; Middle East Technical University, Ankara, Turkey
    Full version
  12. Tweak-Length Extension for Tweakable Block Ciphers
    Kazuhiko Minematsu; Tetsu Iwata
    NEC Corporation; Nagoya University
    Full version
  13. Comparison of cube attacks over different vector spaces
    Richard Winter; Ana Salagean; Raphael C.W. Phan
    Loughborough University; Loughborough University; Multimedia University
    Full version
  14. MI-T-HFE, a New Multivariate Signature Scheme
    Wenbin Zhang; Chik How Tan
    Temasek Laboratories, National University of Singapore; Temasek Laboratories, National University of Singapore
    Full version
  15. Rogue decryption failures: reconciling AE robustness notions
    Guy Barwell; Daniel Page; Martijn Stam
    University of Bristol; University of Bristol; University of Bristol
    Full version     Slides
  16. Shannon Entropy versus Renyi Entropy from a Cryptographic Viewpoint
    Maciej Skorski
    University of Warsaw
    Full version
  17. On the Doubly Sparse Compressed Sensing Problem
    Grigory Kabatiansky; Serge Vladuts; Cedric Tavernier
    Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia (IITP RAS); IITP RAS and Aix-Marseille Universite, IML, Marseille, France; Assystems AEOS, France
    Full version     Slides
  18. A Compiler of Two-Party Protocols for Composable and Game-Theoretic Security, and Its Application to Oblivious Transfer
    Shota Goto; Junji Shikata
    Yokohama National University in Japan; Yokohama National University in Japan
    Full version     Slides