ASIACRYPT 2017: 
Tsuyoshi Takagi and Thomas Peyrin (Eds.):
Advances in Cryptology - ASIACRYPT 2017
23rd International Conference on the Theory and Applications of Cryptology and Information Security
Hong Kong, China,
December 3-7, 2017
Proceedings, Parts I, II, III
ASIACRYPT 2017
Organizational Committee
Program Committee
Organizational Committee
Program Chairs:
Tsuyoshi Takagi
Thomas Peyrin
General Chairs:
Siu Ming Yiu
Duncan S. Wong
Tsuyoshi Takagi
Thomas Peyrin
General Chairs:
Siu Ming Yiu
Duncan S. Wong
Program Committee
| Shweta Agrawal |
| Céline Blondeau |
| Joppe W. Bos |
| Chris Brzuska |
| Jie Chen |
| Sherman S. M. Chow |
| Kai-Min Chung |
| Nico Döttling |
| Thomas Eisenbarth |
| Dario Fiore |
| Georg Fuchsbauer |
| Steven Galbraith |
| Jian Guo |
| Viet Tung Hoang |
| Jérémy Jean |
| Jooyoung Lee |
| Dongdai Lin |
| Feng-Hao Liu |
| Stefan Mangard |
| Takahiro Matsuda |
| Alexander May |
| Bart Mennink |
| Amir Moradi |
| Pratyay Mukherjee |
| Mridul Nandi |
| Khoa Nguyen |
| Miyako Ohkubo |
| Tatsuaki Okamoto |
| Arpita Patra |
| Bart Preneel |
| Matthieu Rivain |
| Rei Safavi-Naini |
| Yu Sasaki |
| Peter Schwabe |
| Fang Song |
| François-Xavier Standaert |
| Damien Stehlé |
| Ron Steinfeld |
| Rainer Steinwandt |
| Mehdi Tibouchi |
| Dominique Unruh |
| Gilles Van Assche |
| Serge Vaudenay |
| Ingrid Verbauwhede |
| Ivan Visconti |
| Meiqin Wang |
| Lei Wang |
| Jiang Zhang |
- Invited Talk:
- Best Paper
- Post-Quantum Cryptography
- Symmetric Key Cryptanalysis I
- Lattices
- Large Modulus Ring-LWE ≥ Module-LWE, 267-296, Martin R. Albrecht, Amit Deo
bib info - Revisiting the Expected Cost of Solving uSVP and Applications to LWE, 297-322, Martin R. Albrecht, Florian Göpfert, Thomas Wunderer, Fernando Virdia
bib info - Coded-BKW with Sieving, 323-346, Thomas Johansson, Paul Stankovski, Qian Guo, Erik Mårtensson
bib info - Sharper Bounds in Lattice-Based Cryptography Using the Rényi Divergence, 347-374, Thomas Prest
bib info
- Large Modulus Ring-LWE ≥ Module-LWE, 267-296, Martin R. Albrecht, Amit Deo
- Symmetric Key Cryptanalysis II
- Collisions and Semi-Free-Start Collisions for Round-Reduced RIPEMD-160, 158-186, Florian Mendel, Fukang Liu, Gaoli Wang
bib info - Linear Cryptanalysis of DES with Asymmetries, 187-216, Andrey Bogdanov, Philip S. Vejre
bib info - Yoyo Tricks with AES, 217-243, Tor Helleseth, Sondre Rønjom, Navid Ghaedi Bardeh
bib info - New Key Recovery Attacks on Minimal Two-Round Even-Mansour Ciphers, 244-263, Kyoji Shibutani, Takanori Isobe
bib info
- Collisions and Semi-Free-Start Collisions for Round-Reduced RIPEMD-160, 158-186, Florian Mendel, Fukang Liu, Gaoli Wang
- Homomorphic Encryptions
- Faster Packed Homomorphic Operations and Efficient Circuit Bootstrapping for TFHE, 377-408, Nicolas Gama, Malika Izabachène, Mariya Georgieva, Ilaria Chillotti
bib info - Homomorphic Encryption for Arithmetic of Approximate Numbers, 409-437, Jung Hee Cheon, Miran Kim, Andrey Kim, Yongsoo Song
bib info - Quantum Fully Homomorphic Encryption with Verification, 438-467, Christian Schaffner, Yfke Dulek, Florian Speelman, Gorjan Alagic
bib info
- Faster Packed Homomorphic Operations and Efficient Circuit Bootstrapping for TFHE, 377-408, Nicolas Gama, Malika Izabachène, Mariya Georgieva, Ilaria Chillotti
- Access Control
- Access Control Encryption for General Policies from Standard Assumptions, 471-501, David J. Wu, Sam Kim
bib info - Strengthening Access Control Encryption, 502-532, Christian Badertscher, Christian Matt, Ueli Maurer
bib info - Adaptive Oblivious Transfer with Access Control from Lattice Assumptions, 533-563, Benoît Libert, Huaxiong Wang, San Ling, Khoa Nguyen, Fabrice Mouhartem
bib info
- Access Control Encryption for General Policies from Standard Assumptions, 471-501, David J. Wu, Sam Kim
- Oblivious Protocols
- On the Depth of Oblivious Parallel RAM, 567-597, Elaine Shi, Kai-Min Chung, T.-H. Hubert Chan
bib info - Low Cost Constant Round MPC Combining BMR and Oblivious Transfer, 598-628, Carmit Hazay, Peter Scholl, Eduardo Soria-Vazquez
bib info - Maliciously Secure Oblivious Linear Function Evaluation with Constant Overhead, 629-659, Jesper Buus Nielsen, Tobias Nilges, Satrajit Ghosh
bib info - Oblivious Hashing Revisited, and Applications to Asymptotically Efficient ORAM and OPRAM, 660-690, Elaine Shi, T.-H. Hubert Chan, Wei-Kai Lin, Yue Guo
bib info
- On the Depth of Oblivious Parallel RAM, 567-597, Elaine Shi, Kai-Min Chung, T.-H. Hubert Chan
- Side Channel Analysis
- Authenticated Encryption in the Face of Protocol and Side Channel Leakage, 693-723, Martijn Stam, Elisabeth Oswald, Guy Barwell, Daniel P. Martin
bib info - Consolidating Inner Product Masking, 724-754, Benedikt Gierlichs, Sebastian Faust, Josep Balasch, Clara Paglialonga, François-Xavier Standaert
bib info - The First Thorough Side-Channel Hardware Trojan, 755-780, Christof Paar, Amir Moradi, Samaneh Ghandali, Maik Ender
bib info - Amortizing Randomness Complexity in Private Circuits, 781-810, Sebastian Faust, Tobias Schneider, Clara Paglialonga
bib info
- Authenticated Encryption in the Face of Protocol and Side Channel Leakage, 693-723, Martijn Stam, Elisabeth Oswald, Guy Barwell, Daniel P. Martin
- Invited Talk 2
- Journal of Cryptology Invited Talk I
- Pairing-based Protocols
- ABE with Tag Made Easy - Concise Framework and New Instantiations in Prime-Order Groups, 35-65, Jie Chen, Junqing Gong
bib info - Towards a Classification of Non-interactive Computational Assumptions in Cyclic Groups, 66-96, Jens Groth, Essam Ghadafi
bib info - An Efficient Pairing-Based Shuffle Argument, 97-127, Helger Lipmaa, Prastudy Fauzi, Michal Zajac, Janno Siim
bib info - Efficient Ring Signatures in the Standard Model, 128-157, Giulio Malavolta, Dominique Schröder
bib info
- ABE with Tag Made Easy - Concise Framework and New Instantiations in Prime-Order Groups, 35-65, Jie Chen, Junqing Gong
- Quantum Algorithms
- Grover Meets Simon - Quantumly Attacking the FX-construction, 161-178, Alexander May, Gregor Leander
bib info - Quantum Multicollision-Finding Algorithm, 179-210, Yu Sasaki, Keita Xagawa, Akinori Hosoyamada
bib info - An Efficient Quantum Collision Search Algorithm and Implications on Symmetric Cryptography, 211-240, María Naya-Plasencia, André Chailloux, André Schrottenloher
bib info - Quantum Resource Estimates for Computing Elliptic Curve Discrete Logarithms, 241-270, Michael Naehrig, Kristin E. Lauter, Martin Roetteler, Krysta M. Svore
bib info
- Grover Meets Simon - Quantumly Attacking the FX-construction, 161-178, Alexander May, Gregor Leander
- Elliptic Curves
- qDSA: Small and Secure Digital Signatures with Curve-Based Diffie-Hellman Key Pairs, 273-302, Benjamin Smith, Joost Renes
bib info - A Simple and Compact Algorithm for SIDH with Arbitrary Degree Isogenies, 303-329, Craig Costello, Hüseyin Hisil
bib info - Faster Algorithms for Isogeny Problems Using Torsion Point Images, 330-353, Christophe Petit
bib info
- qDSA: Small and Secure Digital Signatures with Curve-Based Diffie-Hellman Key Pairs, 273-302, Benjamin Smith, Joost Renes
- Block Chains
- Beyond Hellman's Time-Memory Trade-Offs with Applications to Proofs of Space, 357-379, Leonid Reyzin, Joël Alwen, Krzysztof Pietrzak, Hamza Abusalah, Bram Cohen, Danylo Khilko
bib info - The Sleepy Model of Consensus, 380-409, Rafael Pass, Elaine Shi
bib info - Instantaneous Decentralized Poker, 410-440, Ranjit Kumaresan, Iddo Bentov, Andrew Miller
bib info
- Beyond Hellman's Time-Memory Trade-Offs with Applications to Proofs of Space, 357-379, Leonid Reyzin, Joël Alwen, Krzysztof Pietrzak, Hamza Abusalah, Bram Cohen, Danylo Khilko
- Multi-Party Protocols
- More Efficient Universal Circuit Constructions, 443-470, Thomas Schneider, Ágnes Kiss, Daniel Günther
bib info - Efficient Scalable Constant-Round MPC via Garbled Circuits, 471-498, Yehuda Lindell, Eran Omri, Aner Ben-Efraim
bib info - Overlaying Conditional Circuit Clauses for Secure Computation, 499-528, Vladimir Kolesnikov, W. Sean Kennedy, Gordon T. Wilfong
bib info - JIMU: Faster LEGO-Based Secure Computation Using Additive Homomorphic Hashes, 529-572, Yan Huang, Ruiyu Zhu
bib info
- More Efficient Universal Circuit Constructions, 443-470, Thomas Schneider, Ágnes Kiss, Daniel Günther
- Operating Modes Security Proofs
- Analyzing Multi-key Security Degradation, 575-605, Kenneth G. Paterson, Bart Mennink, Atul Luykx
bib info - Full-State Keyed Duplex with Built-In Multi-user Support, 606-637, Joan Daemen, Gilles Van Assche, Bart Mennink
bib info - Improved Security for OCB3, 638-666, Mridul Nandi, Ritam Bhaumik
The Iterated Random Function Problem, 667-697, Mridul Nandi, Nicky Mouha, Nilanjan Datta, Avijit Dutta, Ritam Bhaumik
bib info
- Analyzing Multi-key Security Degradation, 575-605, Kenneth G. Paterson, Bart Mennink, Atul Luykx
- Invited Talk 3
-
White-box Cryptomania (paper not available), Pascal Paillier
bib info
-
White-box Cryptomania (paper not available), Pascal Paillier
- Journal of Cryptology Invited Talk II
- Cryptographic Protocols
- Two-Round PAKE from Approximate SPH and Instantiations from Lattices, 37-67, Jiang Zhang, Yu Yu
bib info - Tightly-Secure Signatures from Five-Move Identification Protocols, 68-94, Eike Kiltz, Jiaxin Pan, Julian Loss
bib info - On the Untapped Potential of Encoding Predicates by Arithmetic Circuits and Their Applications, 95-125, Shuichi Katsumata
bib info - The Minimum Number of Cards in Practical Card-Based Protocols, 126-155, Takaaki Mizuki, Hideaki Sone, Yu-ichi Hayashi, Alexander Koch, Stefan Walzer, Julia Kastner, Daiki Miyahara
bib info
- Two-Round PAKE from Approximate SPH and Instantiations from Lattices, 37-67, Jiang Zhang, Yu Yu
- Foundations
- Succinct Spooky Free Compilers Are Not Black Box Sound, 159-180, Yael Tauman Kalai, Zvika Brakerski, Renen Perlman
bib info - Non-Interactive Multiparty Computation Without Correlated Randomness, 181-211, Shai Halevi, Amit Sahai, Yuval Ishai, Abhishek Jain, Ilan Komargodski, Eylon Yogev
bib info - Optimal-Rate Non-Committing Encryption, 212-241, Ran Canetti, Mariana Raykova, Oxana Poburinnaya
bib info - Preventing CLT Attacks on Obfuscation with Linear Overhead, 242-271, Amit Sahai, Rex Fernando, Peter M. R. Rasmussen
bib info
- Succinct Spooky Free Compilers Are Not Black Box Sound, 159-180, Yael Tauman Kalai, Zvika Brakerski, Renen Perlman
- Zero-Knowledge Proofs
- Two-Message Witness Indistinguishability and Secure Computation in the Plain Model from New Assumptions, 275-303, Amit Sahai, Yuval Ishai, Sanjam Garg, Akshay Wadia, Saikrishna Badrinarayanan
bib info - Zero-Knowledge Arguments for Lattice-Based PRFs and Applications to E-Cash, 304-335, Beno&ihat;t Libert, Huaxiong Wang, San Ling, Khoa Nguyen
bib info - Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability, 336-365, Jens Groth, Essam Ghadafi, Mohammad Hajiabadi, Sune K. Jakobsen, Jonathan Bootle, Andrea Cerulli
bib info
- Two-Message Witness Indistinguishability and Secure Computation in the Plain Model from New Assumptions, 275-303, Amit Sahai, Yuval Ishai, Sanjam Garg, Akshay Wadia, Saikrishna Badrinarayanan
- Symmetric Key Designs
- How to Use Metaheuristics for Design of Symmetric-Key Primitives, 369-391, Ivica Nikolic
bib info - Cycle Slicer: An Algorithm for Building Permutations on Special Domains, 392-416, Scott Yilek, Sarah Miracle
bib info - Symmetrically and Asymmetrically Hard Cryptography, 417-445, Alex Biryukov, Léo Perrin
bib info - Blockcipher-Based MACs: Beyond the Birthday Bound Without Message Length, 446-470, Yusuke Naito
bib info
- How to Use Metaheuristics for Design of Symmetric-Key Primitives, 369-391, Ivica Nikolic