Demo Data from SIGIR 2026 / reviewers in the wild / expert
Rahul Govind
dblp:215/0203
· DBLP profile ↗
3ranked-venue papers
0as first author
2since 2021 · last 2023
0000-0001-7090-7837ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 1Databases, data management, data science and information retrieval · 1 · 1 since 2021Theory of computation · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Network and information security
1 paper |
Cryptographic protocols and secure computation · 77% Network security · 23% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic protocols and secure computation › secure multiparty computation
asynchronous MPC |
0.4 | 1 | 2019 | HoneyBadgerMPC and AsynchroMix: Practical Asynchronous MPC and its Application to Anonymous Communication · CCS 2019 |
Cryptographic protocols and secure computation
secure multiparty computation |
0.4 | 1 | 2019 | HoneyBadgerMPC and AsynchroMix: Practical Asynchronous MPC and its Application to Anonymous Communication · CCS 2019 |
Network security › anonymity networks › anonymous communication
anonymous broadcast |
0.1 | 1 | 2019 | HoneyBadgerMPC and AsynchroMix: Practical Asynchronous MPC and its Application to Anonymous Communication · CCS 2019 |
Network security › anonymity networks
anonymous communication |
0.1 | 1 | 2019 | HoneyBadgerMPC and AsynchroMix: Practical Asynchronous MPC and its Application to Anonymous Communication · CCS 2019 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Making Data Engineering Declarative
Michael Armbrust, Ali Ghodsi 0002, Reynold Xin, Vuk Ercegovac, Sourav Chatterji, Eun-Gyu Kim, Paul Lappas, Yannis Papakonstantinou, Yingyi Bu, Yijia Cui, Rahul Govind, Aakash Japi, Kiavash Kianfar, Jon Mio, Mukul Murthy, Supun Nakandala, Yannis Sismanis, Justin Tang, Joseph Torres |
CIDR | 12 |
| 2021 | PySPH: A Python-based Framework for Smoothed Particle HydrodynamicsabstractPySPH is an open-source, Python-based, framework for particle methods in general and Smoothed Particle Hydrodynamics (SPH) in particular. PySPH allows a user to define a complete SPH simulation using pure Python. High-performance code is generated from this high-level Python code and executed on either multiple cores, or on GPUs, seamlessly. It also supports distributed execution using MPI. PySPH supports a wide variety of SPH schemes and formulations. These include, incompressible and compressible fluid flow, elastic dynamics, rigid body dynamics, shallow water equations, and other problems. PySPH supports a variety of boundary conditions including mirror, periodic, solid wall, and inlet/outlet boundary conditions. The package is written to facilitate reuse and reproducibility. This article discusses the overall design of PySPH and demonstrates many of its features. Several example results are shown to demonstrate the range of features that PySPH provides. Prabhu Ramachandran, Aditya Bhosale, Kunal Puri, Pawan Negi, Abhinav Muta, A. Dinesh, Dileep Menon, Rahul Govind, Suraj Sanka, Amal S. Sebastian, Ananyo Sen, Rohan Kaushik, Anshuman Kumar 0003, Vikas Kurapati, Mrinalgouda Patil, Deep Tavker, Pankaj Pandey, Chandrashekhar Kaushik, Arkopal Dutt, Arpit Agarwal 0001 |
ACM Trans. Math. Softw. | 8 |
| 2019 | HoneyBadgerMPC and AsynchroMix: Practical Asynchronous MPC and its Application to Anonymous CommunicationabstractMultiparty computation as a service (MPSaaS) is a promising approach for building privacy-preserving communication systems. However, in this paper, we argue that existing MPC implementations are inadequate for this application as they do not address fairness, let alone robustness. Even a single malicious server can cause the protocol to abort while seeing the output for itself, which in the context of an anonymous communication service would create a vulnerability to censorship and de-anonymization attacks. To remedy this we propose a new MPC implementation, HoneyBadgerMPC, that combines a robust online phase with an optimistic offline phase that is efficient enough to run continuously alongside the online phase. We use HoneyBadgerMPC to develop an application case study, called AsynchroMix, that provides an anonymous broadcast functionality. AsynchroMix features a novel MPC program that trades off between computation and communication, allowing for low-latency message mixing in varying settings. In a cloud-based distributed benchmark with 100 nodes, we demonstrate mixing a batch of 512 messages in around 20 seconds and up to 4096 messages in around two minutes. Donghang Lu, Thomas Yurek, Samarth Kulshreshtha, Rahul Govind, Aniket Kate, Andrew Miller 0001 |
CCS | 4 |