default search action
Alex Lombardi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c22]Alex Lombardi
, Fermi Ma
A One-Query Lower Bound for Unitary Synthesis and Breaking Quantum Cryptography. STOC 2024: 979-990 - [c21]Zhengzhong Jin
SNARGs under LWE via Propositional Proofs. STOC 2024: 1750-1757 - [i32]Zhengzhong Jin, Yael Tauman Kalai, Alex Lombardi, Vinod Vaikuntanathan:
SNARGs under LWE via Propositional Proofs. IACR Cryptol. ePrint Arch. 2024: 956 (2024) - 2023
- [c20]Zvika Brakerski, Maya Farber Brodsky, Yael Tauman Kalai, Alex Lombardi, Omer Paneth:
SNARGs for Monotone Policy Batch NP. CRYPTO (2) 2023: 252-283 - [c19]Yael Tauman Kalai, Alex Lombardi, Vinod Vaikuntanathan:
SNARGs and PPAD Hardness from the Decisional Diffie-Hellman Assumption. EUROCRYPT (2) 2023: 470-498 - [c18]Yael Kalai, Alex Lombardi, Vinod Vaikuntanathan, Daniel Wichs:
Boosting Batch Arguments and RAM Delegation. STOC 2023: 1545-1552 - [c17]Yael Kalai, Alex Lombardi, Vinod Vaikuntanathan, Lisa Yang:
Quantum Advantage from Any Non-local Game. STOC 2023: 1617-1628 - [i31]Alex Lombardi, Fermi Ma, John Wright:
A one-query lower bound for unitary synthesis and breaking quantum cryptography. CoRR abs/2310.08870 (2023) - [i30]Zvika Brakerski, Maya Farber Brodsky, Yael Tauman Kalai, Alex Lombardi, Omer Paneth:
SNARGs for Monotone Policy Batch NP. IACR Cryptol. ePrint Arch. 2023: 1050 (2023) - [i29]Alex Lombardi, Fermi Ma, John Wright:
A one-query lower bound for unitary synthesis and breaking quantum cryptography. IACR Cryptol. ePrint Arch. 2023: 1602 (2023) - 2022
- [b1]Alex Lombardi:
Provable Instantiations of Correlation Intractability and the Fiat-Shamir Heuristic. MIT, USA, 2022 - [c16]James Bartusek
Succinct Classical Verification of Quantum Computation. CRYPTO (2) 2022: 195-211 - [c15]Alex Lombardi, Fermi Ma, Nicholas Spooner:
Post-Quantum Zero Knowledge, Revisited or: How to Do Quantum Rewinding Undetectably. FOCS 2022: 851-859 - [c14]Alex Lombardi, Vinod Vaikuntanathan:
Correlation-Intractable Hash Functions via Shift-Hiding. ITCS 2022: 102:1-102:16 - [c13]Alex Lombardi, Ethan Mook, Willy Quach, Daniel Wichs:
Post-quantum Insecurity from LWE. TCC (1) 2022: 3-32 - [c12]Nir Bitansky, Arka Rai Choudhuri, Justin Holmgren, Chethan Kamath
PPAD is as Hard as LWE and Iterated Squaring. TCC (2) 2022: 593-622 - [i28]Yael Kalai, Alex Lombardi, Vinod Vaikuntanathan, Lisa Yang:
Quantum Advantage from Any Non-Local Game. CoRR abs/2203.15877 (2022) - [i27]James Bartusek, Yael Tauman Kalai, Alex Lombardi, Fermi Ma, Giulio Malavolta
Succinct Classical Verification of Quantum Computation. CoRR abs/2206.14929 (2022) - [i26]Yael Tauman Kalai, Alex Lombardi, Vinod Vaikuntanathan, Lisa Yang:
Quantum Advantage from Any Non-Local Game. IACR Cryptol. ePrint Arch. 2022: 400 (2022) - [i25]James Bartusek, Yael Tauman Kalai, Alex Lombardi, Fermi Ma, Giulio Malavolta, Vinod Vaikuntanathan, Thomas Vidick, Lisa Yang:
Succinct Classical Verification of Quantum Computation. IACR Cryptol. ePrint Arch. 2022: 857 (2022) - [i24]Alex Lombardi, Ethan Mook, Willy Quach, Daniel Wichs:
Post-Quantum Insecurity from LWE. IACR Cryptol. ePrint Arch. 2022: 869 (2022) - [i23]Nir Bitansky, Arka Rai Choudhuri, Justin Holmgren
PPAD is as Hard as LWE and Iterated Squaring. IACR Cryptol. ePrint Arch. 2022: 1272 (2022) - [i22]Yael Tauman Kalai, Alex Lombardi, Vinod Vaikuntanathan, Daniel Wichs:
Boosting Batch Arguments and RAM Delegation. IACR Cryptol. ePrint Arch. 2022: 1320 (2022) - [i21]Yael Tauman Kalai, Alex Lombardi, Vinod Vaikuntanathan:
SNARGs and PPAD Hardness from the Decisional Diffie-Hellman Assumption. IACR Cryptol. ePrint Arch. 2022: 1409 (2022) - 2021
- [c11]Yilei Chen, Alex Lombardi, Fermi Ma, Willy Quach:
Does Fiat-Shamir Require a Cryptographic Hash Function? CRYPTO (4) 2021: 334-363 - [c10]Justin Holmgren
Fiat-Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge). STOC 2021: 750-760 - [i20]Alex Lombardi, Fermi Ma, Nicholas Spooner:
Post-Quantum Zero Knowledge, Revisited (or: How to Do Quantum Rewinding Undetectably). CoRR abs/2111.12257 (2021) - [i19]Justin Holmgren
Fiat-Shamir via List-Recoverable Codes (or: Parallel Repetition of GMW is not Zero-Knowledge). Electron. Colloquium Comput. Complex. TR21 (2021) - [i18]Alex Lombardi, Fermi Ma, Nicholas Spooner:
Post-Quantum Zero Knowledge, Revisited (or: How to Do Quantum Rewinding Undetectably). Electron. Colloquium Comput. Complex. TR21 (2021) - [i17]Justin Holmgren
Fiat-Shamir via List-Recoverable Codes (or: Parallel Repetition of GMW is not Zero-Knowledge). IACR Cryptol. ePrint Arch. 2021: 286 (2021) - [i16]Alex Lombardi, Fermi Ma, Nicholas Spooner:
Post-Quantum Zero Knowledge, Revisited (or: How to do Quantum Rewinding Undetectably). IACR Cryptol. ePrint Arch. 2021: 1543 (2021) - 2020
- [c9]Alex Lombardi, Vinod Vaikuntanathan:
Fiat-Shamir for Repeated Squaring with Applications to PPAD-Hardness and VDFs. CRYPTO (3) 2020: 632-651 - [c8]Alex Lombardi, Vinod Vaikuntanathan, Daniel Wichs:
Statistical ZAPR Arguments from Bilinear Maps. EUROCRYPT (3) 2020: 620-641 - [i15]Alex Lombardi, Vinod Vaikuntanathan, Daniel Wichs:
Statistical ZAPR Arguments from Bilinear Maps. IACR Cryptol. ePrint Arch. 2020: 256 (2020) - [i14]Alex Lombardi, Vinod Vaikuntanathan:
Fiat-Shamir for Repeated Squaring with Applications to PPAD-Hardness and VDFs. IACR Cryptol. ePrint Arch. 2020: 772 (2020) - [i13]Yilei Chen, Alex Lombardi, Fermi Ma, Willy Quach:
Does Fiat-Shamir Require a Cryptographic Hash Function? IACR Cryptol. ePrint Arch. 2020: 915 (2020) - [i12]Alex Lombardi, Vinod Vaikuntanathan:
Multi-Input Correlation-Intractable Hash Functions via Shift-Hiding. IACR Cryptol. ePrint Arch. 2020: 1378 (2020)
2010 – 2019
- 2019
- [c7]Alex Lombardi, Willy Quach, Ron D. Rothblum, Daniel Wichs, David J. Wu:
New Constructions of Reusable Designated-Verifier NIZKs. CRYPTO (3) 2019: 670-700 - [c6]Ran Canetti, Yilei Chen, Justin Holmgren
Fiat-Shamir: from practice to theory. STOC 2019: 1082-1090 - [c5]Alex Lombardi, Vinod Vaikuntanathan, Thuy-Duong Vuong:
Lattice Trapdoors and IBE from Middle-Product LWE. TCC (1) 2019: 24-54 - [i11]Alex Lombardi, Willy Quach, Ron D. Rothblum, Daniel Wichs, David J. Wu:
New Constructions of Reusable Designated-Verifier NIZKs. IACR Cryptol. ePrint Arch. 2019: 242 (2019) - [i10]Alex Lombardi, Luke Schaeffer:
A Note on Key Agreement and Non-Interactive Commitments. IACR Cryptol. ePrint Arch. 2019: 279 (2019) - [i9]Alex Lombardi, Vinod Vaikuntanathan, Daniel Wichs:
2-Message Publicly Verifiable WI from (Subexponential) LWE. IACR Cryptol. ePrint Arch. 2019: 808 (2019) - [i8]Alex Lombardi, Vinod Vaikuntanathan, Thuy-Duong Vuong:
Lattice Trapdoors and IBE from Middle-Product LWE. IACR Cryptol. ePrint Arch. 2019: 1067 (2019) - 2018
- [c4]Zvika Brakerski, Alex Lombardi, Gil Segev, Vinod Vaikuntanathan:
Anonymous IBE, Leakage Resilience and Circular Security from New Assumptions. EUROCRYPT (1) 2018: 535-564 - [c3]Justin Holmgren
Cryptographic Hashing from Strong One-Way Functions (Or: One-Way Product Functions and Their Applications). FOCS 2018: 850-858 - [c2]Prabhanjan Ananth, Alex Lombardi:
Succinct Garbling Schemes from Functional Encryption Through a Local Simulation Paradigm. TCC (2) 2018: 455-472 - [i7]Justin Holmgren
Cryptographic Hashing From Strong One-Way Functions. IACR Cryptol. ePrint Arch. 2018: 385 (2018) - [i6]Prabhanjan Ananth, Alex Lombardi:
Succinct Garbling Schemes from Functional Encryption through a Local Simulation Paradigm. IACR Cryptol. ePrint Arch. 2018: 759 (2018) - [i5]Ran Canetti, Yilei Chen, Justin Holmgren
Fiat-Shamir From Simpler Assumptions. IACR Cryptol. ePrint Arch. 2018: 1004 (2018) - [i4]Ran Canetti, Alex Lombardi, Daniel Wichs:
Non-Interactive Zero Knowledge and Correlation Intractability from Circular-Secure FHE. IACR Cryptol. ePrint Arch. 2018: 1248 (2018) - 2017
- [c1]Alex Lombardi, Vinod Vaikuntanathan:
Limits on the Locality of Pseudorandom Generators and Applications to Indistinguishability Obfuscation. TCC (1) 2017: 119-137 - [i3]Alex Lombardi, Vinod Vaikuntanathan:
Minimizing the Complexity of Goldreich's Pseudorandom Generator. IACR Cryptol. ePrint Arch. 2017: 277 (2017) - [i2]Alex Lombardi, Vinod Vaikuntanathan:
On the Non-Existence of Blockwise 2-Local PRGs with Applications to Indistinguishability Obfuscation. IACR Cryptol. ePrint Arch. 2017: 301 (2017) - [i1]Zvika Brakerski, Alex Lombardi, Gil Segev, Vinod Vaikuntanathan:
Anonymous IBE, Leakage Resilience and Circular Security from New Assumptions. IACR Cryptol. ePrint Arch. 2017: 967 (2017)
Coauthor Index
aka: Yael Kalai
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: