Selected Areas in Cryptography – SAC 2017: 24th International Conference, Ottawa, ON, Canada, August 16-18, 2017, Revised Selected Papers

462 Pages·2018·15.081 MB·English

by  Carlisle Adams,Jan Camenisch (eds.)

Carlisle Adams
Jan Camenisch (Eds.)
Selected Areas
9
1
7 in Cryptography –
0
1

S
C SAC 2017
N
L
24th International Conference
Ottawa, ON, Canada, August 16–18, 2017
Revised Selected Papers
123
Lecture Notes in Computer Science 10719
Commenced Publication in 1973
Founding and Former Series Editors:
Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen
Editorial Board
David Hutchison
Lancaster University, Lancaster, UK
Takeo Kanade
Carnegie Mellon University, Pittsburgh, PA, USA
Josef Kittler
University of Surrey, Guildford, UK
Jon M. Kleinberg
Cornell University, Ithaca, NY, USA
Friedemann Mattern
ETH Zurich, Zurich, Switzerland
John C. Mitchell
Stanford University, Stanford, CA, USA
Moni Naor
Weizmann Institute of Science, Rehovot, Israel
C. Pandu Rangan
Indian Institute of Technology, Madras, India
Bernhard Steffen
TU Dortmund University, Dortmund, Germany
Demetri Terzopoulos
University of California, Los Angeles, CA, USA
Doug Tygar
University of California, Berkeley, CA, USA
Gerhard Weikum
Max Planck Institute for Informatics, Saarbrücken, Germany
More information about this series at http://www.springer.com/series/7410
Carlisle Adams Jan Camenisch (Eds.)
(cid:129)
Selected Areas
–
in Cryptography
SAC 2017
24th International Conference
–
Ottawa, ON, Canada, August 16 18, 2017
Revised Selected Papers
123
Editors
Carlisle Adams Jan Camenisch
Schoolof Electrical Engineering IBMResearch - Zurich
andComputer Science (SITE) Rueschlikon
University of Ottawa Switzerland
Ottawa, ON
Canada
ISSN 0302-9743 ISSN 1611-3349 (electronic)
Lecture Notesin Computer Science
ISBN 978-3-319-72564-2 ISBN978-3-319-72565-9 (eBook)
https://doi.org/10.1007/978-3-319-72565-9
LibraryofCongressControlNumber:2017962894
LNCSSublibrary:SL4–SecurityandCryptology
©SpringerInternationalPublishingAG2018
Thisworkissubjecttocopyright.AllrightsarereservedbythePublisher,whetherthewholeorpartofthe
material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation,
broadcasting, reproduction on microfilms or in any other physical way, and transmission or information
storageandretrieval,electronicadaptation,computersoftware,orbysimilarordissimilarmethodologynow
knownorhereafterdeveloped.
Theuseofgeneraldescriptivenames,registerednames,trademarks,servicemarks,etc.inthispublication
doesnotimply,evenintheabsenceofaspecificstatement,thatsuchnamesareexemptfromtherelevant
protectivelawsandregulationsandthereforefreeforgeneraluse.
Thepublisher,theauthorsandtheeditorsaresafetoassumethattheadviceandinformationinthisbookare
believedtobetrueandaccurateatthedateofpublication.Neitherthepublishernortheauthorsortheeditors
give a warranty, express or implied, with respect to the material contained herein or for any errors or
omissionsthatmayhavebeenmade.Thepublisherremainsneutralwithregardtojurisdictionalclaimsin
publishedmapsandinstitutionalaffiliations.
Printedonacid-freepaper
ThisSpringerimprintispublishedbySpringerNature
TheregisteredcompanyisSpringerInternationalPublishingAG
Theregisteredcompanyaddressis:Gewerbestrasse11,6330Cham,Switzerland
Preface
The Conference on Selected Areas in Cryptography (SAC) is the leading Canadian
venue for the presentation and publication of cryptographic research. The 24th annual
SAC was held this year at the University of Ottawa, Ontario (for the second time; the
first was in 2007). In keeping with its tradition, SAC 2017 offered a relaxed and
collegial atmosphere for researchers to present and discuss new results.
SAC has three regular themes:
– Design and analysis of symmetric key primitives and cryptosystems, including
block and stream ciphers, hash functions, MAC algorithms, and authenticated
encryption schemes
– Efficient implementations of symmetric and public key algorithms
– Mathematical and algorithmic aspects of applied cryptology
The following special (or focus) theme for this year was:
– Post-quantum cryptography
A total of 66 submissions were received, out of which the Program Committee
selected 23 papers for presentation. It is our pleasure to thank the authors of all the
submissionsforthehighqualityoftheirwork.Thereviewprocesswasthorough(each
submission received the attention of at least three reviewers, and at least five for
submissions involving a Program Committee member).
There were two invited talks. The Stafford Tavares Lecture was given by Helena
Handschuh, who presented “Test Vector Leakage Assessment Methodology: An
Update,” and the second invited talk was given by Chris Peikert, who presented
“Lattice Cryptography: From Theory to Practice, and Back Again.”
This year, SAC hosted what is now the third iteration of the SAC Summer School
(S3). S3 is intended to be a place where young researchers can increase their knowl-
edgeofcryptographythroughinstructionby,andinteractionwith,leadingresearchers.
This year, we were fortunate to have Michele Mosca, Douglas Stebila, and David Jao
presenting post-quantum cryptographic algorithms, Tanja Lange and Daniel J. Bern-
stein presenting public key cryptographic algorithms, and Orr Dunkelman presenting
symmetric key cryptographic algorithms. We would like to express our sincere grati-
tude to these six presenters for dedicating their time and effort to what has become a
highly anticipated and highly beneficial event for all participants.
Finally, the members of the Program Committee, especially the co-chairs, would
liketothanktheadditionalreviewers,whogavegenerouslyoftheirtimetoassistwith
the paper review process. We are also very grateful to our sponsors, Microsoft and
Communications Security Establishment, whose enthusiastic support (both financial
and otherwise) greatly contributed to the success of SAC this year.
October 2017 Jan Camenisch
Carlisle Adams
SAC 2017
The 24th Annual Conference on Selected Areas in Cryptography
Ottawa, Ontario, Canada, August 16–18, 2017
Program Chairs
Carlisle Adams University of Ottawa, Canada
Jan Camenisch IBM Research - Zurich, Switzerland
Program Committee
Carlisle Adams (Co-chair) University of Ottawa, Canada
Shashank Agraval Visa Research, USA
Elena Andreeva COSIC, KU Leuven, Belgium
Kazumaro Aoki NTT, Japan
Jean-Philippe Aumasson Kudelski Security, Switzerland
Roberto Avanzi ARM, Germany
Manuel Barbosa HASLab - INESC TEC and FCUP, Portugal
Paulo Barreto University of São Paulo, Brazil
Andrey Bogdanov Technical University of Denmark, Denmark
Billy Brumley Tampere University of Technology, Finland
Jan Camenisch (Co-chair) IBM Research - Zurich, Switzerland
Itai Dinur Ben-Gurion University, Israel
Maria Dubovitskaya IBM Research - Zurich, Switzerland
Guang Gong University of Waterloo, Canada
Johann Groszschaedl University of Luxembourg, Luxembourg
Tim Güneysu University of Bremen and DFKI, Germany
M. Anwar Hasan University of Waterloo, Canada
Howard Heys Memorial University, Canada
Laurent Imbert CNRS, LIRMM, Université Montpellier 2, France
Michael Jacobson University of Calgary, Canada
Elif Bilge Kavun Infineon Technologies AG, Germany
Stephan Krenn Austrian Institute of Technology GmbH, Austria
Juliane Krämer Technische Universität Darmstadt, Germany
Thijs Laarhoven IBM Research - Zurich, Switzerland
Gaëtan Leurent Inria, France
Petr Lisonek Simon Fraser University, Canada
María Naya-Plasencia Inria, France
Francesco Regazzoni ALaRI - USI, Switzerland
Palash Sarkar Indian Statistical Institute, India
Joern-Marc Schmidt Secunet Security Networks AG, Germany
VIII SAC 2017
Kyoji Shibutani Sony Corporation, Japan
Francesco Sica Nazarbayev University, Kazakhstan
Daniel Slamanig Graz University of Technology, Austria
Meltem Sonmez Turan National Institute of Standards and Technology, USA
Michael Tunstall Cryptography Research, USA
Vanessa Vitse Université Joseph Fourier - Grenoble I, France
Bo-Yin Yang Academia Sinica, Taiwan
Amr Youssef Concordia University, Canada
Additional Reviewers
Ahmed Abdel Khalek Oliver Mischke
Cecilia Boschini Nicky Mouha
Cagdas Calik Christophe Negre
André Chailloux Tobias Oder
Jie Chen Towa Patrick
Yao Chen Cesar Pereida Garcia
Deirdre Connolly Peter Pessl
Rafaël Del Pino Thomas Pöppelmann
Christoph Dobraunig Sebastian Ramacher
Benedikt Driessen Tobias Schneider
Léo Ducas André Schrottenloher
Maria Eichlseder Gregor Seiler
Guillaume Endignoux Sohaib Ul Hassan
Tommaso Gagliardoni Christoph Striecks
Romain Gay Cihangir Tezcan
Florian Goepfert David Thomson
Michael Hamburg Jean-Pierre Tillich
Harunaga Hiwatari Yosuke Todo
Akinori Hosoyamada Mohamed Tolba
Andreas Hülsing Nicola Tuveri
Takanori Isobe Christine van Vredendaal
Thorsten Kleinjung David J. Wu
Moon Sung Lee Jiming Xu
Aaron Lye Randy Yee
Kalikinkar Mandal Wenying Zhang
Contents
Discrete Logarithms
Second Order Statistical Behavior of LLL and BKZ . . . . . . . . . . . . . . . . . . 3
Yang Yu and Léo Ducas
Refinement of the Four-Dimensional GLV Method on Elliptic Curves. . . . . . 23
Hairong Yi, Yuqing Zhu, and Dongdai Lin
Key Agreement
Post-Quantum Static-Static Key Agreement Using Multiple
Protocol Instances. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45
Reza Azarderakhsh, David Jao, and Christopher Leonardi
Side-Channel Attacks on Quantum-Resistant Supersingular
Isogeny Diffie-Hellman . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 64
Brian Koziel, Reza Azarderakhsh, and David Jao
Theory
Computing Discrete Logarithms in F . . . . . . . . . . . . . . . . . . . . . . . . . . . 85
p6
Laurent Grémy, Aurore Guillevic,
François Morain, and Emmanuel Thomé
Computing Low-Weight Discrete Logarithms. . . . . . . . . . . . . . . . . . . . . . . 106
Bailey Kacsmar, Sarah Plosker, and Ryan Henry
Efficient Implementation
sLiSCP: Simeck-Based Permutations for Lightweight Sponge
Cryptographic Primitives . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 129
Riham AlTawy, Raghvendra Rohit, Morgan He,
Kalikinkar Mandal, Gangqiang Yang, and Guang Gong
Efficient Reductions in Cyclotomic Rings - Application
to Ring-LWE Based FHE Schemes. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 151
Jean-Claude Bajard, Julien Eynard, Anwar Hasan,
Paulo Martins, Leonel Sousa, and Vincent Zucca
X Contents
How to (Pre-)Compute a Ladder: Improving the Performance
of X25519 and X448. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 172
Thomaz Oliveira, Julio López, Hüseyin Hışıl,Armando Faz-Hernández,
and Francisco Rodríguez-Henríquez
HILA5: On Reliability, Reconciliation, and Error Correction
for Ring-LWE Encryption . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 192
Markku-Juhani O. Saarinen
Public Key Encryption
A Public-Key Encryption Scheme Based on Non-linear
Indeterminate Equations. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 215
Koichiro Akiyama, Yasuhiro Goto, Shinya Okumura,
Tsuyoshi Takagi, Koji Nuida, and Goichiro Hanaoka
NTRU Prime: Reducing Attack Surface at Low Cost. . . . . . . . . . . . . . . . . . 235
Daniel J. Bernstein, Chitchanok Chuengsatiansup,
Tanja Lange, and Christine van Vredendaal
Signatures
Leighton-Micali Hash-Based Signatures in the Quantum
Random-Oracle Model. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 263
Edward Eaton
Efficient Post-Quantum Undeniable Signature on 64-Bit ARM . . . . . . . . . . . 281
Amir Jalali, Reza Azarderakhsh, and Mehran Mozaffari-Kermani
“Oops, I Did It Again” – Security of One-Time Signatures
Under Two-Message Attacks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 299
Leon Groot Bruinderink and Andreas Hülsing
Cryptanalysis
Low-Communication Parallel Quantum Multi-Target Preimage Search. . . . . . 325
Gustavo Banegas and Daniel J. Bernstein
Lattice Klepto: Turning Post-Quantum Crypto Against Itself . . . . . . . . . . . . 336
Robin Kwant, Tanja Lange, and Kimberley Thissen
Total Break of the SRP Encryption Scheme. . . . . . . . . . . . . . . . . . . . . . . . 355
Ray Perlner, Albrecht Petzoldt, and Daniel Smith-Tone
Approximate Short Vectors in Ideal Lattices of Qðf Þ
pe
with Precomputation of ClðO Þ. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 374
K
Jean-François Biasse