Srivatsan Ravi

Orcid: 0000-0002-2965-3940

According to our database1, Srivatsan Ravi authored at least 58 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Revisiting Nakamoto Consensus in Asynchronous Networks: A Comprehensive Analysis of Bitcoin Safety and Chain Quality.
IEEE/ACM Trans. Netw., February, 2024

Superflows: A New Tool for Forensic Network Flow Analysis.
CoRR, 2024

Privacy-Preserving Language Model Inference with Instance Obfuscation.
CoRR, 2024

2023
Secure and Reliable Network Updates.
ACM Trans. Priv. Secur., 2023

ð'ƒ3ð'‰ : Privacy-Preserving Path Validation System for Multi-Authority Sliced Networks.
IACR Cryptol. ePrint Arch., 2023

Street Rep: A Privacy-Preserving Reputation Aggregation System.
IACR Cryptol. ePrint Arch., 2023

Data-Driven Template-Free Invariant Generation.
CoRR, 2023

Labeling without Seeing? Blind Annotation for Privacy-Preserving Entity Resolution.
CoRR, 2023

FedML-HE: An Efficient Homomorphic-Encryption-Based Privacy-Preserving Federated Learning System.
CoRR, 2023

The Fence Complexity of Persistent Sets.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2023

FedGCN: Convergence-Communication Tradeoffs in Federated Training of Graph Convolutional Networks.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Improved Conflict-Based Search for the Virtual Network Embedding Problem.
Proceedings of the 32nd International Conference on Computer Communications and Networks, 2023

Lessons Learned: Building a Privacy-Preserving Entity Resolution Adaptation of PPJoin using End-to-End Homomorphic Encryption.
Proceedings of the IEEE European Symposium on Security and Privacy, 2023

2022
Evaluating the Feasibility of a Provably Secure Privacy-Preserving Entity Resolution Adaptation of PPJoin using Homomorphic Encryption.
CoRR, 2022

Secure Federated Learning for Neuroimaging.
CoRR, 2022

Securing 5G Slices using Homomorphic Encryption.
Proceedings of the IEEE Wireless Communications and Networking Conference, 2022

Decentralized Privacy-Preserving Path Validation for Multi-Slicing-Authority 5G Networks.
Proceedings of the IEEE Wireless Communications and Networking Conference, 2022

The Limits of Helping in Non-volatile Memory Data Structures.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2022

PREP-UC: A Practical Replicated Persistent Universal Construction.
Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

The FastMap Pipeline for Facility Location Problems.
Proceedings of the PRIMA 2022: Principles and Practice of Multi-Agent Systems, 2022

Explaining Deep Learning Models for Per-packet Encrypted Network Traffic Classification.
Proceedings of the IEEE International Symposium on Measurements & Networking, 2022

Conflict-Based Search for the Virtual Network Embedding Problem.
Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

2021
HashSplit: Exploiting Bitcoin Asynchrony to Violate Common Prefix and Chain Quality.
IACR Cryptol. ePrint Arch., 2021

Secure Publish-Process-Subscribe System for Dispersed Computing.
IACR Cryptol. ePrint Arch., 2021

Secure Neuroimaging Analysis using Federated Learning with Homomorphic Encryption.
CoRR, 2021

Optimal Concurrency for List-Based Sets.
Proceedings of the Parallel Computing Technologies, 2021

AMPPERE: A Universal Abstract Machine for Privacy-Preserving Entity Resolution Evaluation.
Proceedings of the CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, November 1, 2021

Revisiting Nakamoto Consensus in Asynchronous Networks: A Comprehensive Analysis of Bitcoin Safety and ChainQuality.
Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

2020
Scalable and serializable networked multi-actor programming.
Proc. ACM Program. Lang., 2020

RoSCo: Robust Updates for Software-Defined Networks.
IEEE J. Sel. Areas Commun., 2020

Separation and Equivalence results for the Crash-stop and Crash-recovery Shared Memory Models.
CoRR, 2020

Consistent and Secure Network Updates Made Practical.
Proceedings of the Middleware '20: 21st International Middleware Conference, 2020

PLASMA: programmable elasticity for stateful cloud computing applications.
Proceedings of the EuroSys '20: Fifteenth EuroSys Conference 2020, 2020

2018
Inherent limitations of hybrid transactional memory.
Distributed Comput., 2018

Merge: An Architecture for Interconnected Testbed Ecosystems.
CoRR, 2018

Generalized Paxos Made Byzantine (and Less Complex).
Algorithms, 2018

2017
Grasping the gap between blocking and non-blocking transactional memories.
J. Parallel Distributed Comput., 2017

Concurrency and Privacy with Payment-Channel Networks.
IACR Cryptol. ePrint Arch., 2017

Lower Bounds for Transactional Memory.
Bull. EATCS, 2017

Cost of Concurrency in Hybrid Transactional Memory.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

Programmable Elasticity for Actor-based Cloud Applications.
Proceedings of the 9th Workshop on Programming Languages and Operating Systems, 2017

A Concurrency-Optimal Binary Search Tree.
Proceedings of the Euro-Par 2017: Parallel Processing - 23rd International Conference on Parallel and Distributed Computing, Santiago de Compostela, Spain, August 28, 2017

2016
In the Search for Optimal Concurrency.
Proceedings of the Structural Information and Communication Complexity, 2016

The misbelief in delay scheduling.
Proceedings of the 4th Workshop on Distributed Cloud Computing, 2016

Programming Scalable Cloud Services with AEON.
Proceedings of the 17th International Middleware Conference, Trento, Italy, December 12, 2016

2015
On the cost of concurrency in transactional memory.
PhD thesis, 2015

On the Cost of Concurrency in Transactional Memory.
CoRR, 2015

Why Transactional Memory Should Not Be Obstruction-Free.
CoRR, 2015

A Concurrency-Optimal List-Based Set.
CoRR, 2015

Progressive Transactional Memory in Time and Space.
Proceedings of the Parallel Computing Technologies - 13th International Conference, PaCT 2015, Petrozavodsk, Russia, August 31, 2015

On Partial Wait-Freedom in Transactional Memory.
Proceedings of the 2015 International Conference on Distributed Computing and Networking, 2015

Safety and Deferred Update in Transactional Memory.
Proceedings of the Transactional Memory. Foundations, Algorithms, Tools, and Applications, 2015

2013
Safety of Deferred Update in Transactional Memory.
Proceedings of the IEEE 33rd International Conference on Distributed Computing Systems, 2013

2012
WTTM 2011: the third workshop on the theory of transactional memory.
SIGACT News, 2012

From Sequential to Concurrent: Correctness and Relative Efficiency
CoRR, 2012

Brief announcement: From sequential to concurrent: correctness and relative efficiency.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

2011
On the Cost of Concurrency in Transactional Memory.
Proceedings of the Principles of Distributed Systems - 15th International Conference, 2011

2010
Transactional memory, linking theory and practice.
SIGACT News, 2010


  Loading...