Volgen
Alex Lombardi
Alex Lombardi
Geverifieerd e-mailadres voor mit.edu - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
Fiat-Shamir: from practice to theory
R Canetti, Y Chen, J Holmgren, A Lombardi, GN Rothblum, RD Rothblum, ...
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
1052019
Anonymous IBE, leakage resilience and circular security from new assumptions
Z Brakerski, A Lombardi, G Segev, V Vaikuntanathan
Annual International Conference on the Theory and Applications of …, 2018
842018
Cryptographic hashing from strong one-way functions (or: One-way product functions and their applications)
J Holmgren, A Lombardi
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
572018
Fiat-Shamir From Simpler Assumptions.
R Canetti, Y Chen, J Holmgren, A Lombardi, GN Rothblum, RD Rothblum
IACR Cryptology ePrint Archive 2018, 1004, 2018
412018
New constructions of reusable designated-verifier NIZKs
A Lombardi, W Quach, RD Rothblum, D Wichs, DJ Wu
Annual International Cryptology Conference, 670-700, 2019
312019
Fiat-Shamir: from practice to theory, part II (NIZK and correlation intractability from circular-secure FHE)
R Canetti, A Lombardi, D Wichs
IACR Cryptology ePrint Archive 2018: 1248, 2018
30*2018
Limits on the locality of pseudorandom generators and applications to indistinguishability obfuscation
A Lombardi, V Vaikuntanathan
Theory of Cryptography Conference, 119-137, 2017
30*2017
Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
A Lombardi, V Vaikuntanathan
Annual International Cryptology Conference, 632-651, 2020
222020
A Note on Key Agreement and Non-Interactive Commitments.
A Lombardi, L Schaeffer
IACR Cryptology ePrint Archive 2019, 279, 2019
192019
Does Fiat-Shamir Require a Cryptographic Hash Function?
Y Chen, A Lombardi, F Ma, W Quach
Annual International Cryptology Conference, 2021
142021
Statistical ZAPR arguments from bilinear maps
A Lombardi, V Vaikuntanathan, D Wichs
Annual International Conference on the Theory and Applications of …, 2020
132020
Succinct garbling schemes from functional encryption through a local simulation paradigm
P Ananth, A Lombardi
Theory of Cryptography Conference, 455-472, 2018
122018
Fiat–Shamir via List-Recoverable Codes (or: Parallel Repetition of GMW is not Zero-Knowledge)
J Holmgren, A Lombardi, RD Rothblum
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
92021
2-Message Publicly Verifiable WI from (Subexponential) LWE
A Lombardi, V Vaikuntanathan, D Wichs
IACR Cryptology ePrint Archive 2019, 808, 2019
92019
Post-Quantum Zero Knowledge, Revisited (or: How to Do Quantum Rewinding Undetectably)
A Lombardi, F Ma, N Spooner
IACR Cryptology ePrint Archive 2021/1543, 2021
82021
Lattice Trapdoors and IBE from Middle-Product LWE
A Lombardi, V Vaikuntanathan, TD Vuong
Theory of Cryptography Conference, 24-54, 2019
72019
Minimizing the Complexity of Goldreich's Pseudorandom Generator.
A Lombardi, V Vaikuntanathan
IACR Cryptology ePrint Archive 2017, 277, 2017
62017
Correlation-Intractable Hash Functions via Shift-Hiding.
A Lombardi, V Vaikuntanathan
IACR Cryptology ePrint Archive 2020 (2020/1378), 1378, 2020
42020
Quantum Advantage from Any Non-Local Game
YT Kalai, A Lombardi, V Vaikuntanathan, L Yang
Cryptology ePrint Archive, 2022
12022
Succinct Classical Verification of Quantum Computation
J Bartusek, YT Kalai, A Lombardi, F Ma, G Malavolta, V Vaikuntanathan, ...
arXiv preprint arXiv:2206.14929, 2022
2022
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20