Arun Venkataramani
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Interests
Arun Venkataramani has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Aruna Balasubramanian
Computer Science, Stony Brook University, Stony Brook, New York, USA
1 shared publication - Brian Neil Levine
University of Massachusetts
1 shared publication - Fadhil I. Kurnia
University of Massachusetts Amherst, United States
1 shared publication
Latest Publications
- Open Access
- 30 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 65-80
Oblivious Paxos
State-of-the-art consensus protocols like Paxos reveal the values being agreed upon to all nodes, but some deployment scenarios involving a subset of nodes outsourced to public cloud providers motivate hiding the value. In this work, we present the primary-backup secret-shared state machine (PBSSM) architecture and an underlying consensus protocol Oblivious Paxos (OPaxos) that enable strong consistency, high availability, privacy, and fast common-case performance. OPaxos enables privacy-preserving consensus by allowing acceptors to safely agree on a secret-shared value without utrusted acceptors knowing the value. We also present Fast Oblivious Paxos (Fast-OPaxos), which enables consensus over secret-shares in three one-way delays under low concurrency settings. Our prototype-driven microbenchmarks and smarthome case study show that OPaxos induces a negligible latency overhead of at most 0.1 ms compared to Paxos while maintaining more than 85% of Paxos' capacity for small requests, and can provide lower latency and higher capacity compared to Paxos for large request sizes.
- 30 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 65-80
Open AccessOblivious Paxos
State-of-the-art consensus protocols like Paxos reveal the values being agreed upon to all nodes, but some deployment scenarios involving a subset of nodes outsourced to public cloud providers motivate hiding the value. In this work, we present the primary-backup secret-shared state machine (PBSSM) architecture and an underlying consensus protocol Oblivious Paxos (OPaxos) that enable strong consistency, high availability, privacy, and fast common-case performance. OPaxos enables privacy-preserving consensus by allowing acceptors to safely agree on a secret-shared value without utrusted acceptors knowing the value. We also present Fast Oblivious Paxos (Fast-OPaxos), which enables consensus over secret-shares in three one-way delays under low concurrency settings. Our prototype-driven microbenchmarks and smarthome case study show that OPaxos induces a negligible latency overhead of at most 0.1 ms compared to Paxos while maintaining more than 85% of Paxos' capacity for small requests, and can provide lower latency and higher capacity compared to Paxos for large request sizes.
- Open Access
- 27 August 2007
- Published by Association for Computing Machinery (ACM)
- Vol. 37 (4) , 373-384
DTN routing as a resource allocation problem
- 27 August 2007
- Published by Association for Computing Machinery (ACM)
- Vol. 37 (4) , 373-384
Open AccessDTN routing as a resource allocation problem