Rutvik Patel

dblp:251/8434 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
4since 2021 · last 2026
—ORCID · unresolved

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

Security and privacy · 3 · 3 since 2021Theory of computation · 3 · 2 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021
YearPublicationVenuePosition
2026 Universally Composable Almost-Everywhere Secure Computation
abstract
Most existing work on secure multi-party computation (MPC) ignores a key idiosyncrasy of modern communication networks, that there are a limited number of communication paths between any two nodes, many of which might even be corrupted. The problem becomes particularly acute in the information-theoretic setting, where the lack of trusted setups (and the cryptographic primitives they enable) makes communication over sparse networks more challenging. The work by Garay and Ostrovsky [EUROCRYPT’08] on almost-everywhere MPC (AE-MPC), introduced “best-possible security” properties for MPC over such incomplete networks, where necessarily some of the honest parties may be excluded from the computation. In this work, we provide a universally composable definition of almost-everywhere security , which allows us to automatically and accurately capture the guarantees of AE-MPC (as well as AE-communication, the analogous “best-possible security” version of secure communication) in the Universal Composability (UC) framework of Canetti. Our results offer the first simulation-based treatment of this important but under-investigated problem, along with the first simulation-based proof of AE-MPC. To achieve that goal, we state and prove a general composition theorem, which makes precise the level or “quality” of AE-security that is obtained when a protocol’s hybrids are replaced with almost-everywhere components.
Nishanth Chandran, Pouyan Forghani, Juan A. Garay 0001, Rafail Ostrovsky, Rutvik Patel, Vassilis Zikas
J. Cryptol.5
2025 Integrating Field of View in Human-Aware Collaborative Planning
abstract
In human-robot collaboration (HRC), it is crucial for robot agents to consider humans' knowledge of their surroundings. In reality, humans possess a narrow field of view (FOV), limiting their perception. However, research on HRC often overlooks this aspect and presumes an omniscient human collaborator. Our study addresses the challenge of adapting to the evolving subtask intent of humans while accounting for their limited FOV. We integrate FOV within the humanaware probabilistic planning framework. To account for large state spaces due to considering FOV, we propose a hierarchical online planner that efficiently finds approximate solutions while enabling the robot to explore low-level action trajectories that enter the human FOV, influencing their intended subtask. Through user study with our adapted cooking domain, we demonstrate our FOV-aware planner reduces human's interruptions and redundant actions during collaboration by adapting to human perception limitations. We extend these findings to a virtual reality kitchen environment, where we observe similar collaborative behaviors.
Ya-Chuan Hsu, Michael Defranco, Rutvik Patel, Stefanos Nikolaidis
ICRA3
2025 Is It Even Possible? On the Parallel Composition of Asynchronous MPC Protocols
Ran Cohen, Pouyan Forghani, Juan A. Garay 0001, Rutvik Patel, Vassilis Zikas
TCC (1)4
2023 Concurrent Asynchronous Byzantine Agreement in Expected-Constant Rounds, Revisited
Ran Cohen, Pouyan Forghani, Juan A. Garay 0001, Rutvik Patel, Vassilis Zikas
TCC (4)4
2019 Power domination throttling
Boris Brimkov, Joshua Carlson, Illya V. Hicks, Rutvik Patel, Logan A. Smith
Theor. Comput. Sci.4