Alex Lombardi

According to our database1, Alex Lombardi authored at least 29 papers between 2017 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
A one-query lower bound for unitary synthesis and breaking quantum cryptography.
IACR Cryptol. ePrint Arch., 2023

SNARGs for Monotone Policy Batch NP.
IACR Cryptol. ePrint Arch., 2023

2022
Post-Quantum Insecurity from LWE.
IACR Cryptol. ePrint Arch., 2022

Quantum Advantage from Any Non-Local Game.
IACR Cryptol. ePrint Arch., 2022

Boosting Batch Arguments and RAM Delegation.
IACR Cryptol. ePrint Arch., 2022

SNARGs and PPAD Hardness from the Decisional Diffie-Hellman Assumption.
IACR Cryptol. ePrint Arch., 2022

PPAD is as Hard as LWE and Iterated Squaring.
IACR Cryptol. ePrint Arch., 2022

Succinct Classical Verification of Quantum Computation.
IACR Cryptol. ePrint Arch., 2022

Correlation-Intractable Hash Functions via Shift-Hiding.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021
Post-Quantum Zero Knowledge, Revisited (or: How to Do Quantum Rewinding Undetectably).
Electron. Colloquium Comput. Complex., 2021

Fiat-Shamir via List-Recoverable Codes (or: Parallel Repetition of GMW is not Zero-Knowledge).
Electron. Colloquium Comput. Complex., 2021

2020
Statistical ZAPR Arguments from Bilinear Maps.
IACR Cryptol. ePrint Arch., 2020

Multi-Input Correlation-Intractable Hash Functions via Shift-Hiding.
IACR Cryptol. ePrint Arch., 2020

Fiat-Shamir for Repeated Squaring with Applications to PPAD-Hardness and VDFs.
IACR Cryptol. ePrint Arch., 2020

Does Fiat-Shamir Require a Cryptographic Hash Function?
IACR Cryptol. ePrint Arch., 2020

2019
2-Message Publicly Verifiable WI from (Subexponential) LWE.
IACR Cryptol. ePrint Arch., 2019

Lattice Trapdoors and IBE from Middle-Product LWE.
IACR Cryptol. ePrint Arch., 2019

A Note on Key Agreement and Non-Interactive Commitments.
IACR Cryptol. ePrint Arch., 2019

New Constructions of Reusable Designated-Verifier NIZKs.
IACR Cryptol. ePrint Arch., 2019

Fiat-Shamir: from practice to theory.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

2018
Cryptographic Hashing From Strong One-Way Functions.
IACR Cryptol. ePrint Arch., 2018

Non-Interactive Zero Knowledge and Correlation Intractability from Circular-Secure FHE.
IACR Cryptol. ePrint Arch., 2018

Fiat-Shamir From Simpler Assumptions.
IACR Cryptol. ePrint Arch., 2018

Succinct Garbling Schemes from Functional Encryption through a Local Simulation Paradigm.
IACR Cryptol. ePrint Arch., 2018

Cryptographic Hashing from Strong One-Way Functions (Or: One-Way Product Functions and Their Applications).
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017
On the Non-Existence of Blockwise 2-Local PRGs with Applications to Indistinguishability Obfuscation.
IACR Cryptol. ePrint Arch., 2017

Minimizing the Complexity of Goldreich's Pseudorandom Generator.
IACR Cryptol. ePrint Arch., 2017

Anonymous IBE, Leakage Resilience and Circular Security from New Assumptions.
IACR Cryptol. ePrint Arch., 2017

Limits on the Locality of Pseudorandom Generators and Applications to Indistinguishability Obfuscation.
Proceedings of the Theory of Cryptography - 15th International Conference, 2017


  Loading...