6️⃣ 📝 add Lecture 6 materials

index.html

@@ -60,6 +60,68 @@ <h1 class="section-header"> About </h1>
         <div class="lectures-block">
             <h1 class="section-header"> Lectures </h1>
 
+            <!-- Lecture 6 -->
+            <div class="lecture-card">
+                <div class="lecture-card-head">
+                    <div class="lecture-card-preview">
+                        <img src="images/lecture-previews/lecture_6.png" class="preview">
+                    </div>
+                    <div class="lecture-card-content">
+                        <div class="lecture-card-header">
+                            <h2 class="lecture-card-title"> Lecture 6: Introduction to Zero-Knowledge Proofs </h2>
+                            <p class="lecture-card-speaker"> <strong>Speaker:</strong> Dmytro Zakharov </p>
+                        </div>
+
+                        <div class="lecture-card-content">
+                            <p class="lecture-card-description"> 
+                                <strong>Content.</strong> This lecture finally introduces the concept of Zero-Knowledge Proofs and their applications. Here, we cover:
+                                <ul>
+                                    <li> What is a cryptographic proof exactly? </li>
+                                    <li> Interactive Proofs. </li>
+                                    <li> Soundness and Zero-Knowledge definitios. </li>
+                                    <li> Proof vs Proof of Knowledge. </li>
+                                    <li> Fiat-Shamir Heuristic. </li>
+                                </ul>
+                            </p>
+                        </div>    
+                    </div>
+                </div>
+
+                <div class="lecture-links-section">
+                    <h1 class="lecture-links-header"> <strong> Lecture Material: </strong> </h1>
+
+                    <div class="lecture-links-list">
+                        <a href="files/notes/6-intro-zk.pdf" class="lecture-link">
+                            <img src="images/icons/lecture_notes_icon.png">
+                            <p class="link-name"> Lecture Notes </p>
+                        </a>
+
+                        <!-- <a href="files/slides/4-pairing.pdf" class="lecture-link">
+                            <img src="images/icons/slides_icon.png">
+                            <p class="link-name"> Slides </p>
+                        </a> -->
+
+                        <a href="files/exercises/6-intro-zk.pdf" class="lecture-link">
+                            <img src="images/icons/test.png">
+                            <p class="link-name"> Exercises </p>
+                        </a>
+
+                        <a href="https://forms.gle/h3hrk4ug6B5LAgLs6" class="lecture-link">
+                            <img src="images/icons/google_form.png">
+                            <p class="link-name"> Test Form </p>
+                        </a>
+                    </div> 
+
+                    <!-- <h1 class="lecture-links-header"> <strong> Other Helpful Resources: </strong> </h1>
+                    <ul>
+                        <li> <a href="https://static1.squarespace.com/static/5fdbb09f31d71c1227082339/t/5ff394720493bd28278889c6/1609798774687/PairingsForBeginners.pdf"> "Pairing for Beginners" </a> by Craig Costello: Not only this already mentioned book contains pairing inner working, but also a profound introduction into projective form of elliptic curves. </li>
+                        <li> <a href="https://toc.cryptobook.us/"> "A Graduate Course in Applied Cryptography" </a> by Dan Boneh and Victor Shoup, <strong>Section 15</strong> Recommended to read this chapter up to section 15.5 including. </li>
+                        <li> <a href="https://hackmd.io/@jpw/bn254"> "BN254 For The Rest of Us" </a> by Jonathan Wang: if you want specifics of pairing-friendly curve parameters, you can take a look here. This curve is currently widely used. </li>
+                        <li> <a href="https://eprint.iacr.org/2010/354.pdf"> High-Speed Software Implementation of the Optimal Ate Pairing over Barreto-Naehrig Curves </a> by Jean-Luc Beuchat et al.: if you <strong>really</strong> want to get into the details of pairing implementation, this paper is the best. It contains all the algorithms to implement pairing from scratch. </li>
+                    </ul> -->
+                </div>
+            </div>
+
             <!-- Lecture 5 -->
             <div class="lecture-card">
                 <div class="lecture-card-head">
@@ -251,7 +313,7 @@ <h1 class="lecture-links-header"> <strong> Other Helpful Resources: </strong> </
                     </div>
                     <div class="lecture-card-content">
                         <div class="lecture-card-header">
-                            <h2 class="lecture-card-title"> Lecture 2: Mathematics for Cryptography II </h2>
+                            <h2 class="lecture-card-title"> Lecture 2: Security, Polynomials, Lagrange Interpolation </h2>
                             <p class="lecture-card-speaker"> <strong>Speakers:</strong> Dmytro Zakharov and Denis Riabtsev </p>
                         </div>
 
@@ -311,7 +373,7 @@ <h1 class="lecture-links-header"> <strong> Other Helpful Resources: </strong> </
                     </div>
                     <div class="lecture-card-content">
                         <div class="lecture-card-header">
-                            <h2 class="lecture-card-title"> Lecture 1: Mathematics for Cryptography I </h2>
+                            <h2 class="lecture-card-title"> Lecture 1: Algebra Basics </h2>
                             <p class="lecture-card-speaker"> <strong>Speaker:</strong> Dmytro Zakharov </p>
                         </div>