Notes

My first note is about the CIS 2019 winter school

Unlike the two party case, currently we do not know how to construct a PCG for the multiparty (\(\geq 3\) parties) SPDZ correlation where the seed size is \(\mathsf{polylog}(N)\) bits, where \(N\) is the number of triples to be generated. The best effort has seed size \(\mathsf{poly}(p) \cdot \sqrt{N}\) where \(p\) is the number of parties. A work in PKC21 sketched the basic idea (check out my slide for this paper), and a CRYPTO25 paper improved the dependency on the number of parties to \(\mathsf{poly}(p)\) (also check out my slide for this paper.) ...

BASIC INFORMATION This is the notes of the course “Provable Security”. The first few courses will be taught online. While subsequent courses are still unsettled. I took this course last year, and I am pretty confident about my grasp of basic concepts like universal hash function, GL theorem, basic PRG, PRF constructions, etc. But contents like CRHF and PRP are still rather alien to me, so in this course I will review the previous contents and try to master the missing pieces. Also it is desireable to incopreate the previous notes and complete the notes altogegher. ...

This is my notes of the 18-19-1 course ``Computational Complexity’'. Lecture 1: Introduction Introduction This is the lecture note of Prof. Fu’s Computational Complexity (not to be confused with the Computational Complexity: Advanced Topics in the second semester). As Prof. Fu is not following strictly the structure of the book, I consider it necessary to take notes of the essential contents taught in the lectures, and subsequently organized them as a series. ...