Asiacrypt 2019 Program

Sunday, December 08, 2019 17:00–20:00 Registration

18:00–20:00 Welcome Reception Location: OWADA Monday, December 09, 2019 8:00– Registration

9:00–9:10 Opening Remarks Location: KAIRAKU 1&2 Invited Lecture 1 Location: KAIRAKU 1&2 Chair: TBD 9:10–10:00 New proof systems for sustainable blockchains: proofs of space and verifiable delay functions Krzysztof Pietrzak IST Austria Best Paper Location: KAIRAKU 1&2 Chair: TBD 10:00–10:25 Wave: A New Family of Trapdoor One-Way Preimage Sampleable Functions Based on Codes Thomas Debris-Alazard; Nicolas Sendrier; Jean-Pierre Tillich Inria de Paris; Inria de Paris; Inria de Paris 10:25–10:50 Coffee Break Lattices (1) Symmetric Cryptography (1) Location: KAIRAKU 1&2 Location: KAIRAKU 3 Chair: TBD Chair: TBD Middle-Product Learning with Rounding 4-Round Luby-Rackoff Construction is a qPRP Problem and its Applications Akinori Hosoyamada; Tetsu Iwata Shi Bai; Katharina Boudgoust; Dipayan Das; Adeline NTT Secure Platform Laboratories and Nagoya University; Roux-Langlois; Weiqiang Wen; Zhenfei Zhang Nagoya University Department of Mathematical Sciences, Florida Indifferentiability of Truncated Random Atlantic University; Univ Rennes, CNRS, IRISA; Permutations Department of Mathematics, National Institute of Wonseok Choi; Byeonghak Lee; Jooyoung Lee Technology, Durgapur; Univ Rennes, CNRS, IRISA; KAIST, Korea; KAIST, Korea; KAIST, Korea 10:50–12:05 Univ Rennes, CNRS, IRISA; Algorand Anomalies and Vector Space Search: Tools for A Novel CCA Attack using Decryption S-Box Analysis Errors against LAC Xavier Bonnetain; Léo Perrin; Shizhu Tian Qian Guo; Thomas Johansson; Jing Yang Inria, Sorbonne University; Inria; Inria, State Key University of Bergen, Norway, and Lund University, Laboratory of Information Security, Institute of Information Sweden; Lund University, Sweden; Lund University, Engineering, Chinese Academy of Sciences, School of Sweden Cyber Security, University of Chinese Academy of Sciences Towards Attribute-Based Encryption for RAMs from LWE: Sub-linear Decryption, and More Prabhanjan Ananth; Xiong Fan; Elaine Shi MIT; Cornell University; Cornell University 12:05–13:45 Lunch (Buffet)

1 Monday, December 09, 2019 Isogenies (1) Obfuscation Location: KAIRAKU 1 Location: KAIRAKU 2 Chair: TBD Chair: TBD CSI-FiSh: Efficient Isogeny based Dual-Mode NIZKs from Obfuscation Signatures through Class Group Dennis Hofheinz, Bogdan Ursu Computations Karlsruhe Institute of Technology (KIT); Karlsruhe Institute Ward Beullens; Thorsten Kleinjung; Fréderik of Technology (KIT) Vercauteren Output Compression, MPC, and iO for Turing ESAT-COSIC, KU Leuven; EPFL IC LACAL; ESAT- Machines COSIC, KU Leuven Saikrishna Badrinarayanan; Rex Fernando; Venkata Verifiable Delay Functions from Koppula; Amit Sahai; Brent Waters Supersingular Isogenies and Pairings UCLA; UCLA; Weizmann Institute of Science; UCLA; UT Luca De Feo; Simon Masson; Christophe Petit; Austin 13:45–15:00 Antonio Sanso Collusion Resistant Watermarking Schemes for Université Paris-Saclay – UVSQ, LMV, UMR CNRS Cryptographic Functionalities 8100, Versailles; Thales and Université de Lorraine; Rupeng Yang; Man Ho Au; Junzuo Lai; Qiuliang Xu; Zuoxia University of Birmingham; Adobe Inc. and Ruhr Yu Universität Bochum School of Computer Science and Technology, Shandong Strongly Secure Authenticated Key University & Department of Computing, The Hong Kong Exchange from Supersingular Isogenies Polytechnic University; Department of Computing, The Xiu Xu; Haiyang Xue; Kunpeng Wang; Man Ho Au; Hong Kong Polytechnic University; College of Information Song Tian Science and Technology, Jinan University; School of IIE, Chinese Academy of Sciences; IIE, Chinese Software, Shandong University; Department of Computing, Academy of Sciences, The Hong Kong Polytechnic The Hong Kong Polytechnic University University; IIE, Chinese Academy of Sciences; The Hong Kong Polytechnic University; IIE, Chinese Academy of Sciences 15:00–15:25 Coffee Break Multiparty Computation (1) Quantum Location: KAIRAKU 1 Location: KAIRAKU 2 Chair: TBD Chair: TBD Valiant’s Universal Circuits Revisited: an Quantum Algorithms for the Approximate k-List Overall Improvement and a Lower Bound Problem and their Application to Lattice Sieving Shuoyao Zhao; Yu Yu; Jiang Zhang; Hanlin Liu Elena Kirshanova; Erik Mårtensson; Eamonn W. Shanghai Jiao Tong University and PlatON Network; Postlethwaite; Subhayan Roy Moulik Shanghai Jiao Tong University; State Key I. Kant Baltic Federal University; Lund University; Royal Laboratory of Cryptology; Shanghai Jiao Tong Holloway, University of London; University of Oxford University Quantum Attacks without Superposition The Broadcast Message Complexity of Queries: the Offline Simon's Algorithm Secure Multiparty Computation Xavier Bonnetain; Akinori Hosoyamada; María Naya- Sanjam Garg; Aarushi Goel; Abhishek Jain Plasencia; Yu Sasaki; André Schrottenloher University of California, Berkeley; Johns Hopkins Sorbonne Université, Inria, France; NTT Secure Platform 15:25–17:05 University; Johns Hopkins University Laboratories, Nagoya University, Japan; Inria, France; NTT Beyond Honest Majority: The Round Secure Platform Laboratories, Japan; Inria, France Complexity of Fair and Robust Multi-party Quantum Random Oracle Model with Auxiliary Computation Input Arpita Patra; Divya Ravi Minki Hhan; Keita Xagawa; Takashi Yamakawa Indian Institute of Science; Indian Institute of Seoul National University, Republic of Korea; NTT Secure Science Platform Laboratories, Japan; NTT Secure Platform Card-based Cryptography Meets Formal Laboratories, Japan Verification QFactory: classically-instructed remote secret Alexander Koch; Michael Schrempp; Michael qubits preparation Kirsten Alexandru Cojocaru; Léo Colisson; Elham Kashefi; Petros Karlsruhe Institute of Technology (KIT); Karlsruhe Wallden Institute of Technology (KIT); Karlsruhe Institute of University of Edinburgh; Sorbonne Université; University Technology (KIT) of Edinburgh, Sorbonne Université; University of Edinburgh 17:05–17:10 Track-switch Time

2 Monday, December 09, 2019 E-cash and blockchain Codes Location: KAIRAKU 1 Location: KAIRAKU 2 Chair: TBD Chair: TBD Quisquis: A New Design for Anonymous Collision Resistant Hashing from Sub- Cryptocurrencies exponential Learning Parity with Noise Prastudy Fauzi; Sarah Meiklejohn; Rebekah Mercer; Yu Yu; Jiang Zhang; Jian Weng; Chun Guo; Xiangxue Li Claudio Orlandi Shanghai Jiao Tong University; State Key Laboratory of 17:10–18:00 Simula UiB, Norway; University College London, Cryptology; Jinan University; Shandong University; East UK; O(1) Labs, USA; Aarhus University, Denmark China Normal University Divisible E-Cash from Constrained New Code-Based Privacy-Preserving Pseudo-Random Functions Cryptographic Constructions Florian Bourse; David Pointcheval; Olivier Sanders Khoa Nguyen; Hanh Tang; Huaxiong Wang; Neng Zeng Orange Labs; ENS, CNRS, PSL University and Nanyang Technological University; Nanyang Technological INRIA; Orange Labs University; Nanyang Technological University; Nanyang Technological University Tuesday, December 10, 2019 8:00– Registration Lattices (2) Authenticated Encryption Location: KAIRAKU 1 Location: KAIRAKU 2 Chair: TBD Chair: TBD An LLL Algorithm for Module Lattices Forkcipher: a New Primitive for Changmin Lee; Alice Pellet-Mary; Damien Stehlé; Alexandre Authenticated Encryption of Very Short Wallet Messages Univ. Lyon, EnsL, UCBL, CNRS, Inria, LIP; Univ. Lyon, Elena Andreeva; Virginie Lallemand; Antoon EnsL, UCBL, CNRS, Inria, LIP; Univ. Lyon, EnsL, UCBL, Purnal; Reza Reyhanitabar; Arnab Roy; Damian CNRS, Inria, LIP; NTT Secure Platform Laboratories, Tokyo, Vizár Japan COSIC, KU Leuven, Belgium; University of Lorraine, CNRS, Inria, LORIA, France; COSIC, KU 9:00–10:15 Order-LWE and the Hardness of Ring-LWE with Entropic Secrets Leuven, Belgium; TE Connectivity, Germany; Madalina Bolboceanu; Zvika Brakerski; Renen Perlman; University of Bristol, UK; CSEM, Switzerland Devika Sharma Anonymous AE Bitdefender; Weizmann Institute of Science; Weizmann John Chan; Phillip Rogaway Institute of Science; Weizmann Institute of Science University of California, Davis; University of On the Non-Existence of Short Vectors in California, Davis Random Module Lattices Sponges Resist Leakage: The Case of Ngoc Khanh Nguyen Authenticated Encryption IBM Research Zurich and Ruhr Universitat Bochum Jean Paul Degabriele; Christian Janson; Patrick Struck TU Darmstadt; TU Darmstadt; TU Darmstadt 10:15–10:45 Coffee Break Isogenies (2) Multilinear Maps Location: KAIRAKU 1 Location: KAIRAKU 2 Chair: TBD Chair: TBD Dual Isogenies and Their Application to Public- On Kilian's Randomization of Multilinear key Compression for Isogeny-based Map Encodings Cryptography Jean-Sébastien Coron; Hilder Vitor Lima Pereira Michael Naehrig; Joost Renes University of Luxembourg; University of Microsoft Research; Radboud University Luxembourg Optimized Method for Computing Odd-Degree Cryptanalysis of CLT13 Multilinear Maps 10:45–12:00 Isogenies on Edwards Curves with Independent Slots Suhri Kim; Kisoon Yoon; Young-Ho Park; Seokhie Hong Jean-Sébastien Coron; Luca Notarnicola Center for Information Security Technologies (CIST), Korea University of Luxembourg; University of University, Seoul, Republic of Korea; NSHC Inc., Uiwang, Luxembourg Republic of Korea; Sejong Cyber University, Seoul, Republic XOR-RKA Secure Pseudorandom of Korea; Center for Information Security Technologies Function from Post-Zeroizing Multilinear (CIST), Korea University, Seoul, Republic of Korea Maps Hard Isogeny Problems over RSA Moduli and Michel Abdalla; Fabrice Benhamouda; Alain Groups with Infeasible Inversion Passelègue Salim Ali Altuğ; Yilei Chen CNRS, ENS, PSL, Inria; Algorand Foundation; Boston University; Visa Research Inria, ENS Lyon 12:00–13:40 Lunch (Bento)

3 Tuesday, December 10, 2019 13:40–18:30 Free afternoon

18:30–21:30 Rump Session with Buffet Location: KAIRAKU 1&2 Wednesday, December 11, 2019 8:00– Registration Homomorphic Encryption Combinatorial Cryptography Location: KAIRAKU 1 Location: KAIRAKU 2 Chair: TBD Chair: TBD Numerical Method for Comparison on Efficient Explicit Constructions of Homomorphically Encrypted Numbers Multipartite Secret Sharing Schemes Jung Hee Cheon; Dongwoo Kim; Duhyeong Kim; Hun Qi Chen; Chunming Tang; Zhiqiang Lin Hee Lee; Keewoo Lee Advanced Institute of Engineering Science for Intelligent Seoul National University; Seoul National University; Manufacturing, Guangzhou University, China; College of Seoul National University; Seoul National University; Mathematics and Information Science, Guangzhou Seoul National University University, China; College of Mathematics and 9:00–10:15 Multi-Key Homomophic Encryption from Information Science, Guangzhou University, China TFHE Perfectly Secure Oblivious RAM with Hao Chen; Ilaria Chillotti; Yongsoo Song Sublinear Bandwidth Overhead Microsoft Research, Redmond; KU Leuven; Microsoft Michael Raskin; Mark Simkin Research, Redmond Technical University of Munich; Aarhus University Homomorphic Encryption for Finite How to Correct Errors in Multi-Server PIR Automata Kaoru Kurosawa Nicholas Genise; Craig Gentry; Shai Halevi; Baiyu Li; Ibaraki University Daniele Micciancio Rutgers University; Algorand Foundation; Algorand Foundation; UCSD; UCSD 10:15–10:40 Coffee Break Multiparty Computation (2) Signatures Location: KAIRAKU 1 Location: KAIRAKU 2 Chair: TBD Chair: TBD UC-Secure Multiparty Computation from Approximate Trapdoors for Lattices and One-Way Functions using Stateless Tokens Smaller Hash-and-Sign Signatures Saikrishna Badrinarayanan; Abhishek Jain; Rafail Yilei Chen; Nicholas Genise; Pratyay Mukherjee Ostrovsky; Ivan Visconti Visa Research; Rutgers University; Visa Research UCLA; JHU; UCLA; University of Salerno Decisional second-preimage resistance: When Efficient UC Commitment Extension with does SPR imply PRE? Homomorphism for Free (and Applications) Daniel J. Bernstein; Andreas Hülsing Ignacio Cascudo; Ivan Damgård; Bernardo David; Nico University of Illinois at Chicago, Ruhr University 10:40–11:55 Döttling; Rafael Dowsley; Irene Giacomelli Bochum; Technische Universiteit Eindhoven IMDEA Software Institute; Aarhus University; IT Structure-Preserving Signatures on University of Copenhagen; Cispa Helmholtz Center for Equivalence Classes From Standard Information Security; Bar-Ilan University; Protocol Assumptions Labs, Inc. Mojtaba Khalili; Daniel Slamanig; Mohammad Scalable Private Set Union from Symmetric- Dakhilalian Key Techniques Isfahan University of Technology; AIT Austrian Institute Vladimir Kolesnikov; Mike Rosulek; Ni Trieu; Xiao of Technology; Isfahan University of Technology Wang Georgia Institute of Technology; Oregon State University; Oregon State University; Northwestern University 11:55–13:35 Lunch (Buffet)

4 Wednesday, December 11, 2019 Public Key Encryption (1) Side Channels Location: KAIRAKU 1&2 Location: KAIRAKU 3 Chair: TBD Chair: TBD Simple and Efficient KDM-CCA Secure Leakage Resilience of the Duplex Public Key Encryption Construction Fuyuki Kitagawa; Takahiro Matsuda; Keisuke Tanaka Christoph Dobraunig; Bart Mennink NTT Secure Platform Laboratories; National Institute Radboud University, The Netherlands; Radboud of Advanced Industrial Science and Technology (AIST); University, The Netherlands Tokyo Institute of Technology A Critical Analysis of ISO 17825 (`Testing Non-Committing Encryption with Quasi- methods for the mitigation of non-invasive Optimal Ciphertext-Rate Based on the DDH attack classes against cryptographic Problem modules') Yusuke Yoshida; Fuyuki Kitagawa; Keisuke Tanaka Carolyn Whitnall; Elisabeth Oswald Tokyo Institute of Technology; NTT Secure Platform University of Bristol; University of Bristol, University of Laboratories; Tokyo Institute of Technology Klagenfurt Structure-Preserving and Re-randomizable Location, location, location: Revisiting 13:35–15:15 RCCA-secure Public Key Encryption and its modeling and exploitation for location-based Applications side channel leakages Antonio Faonio; Dario Fiore; Javier Herranz; Carla Christos Andrikos; Lejla Batina; Lukasz Chmielewski; Ràfols Liran Lerman; Vasilios Mavroudis; Kostas IMDEA Software Institute; IMDEA Software Institute; Papagiannopoulos; Guilherme Perin; Giorgos Rassias; Cybercat and Universitat Politècnica de Catalunya; Alberto Sonnino Cybercat and Universitat Pompeu Fabra National Technical University Athens; Radboud iUC: Flexible Universal Composability Made University; Radboud University, Riscure; Thales Simple Belgium; University College London; Radboud Jan Camenisch; Stephan Krenn; Ralf Küsters; Daniel University, NXP Semiconductors Hamburg; Riscure; Rausch National Technical University Athens; University College Dfinity; AIT; University of Stuttgart; University of London Stuttgart Simple Refreshing in the Noisy Leakage Model Stefan Dziembowski; Sebastian Faust; Karol Zebrowski University of Warsaw; TU Darmstadt; University of Warsaw 15:15–15:40 Coffee Break Invited Lecture 2 Location: KAIRAKU 1&2 Chair: TBD 15:40–16:30 Streamlined blockchains: A simple and elegant approach (tutorial) Elaine Shi Cornell University, USA

16:30–17:30 IACR Business Meeting Location: KAIRAKU 1&2

19:00–22:00 Banquet Location: OWADA

5 Thursday, December 12, 2019 Symmetric Cryptography (2) Functional Encryption Location: KAIRAKU 1 Location: KAIRAKU 2 Chair: TBD Chair: TBD The Exchange Attack: How to Distinguish 6 Tightly Secure Inner Product Functional Rounds of AES with 2^{88.2} chosen plaintexts Encryption: Multi-Input and Function- Navid G. Bardeh; Sondre Rønjom Hiding Constructions University of Bergen; University of Bergen Junichi Tomida Algebraic Cryptanalysis of STARK-Friendly NTT Designs: Application to MARVELlous and MiMC Public-Key Function-Private Hidden Martin Albrecht; Carlos Cid; Lorenzo Grassi; Dmitry Vector Encryption (and More) Khovratovich; Reinhard Lüftenegger; Christian Rechberger; James Bartusek; Brent Carmer; Abhishek Jain; Markus Schofnegger Zhengzhong Jin; Tancrède Lepoint; Fermi Ma; Tal Information Security Group, Royal Holloway, University of Malkin; Alex Malozemoff; Mariana Raykova London; Information Security Group, Royal Holloway, UC Berkeley; Galois; Johns Hopkins University; University of London and Simula UiB; IAIK, Graz University Johns Hopkins University; Google; Princeton 9:00–10:40 of Technology and Know-Center; Evernym Inc. and ABDK University; Columbia University; Galois; Google Consulting and Dusk Network; IAIK, Graz University of Multi-Client Functional Encryption for Technology; IAIK, Graz University of Technology; IAIK, Linear Functions in the Standard Model Graz University of Technology from LWE MILP-aided Method of Searching Division Benoît Libert; Radu Titiu Property Using Three Subsets and Applications CNRS and ENS de Lyon (France); Bitdefender Senpeng Wang; Bin Hu; Jie Guan; Kai Zhang; Tairong Shi (Romania) and ENS de Lyon (France) PLA SSF Information Engineering University, Zhengzhou, From Single-Input to Multi-Client Inner- China; PLA SSF Information Engineering University, Zhengzhou, China; PLA SSF Information Engineering Product Functional Encryption University, Zhengzhou, China; PLA SSF Information Michel Abdalla; Fabrice Benhamouda; Romain Gay Engineering University, Zhengzhou, China; PLA SSF CNRS, ENS; Algorand Foundation; UC Berkeley Information Engineering University, Zhengzhou, China Cryptanalysis of GSM Encryption in 2G/3G Networks without Rainbow Tables Bin Zhang Chinese Academy of Sciences 10:40–11:05 Coffee Break Public Key Encryption (2) Zero Knowledge Location: KAIRAKU 1 Location: KAIRAKU 2 Chair: TBD Chair: TBD Rate-1 Trapdoor Functions from the Diffie- Shorter QA-NIZK and SPS with Tighter Hellman Problem Security Nico Döttling; Sanjam Garg; Mohammad Hajiabadi; Kevin Masayuki Abe; Charanjit S. Jutla; Miyako Ohkubo; Liu; Giulio Malavolta Jiaxin Pan; Arnab Roy; Yuyu Wang CISPA; University of California Berkeley; University of NTT Corporation; IBM T. J. Watson Research California Berkeley; University of California Berkeley; Center; Security Fundamentals Laboratories, CSR, Simons Institute NICT; Department of Mathematical Sciences, The Local Forking Lemma and its Application to NTNU – Norwegian University of Science and Deterministic Encryption Technology; Fujitsu Laboratories of America; University of Electronic Science and Technology of Mihir Bellare; Wei Dai; Lucy Li 11:05–12:20 China UCSD; UCSD; Cornell University Fine-Grained Cryptography Revisited Efficient Noninteractive Certification of Egashira Shohei; Yuyu Wang; Keisuke Tanaka RSA Moduli and Beyond Tokyo Institute of Technology; University of Electronic Sharon Goldberg; Leonid Reyzin; Omar Sagga; Science and Technology of China; Tokyo Institute of Foteini Baldimtsi Technology Boston University; Boston University; Boston University; George Mason University Shorter Pairing-based Arguments under Standard Assumptions Alonso González; Carla Ràfols ENS de Lyon, Laboratoire LIP (U. Lyon, CNRS, ENSL, INRIA, UCBL), France; Universitat Pompeu Fabra and Cybercat, Barcelona, Spain

6