The submission for contributed talks is now closed and we are pleased to announce the list of accepted contributed talks for the TPMPC18:

• Adi Akavia (The Academic College of Tel-Aviv Jaffa): Secure Search via Multi Ring Fully Homomorphic Encryption
• Antigoni Polychroniadou (Cornell Tech, New York): Round-Optimal Secure Multi-Party Computation
• Ariel Nof (Bar-Ilan University,. Israel): Fast Large Scale Honest-Majority MPC for Malicious Adversaries
• Arpita Patra (Indian Institute of Science, Bangalore): Privacy-Free Garbled Circuits for Formulas: Size Zero and Information-Theoretic
• Avishay Yanai (Bar-Ilan University, Israel): Efficient Maliciously Secure Multiparty Computation for RAM
• Berry Schoenmakers (TU Eindhoven): MPyC -- Python Package for Secure Multiparty Computation
• Chiraag Juvekar (Massachusetts Institute of Technology): Gazelle: A Low Latency Framework for Secure Neural Network Inference
• Daniel Demmler (TU Darmstadt): Towards Practical Private Internet Routing using MPC
• Daniel Escudero (Aarhus University): SPDZ2k: Efficient MPC mod 2^k for Dishonest Majority
• Dragos Rotaru (Bristol University): MPC across the wire: There is something you require
• Eysa Lee (Northeastern University): Secure Two-Party Threshold ECDSA from ECDSA Assumptions
• Irene Giacomelli (University of Wisconsin-Madison): Privacy-Preserving Regression via Homomorphic Encryption
• Mark Simkin (Aarhus University): Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings
• Muthuramakrishnan Venkitasubramaniam (University of Rochester): Ligero: Lightweight Zero Knowledge Argument
• Niek J. Bouman (TU Eindhoven): Solving Integer-Valued Linear Systems over the Rationals in Secure Multiparty Computation
• Nikolaj Volgushev (Alexandra Institute, Aarhus): Conclave: Secure Multi-Party Computation on Big Data
• Peter Rindal (Oregon State University): Fast Private Set Intersection from Fully Homomorphic Encryption
• Phillipp Schoppmann (Humboldt-Universität zu Berlin): Secure Text Classification in Federated Databases
• Ran Cohen (MIT and Northeastern University): Applying Modern Crypto to Advance Social Science
• Sabine Oechsner (Aarhus University): Computer-aided proofs for multiparty computation with active security
• Satrajit Ghosh (Aarhus University): Maliciously Secure Oblivious Linear Function Evaluation and its Applications
• Sophia Yakoubov (Boston University): A Novel Approach to Dual Execution for Yao’s Garbled Circuits with Applications to Fuzzy Password-Authenticated Key Exchange
• Tore Frederiksen (Alexandra Institute, Aarhus): Fast Distributed RSA Key Generation for Malicious Adversaries
• Vlademir Kolesnikov (Georgia Tech): SWiM: Secure Wildcard Pattern Matching From OT Extension