Skip to content

Author

Amit Sahai

We have 4 of 15 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Book Jun 2025

Using the Planted Clique Conjecture for Cryptography: Public-Key Encryption from Planted Clique and Noisy 𝑘-LIN over Expanders

We give a public key encryption scheme that is provably secure against poly-size adversaries, assuming nlogαn hardness of the standard planted clique conjecture, for any α ∈ (0,1), and a relatively mild hardness conjecture about noisy k-LIN over expanders that is not known to imply public-key encryption on its own. Bot...

Riddhi Ghosal, Isaac M. Hair, Aayush Jain et al. · 2 citations
Sep 2026

Witness Encryption via Prime-Order Generic Groups

This paper unconditionally construct witness encryption for NP in the classical generic cyclic group model with the following properties and gives the first superconstant-factor NP-hardness of approximation result for homogeneous MinRank under randomized polynomial-time reductions.

Isaac M. Hair, Amit Sahai · 0 citations
Preprint Aug 2026

Polynomial-Factor Deterministic NP-Hardness for SVP in Every lp Norm with p>2

For every constant $2<p<\infty$ and every constant \[ 0<\varepsilon<\min\left\{\frac{p-2}{4p},\frac18\right\}, \] we show that the $\ell_p$-shortest vector problem for lattices of rank $M$ is NP hard to approximate within a factor of $M^\varepsilon$, via a deterministic reduction. For $p=\infty$, the same holds for eve...

I. M. Hair, Amit Sahai · 1 citation
Preprint Aug 2026

Refuting a Conjecture of Umans and Wang on Arithmetic-Progression Divisor Covers

An \emph{$n$-divisor set} is a finite set of positive integers containing a multiple of every integer from $1$ through $n$. Umans and Wang proposed, as the arithmetic-progression version of their Strong $(\alpha,\beta)$-Divisor Conjecture, an $n$-divisor arithmetic progression having at most $n^{2\beta}$ terms, each of...

Xin-hua He, Amit Sahai · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.