Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Shravani Patil

dblp:322/3457 · DBLP profile ↗
← Back
9ranked-venue papers
1as first author
9since 2021 · last 2026
0000-0002-4820-6652ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 8 · 8 since 2021Systems, architecture and hardware · 1 · 1 first-author · 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
7 papers
Cryptographic protocols and secure computation · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

Topics — the 9 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation
secure multiparty computation
5.472026
Breaking the Barrier for Asynchronous MPC with a Friend · SP 2026
New Upper and Lower Bounds for Perfectly Secure MPC · EUROCRYPT 2026
Perfectly-secure Network-agnostic MPC with Optimal Resiliency · PODC 2025
Cryptographic protocols and secure computation › secure multiparty computation
asynchronous MPC
1.822026
Breaking the Barrier for Asynchronous MPC with a Friend · SP 2026
Perfect Asynchronous MPC with Linear Communication Overhead · EUROCRYPT (5) 2024
Cryptographic protocols and secure computation › secure multiparty computation
perfect security
1.522025
Perfectly-secure Network-agnostic MPC with Optimal Resiliency · PODC 2025
Detect, Pack and Batch: Perfectly-Secure MPC with Linear Communication and Constant Expected Time · EUROCRYPT (2) 2023
Cryptographic protocols and secure computation › secure multiparty computation
communication-efficient MPC
1.422024
Perfect Asynchronous MPC with Linear Communication Overhead · EUROCRYPT (5) 2024
Detect, Pack and Batch: Perfectly-Secure MPC with Linear Communication and Constant Expected Time · EUROCRYPT (2) 2023
Cryptographic protocols and secure computation › secure multiparty computation
honest-majority MPC
1.122022
Poster MPClan: : Protocol Suite for Privacy-Conscious Computations · CCS 2022
Attaining GOD Beyond Honest Majority with Friends and Foes · ASIACRYPT (1) 2022
Cryptographic protocols and secure computation › secure multiparty computation
unconditionally secure multiparty computation
1.012026
New Upper and Lower Bounds for Perfectly Secure MPC · EUROCRYPT 2026
Cryptographic protocols and secure computation › secure multiparty computation
network-agnostic MPC
0.912025
Perfectly-secure Network-agnostic MPC with Optimal Resiliency · PODC 2025
Distributed systems
consensus
0.912025
Asymptotically Free Broadcast in Constant Expected Time via Packed VSS · J. Cryptol. 2025
Cryptographic protocols and secure computation
communication complexity
0.312026
New Upper and Lower Bounds for Perfectly Secure MPC · EUROCRYPT 2026

Methods — techniques the papers use, named apart from their topics

secret sharing · 1.6linear communication · 0.8detect-and-pack · 0.7batch packing · 0.7
YearPublicationVenuePosition
2026 New Upper and Lower Bounds for Perfectly Secure MPC
Ivan Damgård, Shravani Patil, Arpita Patra, Lawrence Roy
EUROCRYPT2
2026 Breaking the Barrier for Asynchronous MPC with a Friend
Banashri Karmakar, Aniket Kate, Shravani Patil, Arpita Patra, Sikhar Patranabis, Protik Paul, Divya Ravi 0001
SP3
2025 Perfectly-secure Network-agnostic MPC with Optimal Resiliency
abstract
We study network-agnostic secure multiparty computation with perfect security. Traditionally MPC is studied assuming the underlying network is either synchronous or asynchronous. In a network-agnostic setting, the parties are unaware of whether the underlying network is synchronous or asynchronous.
Shravani Patil, Arpita Patra
PODC1
2025 Asymptotically Free Broadcast in Constant Expected Time via Packed VSS
Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra
J. Cryptol.3
2024 Perfect Asynchronous MPC with Linear Communication Overhead
Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra
EUROCRYPT (5)3
2023 Detect, Pack and Batch: Perfectly-Secure MPC with Linear Communication and Constant Expected Time
Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra
EUROCRYPT (2)3
2022 Attaining GOD Beyond Honest Majority with Friends and Foes
Aditya Hegde 0003, Nishat Koti, Varsha Bhat Kukkala, Shravani Patil, Arpita Patra, Protik Paul
ASIACRYPT (1)4
2022 Poster MPClan: : Protocol Suite for Privacy-Conscious Computations
abstract
The growing volumes of data collected and its analysis to provide better services create worries about digital privacy. The literature has relied on secure multiparty computation techniques to address privacy concerns and give practical solutions. However, recent research has mostly focused on the small-party honest-majority setting of up to four parties, noting efficiency concerns. In this work, we extend the strategies to support a larger number of participants in honest-majority setting with efficiency at the center stage.
Nishat Koti, Shravani Patil, Arpita Patra, Ajith Suresh
CCS2
2022 Asymptotically Free Broadcast in Constant Expected Time via Packed VSS
Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra
TCC (1)3