~/talks

Alex Lombardi

what they talk about

where they keep going back

no series more than once — all 6 in the filters

on a stage with

who talks about the same things

nobody close enough yet

titleconferencedate
Talk by Alex Lombardi (Princeton University)Proofs (Simons Institute)2025-07-11
Provides a concrete path for when Fiat–Shamir is provably safe in the standard model: if the starting protocol has information-theoretic soundness and the hash…
Talk on
Are Random Quantum Circuits PRUs?Summer Cluster on Quantum Computing 20252025-07-07
Claims that random brickwork circuits are PRUs assuming no efficient algorithm can exactly learn a random circuit’s depth; proves a conditional reduction: if…
Talk on
Beyond P versus NP: Using Complexity Theory in Obfuscation and Vice-VersaObfuscation2025-06-23
Claim: iO plus stronger-than-P≠NP complexity assumptions yields cryptographic objects whose hardness matches naive attacks. Techniques combine…
Talk on
To interact or not to interact: Cryptographic proof systems and the Fiat-Shamir heuristicCryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 20252025-05-19
Shows that zero-knowledge proofs for every NP language follow from one-way functions and that succinct arguments for NP use collision-resistant or vector…
Talk on
Quantum Rewinding Tutorial, Part 1: Motivation and Early Rewinding TechniquesQuantum and Lattices Joint Reunion Workshop2022-06-13
Proves that Blum’s Hamiltonian-cycle protocol achieves post-quantum soundness and zero knowledge assuming collapse-binding commitments (instantiable from LWE…
Talk on
Quantum Rewinding Tutorial, Part 2: How to Run a Quantum Attacker Many TimesQuantum and Lattices Joint Reunion Workshop2022-06-13
Shows a concrete alternating projectors procedure that repairs a measured quantum prover by alternating the challenge projector Pi_R with a projector…
Talk on
Quantum Rewinding Tutorial, Part 3: Zero Knowledge Simulation Beyond WatrousQuantum and Lattices Joint Reunion Workshop2022-06-13
Claims a constructive simulator that achieves guaranteed extraction of witnesses for three‑message proofs against quantum verifiers and then preserves the…
Talk on
Correlation-Intractable Hash Functions via Shift-HidingITCS 20222022-01-31
Gives a simple self-reduction showing that a shift-hiding PRF that is one-way on the zero output yields correlation-intractable hash families for many…
Talk on
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.