| 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 | 74 | 2019 |
| 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 | 65 | 2018 |
| 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 | 46 | 2018 |
| Fiat-Shamir From Simpler Assumptions. R Canetti, Y Chen, J Holmgren, A Lombardi, GN Rothblum, RD Rothblum IACR Cryptology ePrint Archive 2018, 1004, 2018 | 36 | 2018 |
| 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 | 28* | 2018 |
| New constructions of reusable designated-verifier NIZKs A Lombardi, W Quach, RD Rothblum, D Wichs, DJ Wu Annual International Cryptology Conference, 670-700, 2019 | 27 | 2019 |
| Limits on the locality of pseudorandom generators and applications to indistinguishability obfuscation A Lombardi, V Vaikuntanathan Theory of Cryptography Conference, 119-137, 2017 | 23* | 2017 |
| Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs A Lombardi, V Vaikuntanathan Annual International Cryptology Conference, 632-651, 2020 | 14 | 2020 |
| A Note on Key Agreement and Non-Interactive Commitments. A Lombardi, L Schaeffer IACR Cryptology ePrint Archive 2019, 279, 2019 | 11 | 2019 |
| Statistical ZAPR arguments from bilinear maps A Lombardi, V Vaikuntanathan, D Wichs Annual International Conference on the Theory and Applications of …, 2020 | 9 | 2020 |
| 2-Message Publicly Verifiable WI from (Subexponential) LWE A Lombardi, V Vaikuntanathan, D Wichs IACR Cryptology ePrint Archive 2019, 808, 2019 | 9 | 2019 |
| Succinct garbling schemes from functional encryption through a local simulation paradigm P Ananth, A Lombardi Theory of Cryptography Conference, 455-472, 2018 | 8 | 2018 |
| Minimizing the Complexity of Goldreich's Pseudorandom Generator. A Lombardi, V Vaikuntanathan IACR Cryptology ePrint Archive 2017, 277, 2017 | 6 | 2017 |
| Multi-Input Correlation-Intractable Hash Functions via Shift-Hiding. A Lombardi, V Vaikuntanathan IACR Cryptol. ePrint Arch. 2020, 1378, 2020 | 4 | 2020 |
| Does Fiat-Shamir Require a Cryptographic Hash Function? Y Chen, A Lombardi, F Ma, W Quach | 4 | 2020 |
| Lattice Trapdoors and IBE from Middle-Product LWE A Lombardi, V Vaikuntanathan, TD Vuong Theory of Cryptography Conference, 24-54, 2019 | 4 | 2019 |
| 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 | 2 | 2021 |
| Low complexity pseudorandom generators and indistinguishability obfuscation AJ Lombardi Massachusetts Institute of Technology, 2018 | | 2018 |
Vinod VaikuntanathanProfessor of Computer Science, Massachusetts Institute of TechnologyGeverifieerd e-mailadres voor csail.mit.edu
