Invited Talk.- Which e-voting problems do we need to solve?.- Award Papers.- On the Possibility of Basing Cryptography on EXP6 ≠ BPP.- Linear Cryptanalysis of FF3-1 and FEA.- Efficient Key Recovery for all HFE Signature Variants.- Three Halves Make a Whole? Beating the Half-Gates Lower Bound for Garbled Circuits.- Signatures.- Threshold Schnorr with Stateless Deterministic Signing from Standard Assumptions.- Two-Round Trip Schnorr Multi-Signatures via Delinearized Witnesses.- MuSig2: Simple Two-Round Schnorr Multi-Signatures.- Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for Σ-Protocols.- DualRing: Generic Construction of Ring Signatures with Efficient Instantiations.- Compact Ring Signatures from Learning With Errors.- Quantum Cryptography.- A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Rounds.- On the Concurrent Composition of Quantum Zero-Knowledge.- Multi-theorem Designated-Verifier NIZK for QMA.- On the Round Complexity of Secure Quantum Computation.- Round Efficient Secure Multiparty Quantum Computation with Identifiable Abort.- One-Way Functions Imply Secure Computation in a Quantum World.- Impossibility of Quantum Virtual Black-Box Obfuscation of Classical Circuits.- New Approaches for Quantum Copy-Protection.- Hidden Cosets and Applications to Unclonable Cryptography.- On Tight Quantum Security of HMAC and NMAC in the Quantum Random Oracle Model.- Quantum Collision Attacks on Reduced SHA-256 and SHA-512.- Succinct Arguments.- Halo Infinite: Proof-Carrying Data from Additive Polynomial Commitments.- Proof-Carrying Data without Succinct Arguments.- Subquadratic SNARGs in the Random Oracle Model.- Sumcheck Arguments and their Applications.- An Algebraic Framework for Universal and Updatable SNARKs.