Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Dall'Agnol, Marcel"'
Streaming interactive proofs (SIPs) enable a space-bounded algorithm with one-pass access to a massive stream of data to verify a computation that requires large space, by communicating with a powerful but untrusted prover. This work initiates the st
Externí odkaz:
http://arxiv.org/abs/2301.02161
Publikováno v:
Quantum 6, 834 (2022)
We initiate the systematic study of QMA algorithms in the setting of property testing, to which we refer as QMA proofs of proximity (QMAPs). These are quantum query algorithms that receive explicit access to a sublinear-size untrusted proof and are r
Externí odkaz:
http://arxiv.org/abs/2105.03697
Publikováno v:
SIAM J. Comput., 52 (2023), pp. 1413-1463
We prove a general structural theorem for a wide family of local algorithms, which includes property testers, local decoders, and PCPs of proximity. Namely, we show that the structure of every algorithm that makes $q$ adaptive queries and satisfies a
Externí odkaz:
http://arxiv.org/abs/2010.04985
Autor:
DALL'AGNOL, MARCEL1 msagnol@pm.me, GUR, TOM1 tom.gur@warwick.ac.uk, LACHISH, ODED2 oded@dcs.bbk.ac.uk
Publikováno v:
SIAM Journal on Computing. 2023, Vol. 52 Issue 6, p1413-1463. 51p.
Autor:
Dall'Agnol, Marcel, Spooner, Nicholas
Collapse binding and collapsing were proposed by Unruh (Eurocrypt '16) as post-quantum strengthenings of computational binding and collision resistance, respectively. These notions have been very successful in facilitating the "lifting" of classical
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dbfc3384bea00507146f8bae546b9a0d
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:
Elette Boyle, Mohammad Mahmoody
The four-volume set LNCS 15364-15367 constitutes the refereed proceedings of the 22nd International Conference on Theory of Cryptography, TCC 2024, held in Milan, Italy, in December 2024. The total of 68 full papers presented in the proceedings was c