VLDB 2026 Research / reviewers in the wild / expert
Arup Mondal
dblp:284/0935
· DBLP profile ↗
8ranked-venue papers
2as first author
8since 2021 · last 2026
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 6 · 2 first-author · 6 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Traceable Threshold Batch Encryption with Applications to Enhancing Mempool PrivacyabstractBuilding robust ways to outwit MEV strategies by network validators in cryptocurrency applications is garnering rapid interests now. Encrypting mempools with (varieties of) threshold encryption systems is seen as one of the leading solutions to this problem. Particularly, the notion of Batched Threshold Encryption (BTE) proposed in multiple recent papers by Choudhuri et al. [USENIX 2024, 2025] and Agarwal et al. [CRYPTO 2025] gives promising approaches to build scalable encrypted mempools. However, the existing BTE does not address collusion among (potentially malicious) validators (leaking confidential information). Anirban Chakrabarti, Monosij Maitra, Arup Mondal |
AsiaCCS | 3 |
| 2026 | Weighted Batched Threshold Encryption With Applications to Mempool Privacy
Kushal Babel, Sourav Das 0001, Babak Poorebrahim Gilkalaye, Arup Mondal, Benny Pinkas, Peter Rindal, Aayush Yadav |
SP | 5 |
| 2025 | Rumors MPC: GOD for Dynamic Committees, Low Communication via Constant-Round Chat
Bernardo Machado David, Arup Mondal, Rahul Satish |
ASIACRYPT (5) | 2 |
| 2025 | Silent Threshold Traitor Tracing & Enhancing Mempool PrivacyabstractThe rising commerciality of cryptocurrencies and blockchains in DeFi applications raises the importance of implementing robust methods to protect its regular users against parties with enormous amounts of resources that allows them to balefully influence the market through various Maximal Extractable Value (MEV) strategies. There are typical situations in such scenarios where an end-user may want to hide its transaction details till it has been executed. Ensuring the privacy of pending mempool transactions thus becomes an important goal. To this end, various decentralized versions of threshold encryption (TE) systems have been recently shown particularly effective. Anirban Chakrabarti, Monosij Maitra, Arup Mondal, Kushaz Sehgal |
CCS | 3 |
| 2023 | Poster: Attestor - Simple Proof-of-Storage-TimeabstractProof of Storage-Time (PoST) is a cryptographic primitive that enables a server to demonstrate non-interactive continuous availability of outsourced data in a publicly verifiable way. Arup Mondal |
CCS | 1 |
| 2023 | GENERALIST: A latent space based generative model for protein sequence familiesabstractGenerative models of protein sequence families are an important tool in the repertoire of protein scientists and engineers alike. However, state-of-the-art generative approaches face inference, accuracy, and overfitting- related obstacles when modeling moderately sized to large proteins and/or protein families with low sequence coverage. Here, we present a simple to learn, tunable, and accurate generative model, GENERALIST: GENERAtive nonLInear tenSor-factorizaTion for protein sequences. GENERALIST accurately captures several high order summary statistics of amino acid covariation. GENERALIST also predicts conservative local optimal sequences which are likely to fold in stable 3D structure. Importantly, unlike current methods, the density of sequences in GENERALIST-modeled sequence ensembles closely resembles the corresponding natural ensembles. Finally, GENERALIST embeds protein sequences in an informative latent space. GENERALIST will be an important tool to study protein sequence variability. Hoda Akl, Brooke Emison, Xiaochuan Zhao, Arup Mondal, Purushottam D. Dixit |
PLoS Comput. Biol. | 4 |
| 2022 | NEUROCRYPT: Coercion-Resistant Implicit Memory Authentication (Student Abstract)abstractOvercoming the threat of coercion attacks in a cryptographic system has been a top priority for system designers since the birth of cyber-security. One way to overcome such a threat is to leverage implicit memory to construct a defense against rubber-hose attacks where the users themselves do not possess conscious knowledge of the trained password. We propose NeuroCrypt, a coercion-resistant authentication system that uses an improved version of the Serial Interception Sequence Learning task, employing additional auditory and haptic modalities backed by concepts borrowed from cognitive psychology. We carefully modify the visual stimuli as well as add auditory and haptic stimuli to improve the implicit learning process, resulting in faster training and longer retention. Moreover, our improvements guarantee that explicit recognition of the trained passwords remains suppressed. Ritul Satish, Niranjan Rajesh, Argha Chakrabarty, Sristi Bafna, Arup Mondal, Debayan Gupta |
AAAI | 6 |
| 2021 | Poster: FLATEE: Federated Learning Across Trusted Execution EnvironmentsabstractFederated learning allows us to distributively train a machine learning model where multiple parties share local model parameters without sharing private data. However, parameter exchange may still leak information. Several approaches have been proposed to overcome this, based on multi-party computation, fully homomorphic encryption, etc.; many of these protocols are slow and impractical for real-world use as they involve a large number of cryptographic operations. In this paper, we propose the use of Trusted Execution Environments (TEE), which provide a platform for isolated execution of code and handling of data, for this purpose. We describe Flatee, an efficient privacy-preserving federated learning framework across TEEs, which considerably reduces training and communication time. Our framework can handle malicious parties (we do not natively solve adversarial data poisoning, though we describe a preliminary approach to handle this). Arup Mondal, Yash More, Ruthu Hulikal Rooparaghunath, Debayan Gupta |
EuroS&P | 1 |