scispace - formally typeset
S

Srinivas Devadas

Researcher at Massachusetts Institute of Technology

Publications -  498
Citations -  35003

Srinivas Devadas is an academic researcher from Massachusetts Institute of Technology. The author has contributed to research in topics: Sequential logic & Combinational logic. The author has an hindex of 88, co-authored 480 publications receiving 31897 citations. Previous affiliations of Srinivas Devadas include University of California, Berkeley & Cornell University.

Papers
More filters
Book ChapterDOI

The Untrusted Computer Problem and Camera-Based Authentication

TL;DR: In this paper, the authentication problem is reduced to a simpler problem, in which the user carries a trusted device with her, and a description is given of two camera-based devices that are being developed.
Journal ArticleDOI

Trapdoor Computational Fuzzy Extractors and Stateless Cryptographically-Secure Physical Unclonable Functions

TL;DR: A fuzzy extractor whose security can be reduced to the hardness of Learning Parity with Noise (LPN) and can efficiently correct a constant fraction of errors in a biometric source with a “noise-avoiding trapdoor” is presented.
Journal ArticleDOI

Retiming sequential circuits for low power

TL;DR: An exact method of estimating power in pipelined sequential circuits that accurately models the correlation between the vectors applied to the combinational logic of the circuit and is significantly more efficient than methods based on solving Chapman–Kolmogorov equations.
Proceedings ArticleDOI

Test generation for highly sequential circuits

TL;DR: The authors present a novel test procedure that exploits both the structure of the combinational logic in the circuit as well as the sequential behavior of the circuit, and describe fast algorithms for state justification and state differentiation using the ON sets and OFF sets of flip-flop inputs and primary outputs.
Proceedings ArticleDOI

Atom: Horizontally Scaling Strong Anonymity

TL;DR: Atom as mentioned in this paper is an anonymous messaging system that protects against traffic-analysis attacks, where each server touches only a small fraction of the total messages routed through the network, and the system's capacity scales nearlinearly with the number of servers.