Lunar: a Toolbox for More Efficient Universal and Updatable zkSNARKs and Commit-and-Prove Extensions -- Gentry-Wichs Is Tight: A Falsifiable Non-Adaptively Sound SNARG -- Proofs for Inner Pairing Products and Applications -- Snarky Ceremonies -- Efficient NIZKs for Algebraic Sets -- Bit Security as Computational Cost for Winning Games with High Probability -- Giving an Adversary Guarantees (Or: How to Model Designated Verifier Signatures in a Composable Framework) -- How to Build a Trapdoor Function from an Encryption Scheme -- Beyond Software Watermarking: Traitor-Tracing for Pseudorandom Functions -- Batching Base Oblivious Transfers -- Algebraic Adversaries in the Universal Composability Framework -- Luby-Rackoff Backwards with More Users and More Security -- Double-Block-Length Hash Function for Minimum Memory Size -- Toward a Fully Secure Authenticated Encryption Scheme From a Pseudorandom Permutation -- Tight Security for Key-Alternating Ciphers with Correlated Sub-Keys -- FAST: Secure and High Performance Format-Preserving Encryption and Tokenization -- Fine-tuning the ISO/IEC Standard LightMAC -- Categorization of Faulty Nonce Misuse Resistant Message Authentication -- Balanced Non-Adjacent Forms -- Efficient Boolean Search over Encrypted Data with Reduced Leakage -- Revisiting Homomorphic Encryption Schemes for Finite Fields -- Transciphering Framework for Approximate Homomorphic Encryption -- Improved Programmable Bootstrapping with Larger Precision and Efficient Arithmetic Circuits for TFHE.