「Algebraic ECCs」: Lec4 Singleton + Plotkin Bounds and RS Code
Topics Covered:
- Singleton Bound
- Plotkin Bound
- Reed-Solomon Codes
- Dual View of RS Codes
- Generalized RS Code
「Algebraic ECCs」: Lec3 GV Bound and q-ARY Entropy
Topics Covered:
- The GV Bound:
- Efficiency and Maximum-Likelihood Decoding
- Application: McEliece Cryptosystem
- Off to Asymptopia
- Family of Codes
- q-ary Entropy
- Trade-off Between Rate and Distance
「Algebraic ECCs」: Lec2 Linear Codes and Finite Fields
Linear Algebra over $\{0, 1\}$
- Generator Matrices
- Parity-Check Matrices
Linear Algebra not Working over $\{0, 1, 2, 3\}$
Finite Fields and Linear Codes
「Algebraic ECCs」: Lec1 Basics of ECCs
Topics Covered:
- Basic problem in coding theory
- Code and codeword
- Hamming distance and minimum distance
- Rate
- Hamming bound on trade-off of the rate and distance
「Cryptography-ZKP」: Lec7 Poly-commit based on ECC
Topics:
- Poly-commit based on Error-correcting Codes
- Argument for Vector-Matrix Product
- Proximity Test
- Consistency Test
- Linear-time encodable code based on expanders
- Lossless Expander
- Recursive Encoding with constant relative distance
「Cryptography-ZKP」: Lec6 Poly-commit based on Pairing and Discret-log
Topics:
- KZG poly-commit based on bilinear pairing
- KZG scheme
- Powers-of-tau Ceremony
- Security Analysis
- Knowledge of exponent assumption
- Variants: multivariate; ZK; batch openings
- Bulletproofs poly-commit based on discrete logarithm
「Cryptography-ZKP」: Lec5-The Plonk SNARK
Topics:
- Preprocessing SNARK
- KZG Poly-Commit Scheme
- Proving Properties of committed polys
- ZeroTest
- Product Check
- Permutation Check
- Prescribed Permutation Check
- Plonk IOP for General Circuits
「Cryptography-ZKP」: Lec4-SNARKs via IP
Topics:
- Differences between Interactive Proofs and SNARKs
- Outline of SNARKs from IP
- Brief intro to Functional Commitments
- SZDL Lemma
- Multilinear Extensions
- Sum-check Protocol and its application.
- Counting Triangles
- SNARK for Circuit-satisfiability
「Cryptography-MIT6875」: Lecture 17
In this series, I will learn MIT 6.875, Foundations of Cryptography, lectured by Vinod Vaikuntanathan.
Any corrections and advice are welcome. ^ - ^
Any corrections and advice are welcome. ^ - ^
Topics Covered:
- Definition of IND-CCA Security
- Application of NIZK: Construction of CCA-secure encryption scheme
「Cryptography-MIT6875」: Lecture 16
In this series, I will learn MIT 6.875, Foundations of Cryptography, lectured by Vinod Vaikuntanathan.
Any corrections and advice are welcome. ^ - ^
Any corrections and advice are welcome. ^ - ^
Topics Covered:
- IP for Quadratic Non-Residuosity
- Non-interactive ZK
- NIZK in The Common Random String(CRS) Model
- Construction in CRS Model: Blum-Feldman-Micali’88 (quadratic residuosity)
- NIZK for QNR
- NIZK for 3SAT
- Proofs vs. Argument
Recents
