Zobrazeno 1 - 10
of 228
pro vyhledávání: '"SAHAI, AMIT"'
In this work, we propose a new way to (non-interactively, verifiably) demonstrate Quantum Advantage by solving the average-case $\mathsf{NP}$ search problem of finding a solution to a system of (underdetermined) multivariate quadratic equations over
Externí odkaz:
http://arxiv.org/abs/2411.14697
Autor:
Harel-Canada, Fabrice, Zhou, Hanyu, Muppalla, Sreya, Yildiz, Zeynep, Kim, Miryung, Sahai, Amit, Peng, Nanyun
Evaluations of creative stories generated by large language models (LLMs) often focus on objective properties of the text, such as its style, coherence, and diversity. While these metrics are indispensable, they do not speak to a story's subjective,
Externí odkaz:
http://arxiv.org/abs/2406.12680
In this work, we show how to construct indistinguishability obfuscation from subexponential hardness of four well-founded assumptions. We prove: Let $\tau \in (0,\infty), \delta \in (0,1), \epsilon \in (0,1)$ be arbitrary constants. Assume sub-expone
Externí odkaz:
http://arxiv.org/abs/2008.09317
Autor:
Rasmussen, Peter M. R., Sahai, Amit
Any $d$-regular graph on $n$ vertices with spectral expansion $\lambda$ satisfying $n = \Omega(d^3\log(d)/\lambda)$ yields a $O\left(\frac{\lambda^{3/2}}{d}\right)$-non-malleable code for single-bit messages in the split-state model.
Comment: 10
Comment: 10
Externí odkaz:
http://arxiv.org/abs/1810.00106
Publikováno v:
Communications of the ACM; Mar2024, Vol. 67 Issue 3, p97-105, 9p
Secure Multi-Party Computation (MPC) is one of the most powerful tools developed by modern cryptography: it facilitates collaboration among mutually distrusting parties by implementing a virtual trusted party. Despite the remarkable potential of such
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Sahai, Amit, 1974
Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2000.
Includes bibliographical references (p. 133-140).
by Amit Sahai.
Ph.D.
Includes bibliographical references (p. 133-140).
by Amit Sahai.
Ph.D.
Externí odkaz:
http://hdl.handle.net/1721.1/86616
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 "robust" protocols, where each party sends messages only in fixed and pre
Externí odkaz:
http://arxiv.org/abs/1312.4182
Autor:
Sahai, Amit, 1974
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1998.
Includes bibliographical references (p. 36-39).
by Amit Sahai.
M.S.
Includes bibliographical references (p. 36-39).
by Amit Sahai.
M.S.
Externí odkaz:
http://hdl.handle.net/1721.1/47437