Zobrazeno 1 - 10
of 27
pro vyhledávání: '"VASUDEVAN, PRASHANT NALINI"'
The k-Tree algorithm [Wagner 02] is a non-trivial algorithm for the average-case k-SUM problem that has found widespread use in cryptanalysis. Its input consists of k lists, each containing n integers from a range of size m. Wagner's original heurist
Externí odkaz:
http://arxiv.org/abs/2410.06856
Autor:
Agrawal, Shweta, Saha, Sagnik, Schwartzbach, Nikolaj I., Vanukuri, and Akhil, Vasudevan, Prashant Nalini
In the average-case $k$-SUM problem, given $r$ integers chosen uniformly at random from $\{0,\dots,M-1\}$, the objective is to find a ``solution'' set of $k$ numbers that sum to $0$ modulo $M$. In the dense regime of $M \leq r^k$, where solutions exi
Externí odkaz:
http://arxiv.org/abs/2304.01787
Recent digital rights frameworks give users the right to delete their data from systems that store and process their personal information (e.g., the "right to be forgotten" in the GDPR). How should deletion be formalized in complex systems that inter
Externí odkaz:
http://arxiv.org/abs/2210.07876
Privacy attacks on machine learning models aim to identify the data that is used to train such models. Such attacks, traditionally, are studied on static models that are trained once and are accessible by the adversary. Motivated to meet new legal re
Externí odkaz:
http://arxiv.org/abs/2202.03460
The right of an individual to request the deletion of their personal data by an entity that might be storing it -- referred to as the right to be forgotten -- has been explicitly recognized, legislated, and exercised in several jurisdictions across t
Externí odkaz:
http://arxiv.org/abs/2002.10635
Autor:
Vasudevan, Prashant Nalini
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 167-180).
Fine-grained cryptograph
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 167-180).
Fine-grained cryptograph
Externí odkaz:
http://hdl.handle.net/1721.1/120412
Autor:
Vasudevan, Prashant Nalini
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 49-52).
We show a general connection
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 49-52).
We show a general connection
Externí odkaz:
http://hdl.handle.net/1721.1/101590
We examine the power of statistical zero knowledge proofs (captured by the complexity class SZK) and their variants. First, we give the strongest known relativized evidence that SZK contains hard problems, by exhibiting an oracle relative to which SZ
Externí odkaz:
http://arxiv.org/abs/1609.02888
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.
In the average-case $k$-SUM problem, given $r$ integers chosen uniformly at random from $\{0,\ldots,M-1\}$, the objective is to find a set of $k$ numbers that sum to $0$ modulo $M$ (this set is called a solution). In the related $k$-XOR problem, give
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::72a47760d88f40f95e690ee04b938616
http://arxiv.org/abs/2304.01787
http://arxiv.org/abs/2304.01787