Abstract is missing.
- Efficient (Ideal) Lattice Sieving Using Cross-Polytope LSHAnja Becker, Thijs Laarhoven. 3-23 [doi]
- On the Hardness of LWE with Binary Error: Revisiting the Hybrid Lattice-Reduction and Meet-in-the-Middle AttackJohannes A. Buchmann, Florian Göpfert, Rachel Player, Thomas Wunderer. 24-43 [doi]
- An Efficient Lattice-Based Signature Scheme with Provably Secure InstantiationSedat Akleylek, Nina Bindel, Johannes A. Buchmann, Juliane Krämer, Giorgia Azzurra Marson. 44-60 [doi]
- A Fast and Compact FPGA Implementation of Elliptic Curve Cryptography Using Lambda CoordinatesBurak Gövem, Kimmo Järvinen, Kris Aerts, Ingrid Verbauwhede, Nele Mentens. 63-83 [doi]
- Three Dimensional Montgomery Ladder, Differential Point Tripling on Montgomery Curves and Point Quintupling on Weierstrass' and Edwards CurvesSrinivasa Rao Subramanya Rao. 84-106 [doi]
- Cryptanalysis of PRINCE with Minimal DataShahram Rasoolzadeh, Håvard Raddum. 109-126 [doi]
- Authentication Key Recovery on Galois/Counter Mode (GCM)John Mattsson, Magnus Westerlund. 127-143 [doi]
- Extreme Pipelining Towards the Best Area-Performance Trade-Off in HardwareStjepan Picek, Dominik Sisejkovic, Domagoj Jakobovic, Lejla Batina, Bohan Yang 0001, Danilo Sijacic, Nele Mentens. 147-166 [doi]
- A Deeper Understanding of the XOR Count Distribution in the Context of Lightweight CryptographySumanta Sarkar, Siang Meng Sim. 167-182 [doi]
- Prover-Efficient Commit-and-Prove Zero-Knowledge SNARKsHelger Lipmaa. 185-206 [doi]
- On the Security of the (F)HMQV ProtocolAugustin P. Sarr, Philippe Elbaz-Vincent. 207-224 [doi]
- Non-Interactive Verifiable Secret Sharing for Monotone CircuitsGe Bai, Ivan Damgård, Claudio Orlandi, Yu Xia. 225-244 [doi]
- Fast Oblivious AES A Dedicated Application of the MiniMac ProtocolIvan Damgård, Rasmus Winther Zakarias. 245-264 [doi]
- Certificate Validation in Secure Computation and Its Use in Verifiable Linear ProgrammingSebastiaan de Hoogh, Berry Schoenmakers, Meilof Veeningen. 265-284 [doi]
- Software-Only Two-Factor Authentication Secure Against Active ServersJulien Bringer, Hervé Chabanne, Roch Lescuyer. 285-303 [doi]
- Attribute-Based Fully Homomorphic Encryption with a Bounded Number of InputsMichael Clear, Ciaran McGoldrick. 307-324 [doi]
- Adaptively Secure Unrestricted Attribute-Based Encryption with Subset Difference Revocation in Bilinear Groups of Prime OrderPratish Datta, Ratna Dutta, Sourav Mukhopadhyay. 325-345 [doi]
- Weak Keys for the Quasi-Cyclic MDPC Public Key Encryption SchemeMagali Bardet, Vlad Dragoi, Jean-Gabriel Luque, Ayoub Otmani. 346-367 [doi]