Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Lombardi, Alex"'
The Unitary Synthesis Problem (Aaronson-Kuperberg 2007) asks whether any $n$-qubit unitary $U$ can be implemented by an efficient quantum algorithm $A$ augmented with an oracle that computes an arbitrary Boolean function $f$. In other words, can the
Externí odkaz:
http://arxiv.org/abs/2310.08870
Autor:
Bartusek, James, Kalai, Yael Tauman, Lombardi, Alex, Ma, Fermi, Malavolta, Giulio, Vaikuntanathan, Vinod, Vidick, Thomas, Yang, Lisa
We construct a classically verifiable succinct interactive argument for quantum computation (BQP) with communication complexity and verifier runtime that are poly-logarithmic in the runtime of the BQP computation (and polynomial in the security param
Externí odkaz:
http://arxiv.org/abs/2206.14929
We show a general method of compiling any $k$-prover non-local game into a single-prover interactive game maintaining the same (quantum) completeness and (classical) soundness guarantees (up to negligible additive factors in a security parameter). Ou
Externí odkaz:
http://arxiv.org/abs/2203.15877
A major difficulty in quantum rewinding is the fact that measurement is destructive: extracting information from a quantum state irreversibly changes it. This is especially problematic in the context of zero-knowledge simulation, where preserving the
Externí odkaz:
http://arxiv.org/abs/2111.12257
Autor:
Lombardi, Alex (Alex John)
Thesis: S.M. in Computer Science and Engineering, Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 61-64
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 61-64
Externí odkaz:
http://hdl.handle.net/1721.1/118056
Autor:
Lombardi, Alex
In the setting of a group $\Gamma$ acting faithfully on a set $X$, a $k$-coloring $c: X\rightarrow \{1, 2, ..., k\}$ is called $\Gamma$-distinguishing if the only element of $\Gamma$ that fixes $c$ is the identity element. The distinguishing number $
Externí odkaz:
http://arxiv.org/abs/1408.5849
Publikováno v:
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS).
A major difficulty in quantum rewinding is the fact that measurement is destructive: extracting information from a quantum state irreversibly changes it. This is especially problematic in the context of zero-knowledge simulation, where preserving the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e383788035ddea793db9e309659055fc
https://doi.org/10.1109/focs54457.2022.00086
https://doi.org/10.1109/focs54457.2022.00086
Autor:
Lombardi, Alex, Vaikuntanathan, Vinod
A hash function family ��� is correlation intractable for a t-input relation ��� if, given a random function h chosen from ���, it is hard to find x_1,���,x_t such that ���(x_1,���,x_t,h(x���),���,h(x_t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8d2adabf5dc39392efc71ef11c62ba7a
Publikováno v:
Other repository
© 2019, International Association for Cryptologic Research. Middle-product learning with errors (MP-LWE) was recently introduced by Rosca, Sakzad, Steinfeld and Stehlé (CRYPTO 2017) as a way to combine the efficiency of Ring-LWE with the more robus
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od________88::c3f14ee0eb1e8b676262ba8536a8052f
https://hdl.handle.net/1721.1/137219
https://hdl.handle.net/1721.1/137219
Autor:
Lombardi, Alex, Vaikuntanathan, Vinod
Publikováno v:
Other repository
© 2017, International Association for Cryptologic Research. Lin and Tessaro (ePrint 2017) recently proposed indistinguishability obfuscation (IO) and functional encryption (FE) candidates and proved their security based on two assumptions: a standar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od________88::bfdb42bf1f275be622a9f29329b59c1e
https://hdl.handle.net/1721.1/137870.2
https://hdl.handle.net/1721.1/137870.2