Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Lombardi, Alex
129  Ergebnisse:
Personensuche X
?
1

A One-Query Lower Bound for Unitary Synthesis and Breaking ..:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,
Lombardi, Alex ; Ma, Fermi ; Wright, John - p. 979-990 , 2024
Link: https://dl.acm.org/doi/1..
 
?
2

SNARGs under LWE via Propositional Proofs:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,
Jin, Zhengzhong ; Kalai, Yael ; Lombardi, Alex. - p. 1750-1757 , 2024
Link: https://dl.acm.org/doi/1..
 
?
3

Quantum Advantage from Any Non-local Game:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,
Kalai, Yael ; Lombardi, Alex ; Vaikuntanathan, Vinod. - p. 1617-1628 , 2023
Link: https://dl.acm.org/doi/1..
 
?
4

SNARGs and PPAD Hardness from the Decisional Diffie-Hellman..:

, In: Advances in Cryptology – EUROCRYPT 2023; Lecture Notes in Computer Science,
Kalai, Yael Tauman ; Lombardi, Alex ; Vaikuntanathan, Vinod - p. 470-498 , 2023
Link: https://doi.org/10.1007/..
 
?
5

Boosting Batch Arguments and RAM Delegation:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,
Kalai, Yael ; Lombardi, Alex ; Vaikuntanathan, Vinod. - p. 1545-1552 , 2023
Link: https://dl.acm.org/doi/1..
 
?
6

SNARGs for Monotone Policy Batch NP:

, In: Advances in Cryptology – CRYPTO 2023; Lecture Notes in Computer Science,
Brakerski, Zvika ; Brodsky, Maya Farber ; Kalai, Yael Tauman.. - p. 252-283 , 2023
Link: https://doi.org/10.1007/..
 
?
7

Post-quantum Insecurity from LWE:

, In: Theory of Cryptography; Lecture Notes in Computer Science,
Lombardi, Alex ; Mook, Ethan ; Quach, Willy. - p. 3-32 , 2022
Link: https://doi.org/10.1007/..
 
?
8

Succinct Classical Verification of Quantum Computation:

, In: Advances in Cryptology – CRYPTO 2022; Lecture Notes in Computer Science,
Bartusek, James ; Kalai, Yael Tauman ; Lombardi, Alex... - p. 195-211 , 2022
Link: https://doi.org/10.1007/..
 
?
9

PPAD is as Hard as LWE and Iterated Squaring:

, In: Theory of Cryptography; Lecture Notes in Computer Science,
Bitansky, Nir ; Choudhuri, Arka Rai ; Holmgren, Justin... - p. 593-622 , 2022
Link: https://doi.org/10.1007/..
 
?
10

Post-Quantum Zero Knowledge, Revisited or: How to Do Quantu..:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),
Lombardi, Alex ; Ma, Fermi ; Spooner, Nicholas - p. 851-859 , 2022
Link: https://doi.org/10.1109/..
 
?
11

Does Fiat-Shamir Require a Cryptographic Hash Function?:

, In: Advances in Cryptology – CRYPTO 2021; Lecture Notes in Computer Science,
Chen, Yilei ; Lombardi, Alex ; Ma, Fermi. - p. 334-363 , 2021
Link: https://doi.org/10.1007/..
 
?
12

Fiat–Shamir via list-recoverable codes (or: parallel repeti..:

, In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing,
Holmgren, Justin ; Lombardi, Alex ; Rothblum, Ron D. - p. 750-760 , 2021
Link: https://dl.acm.org/doi/1..
 
?
13

Fiat-Shamir for Repeated Squaring with Applications to PPAD..:

, In: Advances in Cryptology – CRYPTO 2020; Lecture Notes in Computer Science,
Lombardi, Alex ; Vaikuntanathan, Vinod - p. 632-651 , 2020
Link: https://doi.org/10.1007/..
 
?
14

Statistical ZAPR Arguments from Bilinear Maps:

, In: Advances in Cryptology – EUROCRYPT 2020; Lecture Notes in Computer Science,
Lombardi, Alex ; Vaikuntanathan, Vinod ; Wichs, Daniel - p. 620-641 , 2020
Link: https://doi.org/10.1007/..
 
?
15

New Constructions of Reusable Designated-Verifier NIZKs:

, In: Advances in Cryptology – CRYPTO 2019; Lecture Notes in Computer Science,
Lombardi, Alex ; Quach, Willy ; Rothblum, Ron D... - p. 670-700 , 2019
Link: https://doi.org/10.1007/..
 
1-15