Advances in Cryptology – ASIACRYPT 2021

Chapter 1 Lunar : A Toolbox for More Efficient Universal and Updatable zkSNARKs and Commit-and-Prove Extensions

Chapter 2 Gentry-Wichs is Tight: a Falsifiable Non-adaptively Sound SNARG

Chapter 3 Proofs for Inner Pairing Products and Applications

Chapter 4 Snarky Ceremonies

Chapter 5 Efficient NIZKs for Algebraic Sets

Chapter 6 Bit Security as Computational Cost for Winning Games with High Probability

Chapter 7 Giving an Adversary Guarantees (Or: How to Model Designated Verifier Signatures in a Composable Framework)

Chapter 9 Beyond Software Watermarking: Traitor-Tracing for Pseudorandom Functions

Chapter 10 Batching Base Oblivious Transfers

Chapter 11 Algebraic Adversaries in the Universal Composability Framework

Chapter 12 Luby-Rackoff Backwards with More Users and More Security

Chapter 13 Double-Block-Length Hash Function for Minimum Memory Size

Chapter 14 Toward a Fully Secure Authenticated Encryption Scheme from a Pseudorandom Permutation

Chapter 16 FAST: Secure and High Performance Format-Preserving Encryption and Tokenization

Chapter 17 Fine-Tuning the ISO/IEC Standard LightMAC

Chapter 18 Categorization of Faulty Nonce Misuse Resistant Message Authentication

Chapter 19 Balanced Non-adjacent Forms

Chapter 20 Efficient Boolean Search over Encrypted Data with Reduced Leakage

Chapter 22 Transciphering Framework for Approximate Homomorphic Encryption

Chapter 23 Improved Programmable Bootstrapping with Larger Precision and Efficient Arithmetic Circuits for TFHE