.- Foundations.
.- Impossibility of VDFs in the ROM: The Complete Picture.
.- Separating Verifiable Delay Functions and Time-Lock Puzzles.
.- Two-Server Private Information Retrieval in Sublinear Time and Quasilinear Space.
.- The Structured Generic-Group Model.
.- Tight Bounds on Uniform-Challenge Reductions from Sigma Protocols.
.- Lower Bounds on the Overhead of Indistinguishability Obfuscation.
.- Lower Bounding Update Frequency in Short Accumulators and Vector Commitments.
.- Improved Search-to-Decision Reduction for Random Local Functions.
.- Fair Multiparty Coin Tossing from Minimal Assumptions.
.- Resizable Oblivious RAM.
.- The Malice of ELFs: Practical Anamorphic-Resistant Encryption without Random Oracles.
.- Distributed Monotone-Policy Encryption for DNFs from Lattices.
.- Oblivious Ciphertext Compression via Linear Codes.
.- Lattice EPID with Efficient Revocation.
.- Partial Fraction Techniques for Cryptography.
.- DGSP: An Efficient Scalable Fully Dynamic Group Signature Scheme Using SPHINCS+.
.- Optimal Threshold Traitor Tracing.
.- Silent Threshold Cryptography from Pairings: Expressive Policies in the Plain Model.
.- Threshold Batched Identity-Based Encryption from Pairings in the Plain Model.
.- Look Ahead! Practical CCA-secure Steganography: Cover-Source Switching meets Lattice Gaussian Sampling.
.- Fully Asymmetric Anamorphic Homomorphic Encryption from LWE.