Srinivas Devadas

Srinivas Devadas

Auto-generated profile, based on publicly available information

Srinivas Devadas

Massachusetts Institute of Technology, Cambridge, MA, USA

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 December 2015
Verified
Book Chapter
Closed access
PDF file
SDSrinivas Devadas
Srinivas Devadas
MDMarten van Dijk
Marten van Dijk
CFChristopher W. Fletcher
Christopher W. Fletcher
LRLing Ren
Ling Ren
ESElaine Shi
Elaine Shi
DWDaniel Wichs
Daniel Wichs

8 August 2011
Verified
Book Chapter
Closed access
PDF file
URUlrich Rührmair
Ulrich Rührmair
SDSrinivas Devadas
Srinivas Devadas
FKFarinaz Koushanfar
Farinaz Koushanfar

30 December 2015 in Proceedings on Privacy Enhancing Technologies
Verified
Journal Article
Open access
PDF file
AKAlbert Kwon
Albert Kwon
DLDavid Lazar
David Lazar
SDSrinivas Devadas
Srinivas Devadas
BFBryan Ford
Bryan Ford
Existing anonymity systems sacrifice anonymity for efficient communication or vice-versa. Onion-routing achieves low latency, high bandwidth, and scalable anonymous communication, but is susceptible to traffic analysis attacks. Designs based on DC-Nets, on the other hand, protect the users against traffic analysis attacks, but sacrifice bandwidth. Verifiable mixnets maintain strong anonymity with low bandwidth overhead, but suffer from high computation overhead instead. In this paper, we present Riffle, a bandwidth and computation efficient communication system with strong anonymity. Riffle consists of a small set of anonymity servers and a large number of users, and guarantees anonymity among all honest clients as long as there exists at least one honest server. Riffle uses a new hybrid verifiable shuffle technique and private information retrieval for bandwidth- and computation-efficient anonymous communication. Our evaluation of Riffle in file sharing and microblogging applications shows that Riffle can achieve a bandwidth of over 100KB/s per user in an anonymity set of 200 users in the case of file sharing, and handle over 100,000 users with less than 10 second latency in the case of microblogging.

1 May 2006 in Designs, Codes and Cryptography
Verified
Journal Article
Closed access
PDF file
MDMarten Van Dijk
Marten Van Dijk
DCDwaine Clarke
Dwaine Clarke
BGBlaise Gassend
Blaise Gassend
GSG. Edward Suh
G. Edward Suh
SDSrinivas Devadas
Srinivas Devadas

20 June 2024 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
AKAleksandar Krastev
Aleksandar Krastev
NSNikola Samardzic
Nikola Samardzic
SLSimon Langowski
Simon Langowski
SDSrinivas Devadas
Srinivas Devadas
DSDaniel Sanchez
Daniel Sanchez
Fully Homomorphic Encryption (FHE) enables computing on encrypted data, letting clients securely offload computation to untrusted servers. While enticing, FHE has two key challenges that limit its applicability: it has high performance overheads (10,000× over unencrypted computation) and it is extremely hard to program. Recent hardware accelerators and algorithmic improvements have reduced FHE’s overheads and enabled large applications to run under FHE. These large applications exacerbate FHE’s programmability challenges. Writing FHE programs directly is hard because FHE schemes expose a restrictive, low-level interface that prevents abstraction and composition. Specifically, FHE requires packing encrypted data into large vectors (tens of thousands of elements long), FHE provides limited operations on these vectors, and values have noise that grows with each operation, which creates unintuitive performance tradeoffs. As a result, translating large applications, like neural networks, into efficient FHE circuits takes substantial tedious work. We address FHE’s programmability challenges with the Fhelipe FHE compiler. Fhelipe exposes a simple, numpy-style tensor programming interface, and compiles high-level tensor programs into efficient FHE circuits. Fhelipe’s key contribution is automatic data packing , which chooses data layouts for tensors and packs them into ciphertexts to maximize performance. Our novel framework considers a wide range of layouts and optimizes them analytically. This lets Fhelipe compile large FHE programs efficiently, unlike prior FHE compilers, which either use inefficient layouts or do not scale beyond tiny programs. We evaluate Fhelipe on both a state-of-the-art FHE accelerator and a CPU. Fhelipe is the first compiler that matches or exceeds the performance of large hand-optimized FHE applications, like deep neural networks, and outperforms a state-of-the-art FHE compiler by gmean 18.5×. At the same time, Fhelipe dramatically simplifies programming, reducing code size by 10× – 48×. CCS Concepts: • Software and its engineering → Compilers; • Security and privacy → Cryptography.

13 July 2017 in Foundations and Trends® in Electronic Design Automation
Verified
Journal Article
Closed access
PDF file
VCVictor Costan
Victor Costan
ILIlia Lebedev
Ilia Lebedev
SDSrinivas Devadas
Srinivas Devadas
This manuscript is the first in a two part survey and analysis of the state of the art in secure processor systems, with a specific focus on remote software attestation and software isolation. This manuscript first examines the relevant concepts in computer architecture and cryptography, and then surveys attack vectors and existing processor systems claiming security for remote computation and/or software isolation. This work examines in detail the modern isolation container (enclave) primitive as a means to minimize trusted software given practical trusted hardware and reasonable performance overhead. Specifically, this work examines in detail the programming model and software design considerations of Intel’s Software Guard Extensions (SGX), as it is an available and documented enclave-capable system. Part II of this work is a deep dive into the implementation and security evaluation of two modern enclave-capable secure processor systems: SGX and MIT’s Sanctum. The complex but insufficient threat model employed by SGX motivates Sanctum, which achieves stronger security guarantees under software attacks with an equivalent programming model. This work advocates a principled, transparent, and well-scrutinized approach to secure system design, and argues that practical guarantees of privacy and integrity for remote computation are achievable at a reasonable design cost and performance overhead.