Writing

A read-only Turing Machine is equivalent to a Finite-state Machine.

Slides for Group Seminars

A Visit in Crypto Dark Matter: A brief survey of cryptanalysis about the Dark Matter of Cryptography, which use alternating modulus patterns or constant-noise LPN to build wPRF, PRG and OWF.
Construction of Hidden Bits Generator: Review the construction of HBG from CDH assumption. What if fitting LPN into CDH framework? And a naive tentative try assuming too ideal functionality.
From Hidden Bits Generator to NIZKs: Exploring techniques of constructing NIZKs from Hidden Bits Generator (HBG) without Random Oracle or Correlation Intractability & learning about construction of HBG from LWE trapdoors. Awful presentation, needing more understanding.
LPN Codes for PCG and PCF: survey for MPC-friendly LPN variants, including EA-code and EC-code, which are used for building MPC protocols like PCG. So many heuristic analyses for the security!

SABER and Why it was beaten : Review the SABER post-quantum KEM and its security proof, trying to figure out why this smart and elegant Mod-LWR scheme was beaten by CRYSTALS-KYBER.
How does a Lasso work?: A brief introduction to the Lasso lookup argument, which is possibly the first step towards the lookup-sigularity in SNARKs.