activity
20082026
most citedPotent Tree Codes and their applications: Coding for Interactive Communication, revisited

10 citations · 16 across the 6 of their papers we have counts for

collaborators

8 papers

quant-ph2026

Unconditional Unclonable Encryption

Prabhanjan Ananth, Amit Sahai, Seyoon Ragavan

We give an unconditional construction of information-theoretically secure one-time private-key unclonable encryption for one-bit messages, with efficient encryption and decryption…

cs.CR2020

Indistinguishability Obfuscation from Well-Founded Assumptions

Aayush Jain, Huijia Lin, Amit Sahai

In this work, we show how to construct indistinguishability obfuscation from subexponential hardness of four well-founded assumptions. We prove: Let $τ\in (0,\infty), δ\in (0,1), ε…

cs.CR2018★ 2 cited

Expander Graphs are Non-Malleable Codes

Peter M. R. Rasmussen, Amit Sahai

Any -regular graph on vertices with spectral expansion satisfying yields a -non-malleable code for single-bit mess…

cs.DS2013

Adaptive Protocols for Interactive Communication

Shweta Agrawal, Ran Gelles, Amit Sahai

How much adversarial noise can protocols for interactive communication tolerate? This question was examined by Braverman and Rao (IEEE Trans. Inf. Theory, 2014) for the case of "ro…

cs.CR2012★ 2 cited

Attribute-Based Encryption for Circuits from Multilinear Maps

Amit Sahai, Brent Waters

In this work, we provide the first construction of Attribute-Based Encryption (ABE) for general circuits. Our construction is based on the existence of multilinear maps. We prove s…

cs.CR2012★ 2 cited

On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption

Divya Gupta, Amit Sahai

In this work, we consider the long-standing open question of constructing constant-round concurrent zero-knowledge protocols in the plain model. Resolving this question is known to…