TPMPC 2025
The 11th Theory and Practice of Multi-Party Computation Workshop (TPMPC 2025) will be held at Indian Institute of Science, Bangalore, India from Monday, March 3rd to Thursday, March 6th, 2025.
We are looking forward to make this a great event! More details are coming soon, stay tuned!
Code of conduct
We want to make TPMPC a great experience for everyone! Therefore, we want to create a safe space where any form of discrimination or harassment – be it on the basis of your identity or age – will not be tolerated. Should anything happen that crosses your boundaries, you can always approach the organization team with any concern – either personally or via email.
Arpita Patra
Contact: https://www.csa.iisc.ac.in/~arpita/
We assure that your concern will be treated confidentially.
Organization
Local Organizers
Arpita Patra (Department of Computer Science and Automation, Indian Institute of Science Bangalore)
Shyam S M (Postdoc, IISc Bengaluru)
Administrative Organization
CSA Office (Indian Institute of Science): office [DOT] csa [AT] iisc [DOT] ac [DOT] in
Program Committee
Gilad Asharov (Bar-Ilan University)
Ivan Damgård (Aarhus University)
Yashvanth Kondi (Silence Laboratories)
Claudio Orlandi (Aarhus University)
Arpita Patra (Indian Institute of Science Bengaluru)
Sikhar Patranabis (IBM Research)
Divya Ravi (University of Amsterdam)
Mike Rosulek (Oregon State University)
Peter Scholl (Aarhus University)
Thomas Schneider (Technical University of Darmstadt)
Ajith Suresh (Technology Innovation Institute)
Steering Committee
Ivan Damgård (Aarhus University)
Carmit Hazay (Bar-Ilan University)
Claudio Orlandi (Aarhus University)
Arpita Patra (Indian Institute of Science, Bengaluru)
Mike Rosulek (Oregon State University)
Thomas Schneider (Technical University of Darmstadt)
Invited speakers
We are delighted to have talks from the following 10 confirmed invited speakers:
Erica Blum (Reed College)
Ashish Choudhury (International Institute of Information Technology)
Ivan Daamgaard (Aarhus University)
Carmit Hazay (Bar-Ilan University)
Yashvanth Kondi (Silence Laboratories)
Manoj M. Prabhakaran (IIT Bombay Trust Lab)
Luisa Sinisscalchi (Technical University of Denmark)
Christian Weinert (Royal Holloway University of London)
Hossein Yalame (Robert Bosch GmbH)
Chen-Da Liu Zhang (Web3 Foundation & Luzern U)
The talk details will be updated soon.
Call for contributed talks
Submission Deadline: Tue, October 15, 2024, 23:59 (AoE)
Notification: Mon, November 18, 2024
The 11th TPMPC Workshop seeks submissions for contributed talks in the area of the theory and/or practice of secure multiparty computation. The workshop does not have proceedings and hence, the submission can be based on either work in progress, papers in submission, or papers already published at a conference, workshop or journal. Areas of interest broadly include
Theoretical foundations of multiparty computation: feasibility, assumptions, asymptotic efficiency, etc.
Efficient MPC protocols for general or specific tasks of interest
Implementations, applications of, and tools for MPC
The TPMPC program committee will select talks with the aim of constructing a balanced program that will be of high interest to the audience.
Submission Details:
Contributed talks will be 20-30 minutes in-person talks in Bangalore.
The submission deadline for contributed talks is on Tuesday, October 15, 2024 (anywhere on Earth).
Notification of acceptance can be expected by Friday, November 15, 2024.
Please submit by sending an email to tpmpc2025.csa@iisc.ac.in with the subject "TPMPC Contributed Talk: <YOUR TALK TITLE>" with the following details:
Title
Authors and affiliations (also cc all contact authors on the email)
Speaker's name (who will register and give the presentation in person)
Speaker's position (e.g., PhD student, postdoc, ...)
Link to full paper (optional)
Published at (optional)
PDF containing a short summary (up to 2 pages excluding references, in LNCS format using \usepackage{fullpage}, need not be anonymized) of your proposed talk
Accepted contributed talks
Insta-Pok3r: Real-time Poker on Blockchain. Sanjam Garg (University of California, Berkeley), Aniket Kate (Purdue University / Supra Research), Pratyay Mukherjee (Supra Research), Rohit Sinha (Swirlds Labs) and Sriram Sridhar (University of California, Berkeley).
Graphiti: Secure Graph Computation Made More Scalable. Nishat Koti (Aztec Labs), Varsha Bhat Kukkala (Independent Researcher), Arpita Patra (Indian Institute of Science, India) and Bhavish Raj Gopal (Indian Institute of Science, India).
Multi-key Homomorphic Secret Sharing. Geoffroy Couteau (Université Paris Cité, CNRS, IRIF), Lalita Devadas (Massachusetts Institute of Technology), Aditya Hegde (Johns Hopkins University), Abhishek Jain (Johns Hopkins University, NTT Research) and Sacha Servan-Schreiber (Massachusetts Institute of Technology).
High-Throughput Secure Multiparty Computation with an Honest Majority in Various Network Settings. Christopher Harth-Kitzerow (Technical University of Munich (TUM), BMW Group), Ajith Suresh (Technology Innovation Institute (TII), Abu Dhabi), Yongqin Wang (University of Southern California (USC)), Hossein Yalame (Robert Bosch GmbH, Germany), Georg Carle (Technical University of Munich (TUM)) and Murali Annavaram (University of Southern California (USC)).
Don’t Eject the Impostor - Honest-Majority MPC With Fixed Malicious Parties. Andreas Brüggemann (TU Darmstadt), Oliver Schick, Thomas Schneider (TU Darmstadt), Ajith Suresh (Technology Innovation Institute, Abu Dhabi), Hossein Yalame (TUD).
Breaking the 1/λ-Rate Barrier for Arithmetic Garbling. Geoffroy Couteau (CNRS, IRIF, Université Paris Cité), Carmit Hazay (Bar-Ilan University), Aditya Hegde (Johns Hopkins University) and Naman Kumar (Oregon State University).
Concretely Efficient Asynchronous MPC from Lightweight Cryptography. Akhil Bandarupalli (Purdue University), Xiaoyu Ji (Tsinghua University), Aniket Kate (Purdue University & Supra Research), Chen-Da Liu-Zhang (Lucerne University of Applied Sciences and Arts & Web3 Foundation) and Yifan Song (Tsinghua University and Shanghai Qi Zhi Institute).
Secure Sorting and Selection via Function Secret Sharing. Amit Agarwal (University of Illinois Urbana-Champaign), Elette Boyle (NTT Research and Reichman University), Nishanth Chandran (Microsoft Research, India), Niv Gilboa (Ben-Gurion University), Divya Gupta (Microsoft Research), Yuval Ishai (Technion), Mahimna Kelkar (Cornell Tech) and Yiping Ma (University of Pennsylvania).
MPC as a Tool for Data Anonymization in Data Analytics: A legal and Technical Perspective. Sebastian Becker (Bosch Research), Christoph Bösch (Bosch Research), Benjamin Hettwer (Bosch Research), Thomas Hoeren (Institute for Information, Telecommunications and Media Law, University of Münster), Vincent Rieder (Bosch Research), Merlin Rombach (Institute for Information, Telecommunications and Media Law, University of Münster), Sven Trieflinger (Bosch Research) and Hossein Yalame (Bosch Research).
Private Laconic Oblivious Transfer with Preprocessing: Towards Efficient Unbalanced Secure Two-party Computation. Rishabh Bhadauria (Georgetown University), Nico Döttling (CISPA – Helmholtz Center for Information Security), Carmit Hazay (Bar-Ilan University), and Chuanwei Lin (CISPA – Helmholtz Center for Information Security).
Private Set Intersection on Authenticated Inputs. James Bartusek (New York University), Sanjam Garg (UC Berkeley), Abhishek Jain (NTT Research and Johns Hopkins University) and Guru-Vamsi Policharla (UC Berkeley)
OPA: One-shot Private Aggregation with Single Client Interaction. Harish Karthikeyan (JPMorgan AI Research, JPMorgan AlgoCRYPT CoE) and Antigoni Polychroniadou (JPMorgan AI Research, JPMorgan AlgoCRYPT CoE)
The Best of Both Worlds: Round-Optimized 2PC EDCSA at the cost of only 1 OLE and Applications to Embedded Cryptocurrency Wallets. Michael Adjedj (Fireblocks), Constantin Blokh (Fireblocks), Geoffroy Couteau (CNRS, IRIF), Antoine Joux (CISPA) and Nikolaos Makriyannis (Fireblocks).
Matchmaker: Fast Secure 2PC Inference across Deployment Scenarios. Neha Jawalkar (Indian Institute of Science, Bangalore), Nishanth Chandran (Microsoft Research, India), Divya Gupta (Microsoft Research, India), Rahul Sharma (Microsoft Research, India) and Arkaprava Basu (Indian Institute of Science, Bangalore).
Efficient Distributed Randomness Generation from Minimal Assumptions where Parties Speak Sequentially Once. Chen-Da Liu-Zhang (Lucerne University of Applied Sciences and Arts and Web3 Foundation, Zug, Switzerland), Elisaweta Masserova (Carnegie Mellon University, Pittsburgh, PA, USA), João Ribeiro (Instituto de Telecomunicações, Lisboa, Portugal and Departamento de Matemática, Instituto Superior Técnico, Universidade de Lisboa, Lisboa, Portugal), Pratik Soni (University of Utah, USA), Sri AravindaKrishnan Thyagarajan (University of Sydney, Australia).
Stable and Accurate Real-Time Pricing in Smart Grids. Soumyadyuti Ghosh (Department of Computer Science and Engineering, Indian Institute of Technology (IIT) Kharagpur, India), Boyapally Harishma (Temasek Labs, Nanyang Technological University, Singapore), Ajith Suresh (Technology Innovation Institute, Abu Dhabi), Arpita Patra (Indian Institute of Science (IISc), Bangalore, India), Soumyajit Dey (Department of Computer Science and Engineering, Indian Institute of Technology (IIT) Kharagpur, India), Debdeep Mukhopadhyay (Department of Computer Science and Engineering, Indian Institute of Technology (IIT) Kharagpur, India).
Practical Robust MPC for Galois Rings. Kelong Cong (Zama, Paris, France), Daniel Demmler (Zama, Paris, France), Tore Frederiksen (Zama, Paris, France), Nigel P. Smart (Zama, Paris, France), and Titouan Tanguy (Zama, Paris, France).
Separating Broadcast from Cheater Identification. Yashvant Kondi (Silence Laboratories) and Divya Ravi (University of Amsterdam).
Functional Adaptor Signatures: Beyond All-or-Nothing Blockchain-based Payments. Nikhil Vanjani (Carnegie Mellon University, USA), Pratik Soni (University of Utah, USA) and Sri AravindaKrishnan Thyagarajan (University of Sydney, Australia).
Round-Efficient 3-Party MPC for Dynamic Data Structures. Adithya Vadapalli (IIT Kanpur).
Honest Majority GOD MPC with O(depth(C)) Rounds and Low Online Communication. Amit Agarwal (University of Illinois Urbana Champaign), Alexander Bienstock (J.P. Morgan AI Research & J.P. Morgan AlgoCRYPT CoE), Ivan Damgård (Aarhus University) and Daniel Escudero (J.P. Morgan AI Research & J.P. Morgan AlgoCRYPT CoE).
Registration
Registration is open and can be done here. The deadline for registration is 14th February 2025 (AoE). Registration confirmations will be sent via email.
For visitors seeking conference visa from Indian Embassy, please write to us at tpmpc2025[dot]csa[at]iisc[dot]ac[dot]in by 30th November 2024 (AoE).
Registration is free but mandatory.
Accommodation
If you wish to stay at a hotel near the venue, the following are some great options:
Sheraton Grand Bangalore Hotel at Brigade Gateway (5 stars) [3.0 km from venue]
Four Seasons Hotel at Embassy One (5 stars) [5.1km from venue]
Hotel Leroy Grand (4 stars) [4.2km from venue]
The Fern Residency, Yeshwantpur (3 stars) [3.9km from venue]
Holiday Inn Express, Yeshwantpur (3 stars) [3.4km from venue]
Student stipends
We have a limited number of stipends to support students to attend the workshop. Preference will be given to students who have limited funding from other sources (e.g., from institutions without access to large travel funds).
The deadline for stipend applications is 20 December 2024 12 January 2025.
Requests can be made after 20 December 2024, but they will not be considered until the initial decisions are made.
To be considered for the stipend, the applicant should send an email to tpmpc2025[dot]csa[at]iisc[dot]ac[dot]in with the subject: "TPMPC student stipend application" containing the following details.
Name
Email ID
Status (Master's student/PhD student/Post doc/...)
Gender (F/M/D)
Affiliation
Country
Are you a contributed talk speaker?
An estimate of the expected funding for attending the workshop together with detailed breakdown of expenses excluding the registration fee but including costs such as travel expenses (by land/air), accommodation, etc.
A single PDF containing your CV, recent transcripts that corroborate the grades listed in the CV, and letter of motivation addressing why you should be funded
Please keep your supervisor in CC and ask them to confirm your application by email.
Applicants should note that the stipend may not be able to cover the entire attendance cost and that they may need to fund the remaining cost from other sources.