Crypto 2019

In order of submission:

1. How to Record Quantum Queries, and Applications to Quantum Indifferentiability

   Mark Zhandry (Princeton University & NTT Research)

2. Efficient Collision Attack Frameworks for RIPEMD-160

   Fukang Liu (East China Normal University, Shanghai, China; University of Hyogo, Hyogo 650-0047, Japan), Christoph Dobraunig (Graz University of Technology, Austria; Radboud University, Nijmegen, The Netherlands), Florian Mendel (Infineon Technologies AG, Germany), Takanori Isobe (NICT Japan; University of Hyogo, Hyogo 650-0047, Japan), Gaoli Wang (East China Normal University, Shanghai, China;), Zhenfu Cao (East China Normal University, Shanghai, China; )

3. Statistical Zeroizing Attack: Cryptanalysis of Candidates of BP Obfuscation over GGH15 Multilinear Map

   Jung Hee Cheon (Research Institute of Mathematics, Seoul National University, Seoul, Republic of Korea), Wonhee Cho (Seoul National University, Seoul, Republic of Korea), Minki Hhan (Seoul National University, Seoul, Republic of Korea), Jiseung Kim (Seoul National University, Seoul, Republic of Korea), Changmin Lee (ENS de Lyon, Laboratoire LIP (U. Lyon, CNRS, ENSL, INRIA, UCBL), France )

4. Leakage Certification Revisited: Bounding Model Errors in Side-Channel Security Evaluations

   Olivier Bronchain ( Université catholique de Louvain), Julien M. Hendrickx (Boston University and Université catholique de Louvain), Clément Massart ( Université catholique de Louvain), Alex Olshevsky (Boston University), François-Xavier Standaert ( Université catholique de Louvain)

5. Tight Leakage-Resilient CCA-Security from Quasi-Adaptive Hash Proof System

   Shuai Han (Shanghai Jiao Tong University), Shengli Liu (Shanghai Jiao Tong University), Lin Lyu (Shanghai Jiao Tong University), Dawu Gu (Shanghai Jiao Tong University)

6. Improving Attacks on Round-Reduced Speck32/64 Using Deep Learning

   Aron Gohr (BSI)

7. Adaptively Secure and Succinct Functional Encryption: Improving Security and Efficiency, Simultaneously

   Fuyuki Kitagawa (NTT Secure Platform Laboratories), Ryo Nishimaki (NTT Secure Platform Laboratories), Keisuke Tanaka (Tokyo Institute of Technology), Takashi Yamakawa (NTT Secure Platform Laboratories)

8. Data-Independent Memory Hard Functions: New Attacks and Stronger Constructions

   Jeremiah Blocki (Purdue University), Ben Harsha (Purdue University), Siteng Kang (Penn State), Seunghoon Lee (Purdue University), Lu Xing (Purdue University), Samson Zhou (Indiana University)

9. Quantum cryptanalysis in the RAM model: Claw-finding attacks on SIKE

   Samuel Jaques (University of Waterloo), John M. Schanck (University of Waterloo)

10. On the Shortness of Vectors to be found by the Ideal-SVP Quantum Algorithm

    Léo Ducas (CWI, Amsterdam, The Netherlands) Maxime Plançon (ENS Paris-Saclay) Benjamin Wesolowski (CWI, Amsterdam, The Netherlands)

11. Leakage-Resilient Secret Sharing and Applications

    Akshayaram Srinivasan (UC Berkeley), Prashant Nalini Vasudevan (UC Berkeley)

12. Watermarking Public-Key Cryptographic Primitives

    Rishab Goyal (University of Texas at Austin), Sam Kim (Stanford University), Nathan Manohar (UCLA), Brent Waters (University of Texas at Austin and NTT Research), David J. Wu (University of Virginia)

13. Two-Party ECDSA from Hash Proof Systems and Efficient Instantiations

    Guilhem Castagnos (Université de Bordeaux), Dario Catalano (Università di Catania, Italy), Fabien Laguillaumie (Université Claude Bernard Lyon 1/LIP, France), Federico Savasta (Università di Catania, Italy / Scuola Superiore di Catania, Italy), Ida Tucker (Ens de Lyon/LIP, France)

14. iO Without Multilinear Maps: New Paradigms via Low-Degree Weak Pseudorandom Generators and Security Amplification

    Prabhanjan Ananth (MIT), Aayush Jain (UCLA), Huijia Lin (University of Washington), Christian Matt (Concordium), Amit Sahai (UCLA)

15. Lattice-based Zero-Knowledge Proofs: New Techniques for Shorter and Faster Constructions and Applications

    Muhammed F. Esgin (Monash University), Ron Steinfeld (Monash University), Joseph K. Liu (Monash University), Dongxi Liu (Data61, CSIRO)

16. Adaptively Secure MPC with Sublinear Communication Complexity

    Ran Cohen (Boston University and Northeastern University), abhi shelat (Northeastern University), Daniel Wichs (Northeastern University)

17. Correlation of Quadratic Boolean Functions: Cryptanalysis of All Versions of Full MORUS

    Danping Shi (DCS Center, Chinese Academy of Sciences and IIE, Chinese Academy of Sciences), Siwei Sun (DCS Center, Chinese Academy of Sciences and IIE, Chinese Academy of Sciences), Yu Sasaki (NTT Secure Platform Laboratories, Japan), Chaoyun Li (imec-COSIC, Dept. Electrical Engineering (ESAT), KU Leuven, Belgium), Lei Hu (DCS Center, Chinese Academy of Sciences and IIE, Chinese Academy of Sciences)

18. Watermarking PRFs from Lattices: Stronger Security via Extractable PRFs

    Sam Kim (Stanford University), David J. Wu (University of Virginia)

19. The Communication Complexity of Threshold Private Set Intersection

    Satrajit Ghosh (Aarhus University), Mark Simkin (Aarhus University)

20. Match Me if You Can: Matchmaking Encryption and its Applications

    Giuseppe Ateniese (Stevens Institute of Technology, USA), Danilo Francati (Stevens Institute of Technology, USA), David Nunez (NuCypher), Daniele Venturi (Sapienza University of Rome, Italy)

21. Scalable Zero Knowledge with no Trusted Setup

    Eli Ben-Sasson (Technion), Iddo Bentov (Cornell Tech), Yinon Horesh (Technion), Michael Riabzev (Technion)

22. Seedless Fruit is the Sweetest: Random Number Generation, Revisited

    Sandro Coretti (IOHK), Yevgeniy Dodis (New York University), Harish Karthikeyan (New York Univserity), Stefano Tessaro (University of Washington)

23. Revisiting Post-Quantum Fiat-Shamir

    Qipeng Liu (Princeton University), Mark Zhandry (Princeton University)

24. Broadcast and Trace with N^\epsilon Ciphertext Size from Standard Assumptions

    Rishab Goyal (UT Austin), Willy Quach (Northeastern University), Brent Waters (UT Austin and NTT Research), Daniel Wichs (Northeastern University)

25. Exploring Constructions of Compact NIZKs from Various Assumptions

    Shuichi Katsumata (AIST), Ryo Nishimaki (NTT Secure Platform Laboratories), Shota Yamada (AIST), Takashi Yamakawa (NTT Secure Platform Laboratories)

26. Highly Efficient Key Exchange Protocols with Optimal Tightness

    Katriel Cohn-Gordon (University of Oxford), Cas Cremers (CISPA Helmholtz Center for Information Security), Kristian Gjøsteen (NTNU - Norwegian University of Science and Technology), Håkon Jacobsen (McMaster University, Hamilton), Tibor Jager (Paderborn University)

27. Communication-Efficient Unconditional MPC with Guaranteed Output Delivery

    Vipul Goyal (Carnegie Mellon University), Yanyi Liu (Tsinghua University), Yifan Song (Carnegie Mellon University)

28. Quantum Indistinguishability of Random Sponges

    Jan Czajkowski (QuSoft, University of Amsterdam), Andreas Hülsing (Technische Universiteit Eindhoven), Christian Schaffner (QuSoft, University of Amsterdam)

29. Simultaneous Amplification: The Case of Non-Interactive Zero-Knowledge

    Vipul Goyal (CMU), Aayush Jain (UCLA), Amit Sahai (UCLA)

30. Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation

    Tiancheng Xie (UC Berkeley), Jiaheng Zhang (UC Berkeley), Yupeng Zhang (UC Berkeley and Texas A&M), Charalampos Papamanthou (University of Maryland), Dawn Song (UC Berkeley)

31. Stronger leakage-resilient and non-malleable secret sharing schemes for general access structures

    Divesh Aggarwal (National University of Singapore), Ivan Damgård (Aarhus University), Jesper Buus Nielsen (Aarhus University), Maciej Obremski (National University of Singapore), Erick Purwanto (National University of Singapore), João L. Ribeiro (Imperial College London), Mark Simkin (Aarhus University)

32. Security of the Fiat-Shamir Transformation in the Quantum Random-Oracle Model

    Jelle Don (CWI), Serge Fehr (CWI & Leiden University), Christian Majenz (University of Amsterdam & ILLC), Christian Schaffner (University of Amsterdam & ILLC)

33. Non-Interactive Non-Malleability from Quantum Supremacy

    Yael Tauman Kalai (Microsoft Research New England and MIT), Dakshita Khurana (Microsoft Research New England and UIUC)

34. Communication Lower Bounds for Statistically Secure MPC, with or without Preprocessing

    Ivan Damgård (Aarhus University), Kasper Green Larsen (Aarhus University), Jesper Buus Nielsen (Aarhus University)

35. The Distinction Between Fixed and Random Generators in Group-Based Assumptions

    James Bartusek (Princeton University), Fermi Ma (Princeton University), Mark Zhandry (Princeton University)

36. Non-Malleable Secret Sharing in the Computational Setting: Adaptive Tampering, Noisy-Leakage Resilience, and Improved Rate

    Antonio Faonio (IMDEA Software Institute), Daniele Venturi (Sapienza, University of Rome)

37. Unifying Leakage Models on a Rényi Day

    Thomas Prest (PQShield), Dahmun Goudarzi (PQShield), Ange Martinelli (Thales), Alain Passelègue (INRIA, ENS Lyon)

38. Low Memory Attacks against Two-Round Even-Mansour using the 3-XOR Problem

    Gaëtan Leurent (Inria), Ferdinand Sibleyras (Inria)

39. Cryptographic Sensing

    Yuval Ishai (Technion), Eyal Kushilevitz (Technion), Rafail Ostrovsky (UCLA), Amit Sahai (UCLA)

40. Fully Secure Attribute-Based Encryption for t-CNF from LWE

    Rotem Tsabary (Weizmann Institute of Science)

41. Universally Composable Secure Computation with Corrupted Tokens

    Nishanth Chandran (Microsoft Research, India), Wutichai Chongchitmate (Chulalongkorn University, Thailand), Rafail Ostrovsky (UCLA, USA), Ivan Visconti (University of Salerno, Italy)

42. Non-Malleable Codes for Decision Trees

    Marshall Ball (Columbia University), Siyao Guo (New York University Shanghai), Daniel Wichs (Northeastern University)

43. Non-Uniformly Sound Certificates with Applications to Concurrent Zero-Knowledge

    Cody Freitag (Cornell Tech), Ilan Komargodski (Cornell Tech --> NTT Research), Rafael Pass (Cornell Tech)

44. On the Plausibility of Fully Homomorphic Encryption for RAMs

    Ariel Hamlin (Department of Computer Science, Northeastern University, Boston, Massachusetts, USA.), Justin Holmgren (Department of Computer Science, Princeton University, Princeton, New Jersey, USA.), Mor Weiss (Department of Computer Science, IDC Herzliya, Herzliya, Israel.), Daniel Wichs (Department of Computer Science, Northeastern University, Boston, Massachusetts, USA.)

45. Attribute Based Encryption (and more) for Nondeterministic Finite Automata from LWE

    Shweta Agrawal (IIT Madras), Monosij Maitra (IIT Madras), Shota Yamada (AIST)

46. Noninteractive Zero Knowledge for NP from (Plain) Learning With Errors

    Chris Peikert (University of Michigan), Sina Shiehian (University of Michigan)

47. SpOT-Light: Lightweight Private Set Intersection from Sparse OT Extension

    Benny Pinkas (Bar Ilan University), Mike Rosulek (Oregon State University), Ni Trieu (Oregon State University), Avishay Yanai (Bar Ilan University)

48. Proofs of Replicated Storage Without Timing Assumptions

    Ivan Damgård (Aarhus University), Chaya Ganesh (Aarhus University), Claudio Orlandi (Aarhus University)

49. Memory-Hard Functions from Cryptographic Primitives

    Binyi Chen (UC Santa Barbara), Stefano Tessaro (University of Washington)

50. Unconditionally Secure Computation Against Low-Complexity Leakage

    Andrej Bogdanov (Chinese University of Hong Kong), Yuval Ishai (Technion), Akshayaram Srinivasan (UC Berkeley)

51. ABE for DFA from k-Lin

    Junqing Gong (CNRS, ENS and PSL), Brent Waters (University of Texas at Austin and NTT Research), Hoeteck Wee (CNRS, ENS and PSL)

52. New Results on Modular Inversion Hidden Number Problem and Inversive Congruential Generator

    Jun Xu (State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China), Santanu Sarkar (Indian Institute of Technology Madras, Chennai, India), Lei Hu (State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China), Huaxiong Wang (Division of Mathematical Sciences, School of Physical and Mathematical Sciences, Nanyang Technological University Singapore, Singapore), Yanbin Pan (Key Laboratory of Mathematics Mechanization, NCMIS, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China)

53. Cryptanalysis of OCB2: Attacks on Authenticity and Confidentiality

    Akiko Inoue (NEC Corporation, Japan), Tetsu Iwata (Nagoya University, Japan), Kazuhiko Minematsu (NEC Corporation, Japan), Bertram Poettering (Royal Holloway, University of London, and IBM Research Zurich)

54. Explicit Rate-1 Non-malleable Codes for Local Tampering

    Divya Gupta (Microsoft Research), Hemanta K. Maji (Purdue University), Mingyuan Wang (Purdue University)

55. Symmetric Primitives with Structured Secrets

    Navid Alamati (University of Michigan), Hart Montgomery (Fujitsu Labs of America), Sikhar Patranabis (IIT Kharagpur)

56. Trapdoor Hash Functions and their Applications

    Nico Döttling (CISPA Helmholtz Center), Sanjam Garg (University of California, Berkeley), Yuval Ishai (Technion), Giulio Malavolta (Carnegie Mellon University), Tamer Mour (Weizmann Institute of Science), Rafail Ostrovsky (University of California, Los Angeles)

57. Nonces are Noticed: AEAD Revisited

    Mihir Bellare (University of California San Diego), Ruth Ng (University of California San Diego), Bjorn Tackmann (IBM)

58. Homomorphic Time-Lock Puzzles and Applications

    Giulio Malavolta (Carnegie Mellon University), Sri Aravinda Krishnan Thyagarajan (Friedrich-Alexander University Erlangen-Nürnberg )

59. New Constructions of Reusable Designated-Verifier NIZKs

    Alex Lombardi (MIT), Willy Quach (Northeastern University), Ron D. Rothblum (Technion), Daniel Wichs (Northeastern University), David J. Wu (University of Virginia)

60. Synchronous, with a Chance of Partition Tolerance

    Yue Guo (Cornell and Thunder Research), Rafael Pass (Cornell and Thunder Research), Elaine Shi (Cornell and Thunder Research)

61. Quantum security proofs using semi-classical oracles

    Andris Ambainis (University of Latvia), Mike Hamburg (Rambus Security Division), Dominique Unruh (University of Tartu)

62. Subvector Commitments with Applications to Succinct Arguments

    Russell W. F. Lai (Friedrich-Alexander University Erlangen-Nürnberg), Giulio Malavolta (Carnegie Mellon University)

63. Reusable Non-Interactive Secure Computation

    Melissa Chase (Microsoft Research, Redmond), Yevgeniy Dodis (New York University), Yuval Ishai (Technion), Daniel Kraschewski (TNG Technology Consulting GmbH), Tianren Liu (MIT), Rafail Ostrovsky (UCLA), Vinod Vaikuntanathan (MIT)

64. Realizing Chosen Ciphertext Security Generically in Attribute-Based Encryption and Predicate Encryption

    Venkata Koppula (Weizmann Institute of Science), Brent Waters (University of Texas at Austin and NTT Research)

65. Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs

    Dan Boneh (Stanford University), Elette Boyle (IDC Herzliya), Henry Corrigan-Gibbs (Stanford University), Niv Gilboa (Ben-Gurion University), Yuval Ishai (Technion)

66. Continuous Space-Bounded Non-Malleable Codes from Stronger Proofs-of-Space

    Binyi Chen (University of California, Santa Barbara), Yilei Chen (VISA Research), Kristina Hostáková (TU Darmstadt), Pratyay Mukherjee (VISA Research)

67. Efficient Lattice-Based Zero-Knowledge Arguments with Standard Soundness: Construction and Applications

    Rupeng Yang (School of Computer Science and Technology, Shandong University, Jinan, China; Department of Computing,The Hong Kong Polytechnic University, Hong Kong), Man Ho Au (Department of Computing,The Hong Kong Polytechnic University, Hong Kong), Zhenfei Zhang (Algorand, USA), Qiuliang Xu (School of Software, Shandong University, Jinan, China), Zuoxia Yu (Department of Computing,The Hong Kong Polytechnic University, Hong Kong), William Whyte (Qualcomm Technologies Incorporated, USA)

68. Public-Key Cryptography in the Fine-Grained Setting

    Rio LaVigne (MIT), Andrea Lincoln (MIT), Virginia Vassilevska Williams (MIT)

69. The Privacy Blanket of the Shuffle Model

    Borja Balle (Independent researcher), James Bell (The Alan Turing Institute), Adria Gascon (The Alan Turing Institute / Warwick University), Kobbi Nissim (Georgetown University)

70. Security in the Presence of Key Reuse: Context-Separable Interfaces and their Applications

    Christopher Patton (University of Florida), Thomas Shrimpton (University of Florida)

71. Algebraic Techniques for Short(er) Exact Lattice-Based Zero-Knowledge Proofs

    Jonathan Bootle (IBM Research - Zurich), Vadim Lyubashevsky (IBM Research - Zurich), Gregor Seiler (IBM Research - Zurich, ETH Zurich)

72. Asymmetric Message Franking: Secure Moderation for Metadata-Private End-to-End Encryption

    Nirvan Tyagi (Cornell University), Paul Grubbs (Cornell Tech), Julia Len (Cornell University), Ian Miers (Cornell Tech), Thomas Ristenpart (Cornell Tech)

73. On Round-Optimal Statistical Zero-Knowledge Arguments

    Nir Bitansky (Tel Aviv University), Omer Paneth (MIT)

74. CCA Security and Trapdoor Functions via Key-Dependent-Message Security

    Fuyuki Kitagawa (NTT Secure Platform Laboratories), Takahiro Matsuda (National Institute of Advanced Industrial Science and Technology), Keisuke Tanaka (Tokyo Institute of Technology)

75. Simple Proofs of Space-Time and Rational Proofs of Storage

    Tal Moran (IDC Herzliya), Ilan Orlov (Outbrain)

76. Unifying computational entropies via Kullback-Leibler divergence

    Rohit Agrawal (Harvard University), Yi-Hsiu Chen (Harvard University), Thibaut Horel (Harvard University), Salil Vadhan (Harvard University)

77. Strong Asymmetric PAKE based on Trapdoor CKEM

    Tatiana Bradley (University of California, Irvine), Stanislaw Jarecki (University of California, Irvine), Jiayu Xu (University of California, Irvine)

78. Batching Techniques for Accumulators with Applications to IOPs and Stateless Blockchains

    Dan Boneh (Stanford University), Benedikt Bünz (Stanford University), Ben Fisch (Stanford University)

79. How to Build Pseudorandom Functions From Public Random Permutations

    Yu Long Chen (imec-COSIC, KU Leuven), Eran Lambooij (University of Haifa), Bart Mennink (Digital Security Group, Radboud University)

80. Efficient Pseudorandom Correlation Generators: Silent OT Extension and More

    Elette Boyle (IDC Herzliya), Geoffroy Couteau (Karlsruhe Institute of Technology), Niv Gilboa (Ben-Gurion University of the Negev), Yuval Ishai (Technion), Lisa Kohl (Karlsruhe Institute of Technology), Peter Scholl (Aarhus University)

81. It wasn't me! Repudiability and Unclaimability of Ring Signatures

    Sunoo Park (MIT and Harvard), Adam Sealfon (MIT)