Site updated: 2023-10-27 19:07:30

2023/10/06/Algorithm-Design-2/index.html

@@ -29,8 +29,8 @@
 <meta property="article:author" content="ZigZagKmp">
 <meta property="article:tag" content="算法">
 <meta property="article:tag" content="算法-搜索">
-<meta property="article:tag" content="算法-强连通分量(SCC)">
 <meta property="article:tag" content="算法-贪心">
+<meta property="article:tag" content="算法-强连通分量(SCC)">
 <meta name="twitter:card" content="summary">
 
 
@@ -648,8 +648,8 @@ <h3 id="shortest-path-without-w0">2.3. Shortest Path (without <span
           <div class="post-tags">
               <a href="/tags/%E7%AE%97%E6%B3%95/" rel="tag"># 算法</a>
               <a href="/tags/%E7%AE%97%E6%B3%95-%E6%90%9C%E7%B4%A2/" rel="tag"># 算法-搜索</a>
-              <a href="/tags/%E7%AE%97%E6%B3%95-%E5%BC%BA%E8%BF%9E%E9%80%9A%E5%88%86%E9%87%8F-SCC/" rel="tag"># 算法-强连通分量(SCC)</a>
               <a href="/tags/%E7%AE%97%E6%B3%95-%E8%B4%AA%E5%BF%83/" rel="tag"># 算法-贪心</a>
+              <a href="/tags/%E7%AE%97%E6%B3%95-%E5%BC%BA%E8%BF%9E%E9%80%9A%E5%88%86%E9%87%8F-SCC/" rel="tag"># 算法-强连通分量(SCC)</a>
           </div>
 
 

2023/10/06/ZKP-and_MPC-1/index.html

@@ -25,7 +25,7 @@
 <meta property="og:site_name" content="ZigZagKmp&#39;s Blog">
 <meta property="og:locale" content="zh_CN">
 <meta property="article:published_time" content="2023-10-06T13:27:23.000Z">
-<meta property="article:modified_time" content="2023-10-15T12:48:36.456Z">
+<meta property="article:modified_time" content="2023-10-27T11:05:15.721Z">
 <meta property="article:author" content="ZigZagKmp">
 <meta property="article:tag" content="密码学">
 <meta property="article:tag" content="密码学-零知识证明">
@@ -301,7 +301,7 @@ <h1 class="post-title" itemprop="name headline">
         <i class="far fa-calendar-check"></i>
       </span>
       <span class="post-meta-item-text">更新于</span>
-      <time title="修改时间：2023-10-15 20:48:36" itemprop="dateModified" datetime="2023-10-15T20:48:36+08:00">2023-10-15</time>
+      <time title="修改时间：2023-10-27 19:05:15" itemprop="dateModified" datetime="2023-10-27T19:05:15+08:00">2023-10-27</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
@@ -725,10 +725,15 @@ <h3 id="ip-examples">3 IP Examples</h3>
 \]</span> <span class="math inline">\(k\)</span> rounds : <span
 class="math inline">\(\Pr\{V \text{ accepts}\}\le\frac{1}{2^k}\)</span>
 .</p></li>
-<li><p>Zero-knowledge : NOT zero-knowledge</p>
+<li><p>Zero-knowledge : <strong>NOT (dishonest-verifier)
+zero-knowledge</strong></p>
 <p><span class="math inline">\(V\)</span> knows <span
 class="math inline">\(h^{-1}(y)\)</span> , which cannot be computed in
-poly-time by itself .</p></li>
+poly-time by itself .</p>
+<blockquote>
+<p>This is still <strong>honest-verifier zero-knowledge</strong> , see
+homework 1</p>
+</blockquote></li>
 </ol></li>
 <li><p>Notes</p>
 <blockquote>

2023/10/16/ZKP-and-MPC-3/index.html

@@ -25,7 +25,7 @@
 <meta property="og:site_name" content="ZigZagKmp&#39;s Blog">
 <meta property="og:locale" content="zh_CN">
 <meta property="article:published_time" content="2023-10-16T10:45:49.000Z">
-<meta property="article:modified_time" content="2023-10-16T13:51:46.529Z">
+<meta property="article:modified_time" content="2023-10-27T11:06:31.669Z">
 <meta property="article:author" content="ZigZagKmp">
 <meta property="article:tag" content="密码学">
 <meta property="article:tag" content="密码学-证明复合">
@@ -151,9 +151,9 @@
             <div class="post-toc animated"><ol class="nav"><li class="nav-item nav-level-2"><a class="nav-link" href="#lec02-zero-knowledge-proof-under-composition"><span class="nav-number">1.</span> <span class="nav-text">Lec02
 Zero-Knowledge Proof under Composition</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#sequential-composition"><span class="nav-number">1.1.</span> <span class="nav-text">2.3 Sequential Composition</span></a><ol class="nav-child"><li class="nav-item nav-level-4"><a class="nav-link" href="#construction"><span class="nav-number">1.1.1.</span> <span class="nav-text">Construction</span></a></li><li class="nav-item nav-level-4"><a class="nav-link" href="#proof-of-mxzequiv-braketpyvzx"><span class="nav-number">1.1.2.</span> <span class="nav-text">Proof of \(M^*(x,z)\equiv
 \braket{P(y),V^*(z)}(x)\)</span></a></li></ol></li></ol></li><li class="nav-item nav-level-2"><a class="nav-link" href="#lec03-commitment-scheme-zk-proof-for-general-np"><span class="nav-number">2.</span> <span class="nav-text">Lec03
-Commitment Scheme , zk-proof for general NP</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#commitment"><span class="nav-number">2.1.</span> <span class="nav-text">3.1 Commitment</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#perfect-binding-computationally-hiding-commitment"><span class="nav-number">2.2.</span> <span class="nav-text">3.2 Perfect
-Binding &amp; Computationally Hiding Commitment</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#computationally-binding-perfect-hiding-commitment"><span class="nav-number">2.3.</span> <span class="nav-text">3.3
-Computationally Binding &amp; Perfect Hiding Commitment</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#general-np-problem"><span class="nav-number">2.4.</span> <span class="nav-text">3.4 General NP Problem</span></a></li></ol></li></ol></div>
+Commitment Scheme , zk-proof for general NP</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#important"><span class="nav-number">2.1.</span> <span class="nav-text">3.0 Important</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#commitment"><span class="nav-number">2.2.</span> <span class="nav-text">3.1 Commitment</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#perfect-binding-computationally-hiding-commitment"><span class="nav-number">2.3.</span> <span class="nav-text">3.2 Perfect
+Binding &amp; Computationally Hiding Commitment</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#computationally-binding-perfect-hiding-commitment"><span class="nav-number">2.4.</span> <span class="nav-text">3.3
+Computationally Binding &amp; Perfect Hiding Commitment</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#general-np-problem"><span class="nav-number">2.5.</span> <span class="nav-text">3.4 General NP Problem</span></a></li></ol></li></ol></div>
         </div>
         <!--/noindex-->
 
@@ -300,9 +300,15 @@ <h1 class="post-title" itemprop="name headline">
         <i class="far fa-calendar"></i>
       </span>
       <span class="post-meta-item-text">发表于</span>
-
 
-      <time title="创建时间：2023-10-16 18:45:49 / 修改时间：21:51:46" itemprop="dateCreated datePublished" datetime="2023-10-16T18:45:49+08:00">2023-10-16</time>
+      <time title="创建时间：2023-10-16 18:45:49" itemprop="dateCreated datePublished" datetime="2023-10-16T18:45:49+08:00">2023-10-16</time>
+    </span>
+    <span class="post-meta-item">
+      <span class="post-meta-item-icon">
+        <i class="far fa-calendar-check"></i>
+      </span>
+      <span class="post-meta-item-text">更新于</span>
+      <time title="修改时间：2023-10-27 19:06:31" itemprop="dateModified" datetime="2023-10-27T19:06:31+08:00">2023-10-27</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">
@@ -499,6 +505,9 @@ <h4 id="proof-of-mxzequiv-braketpyvzx">Proof of <span
 </ol>
 <h2 id="lec03-commitment-scheme-zk-proof-for-general-np">Lec03
 Commitment Scheme , zk-proof for general NP</h2>
+<h3 id="important">3.0 Important</h3>
+<p><strong><em>In the next lecture , we re-defined commitment in a more
+simple way .</em></strong></p>
 <h3 id="commitment">3.1 Commitment</h3>
 <blockquote>
 <p>Intuition :</p>

index.html

@@ -365,9 +365,15 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-calendar"></i>
       </span>
       <span class="post-meta-item-text">发表于</span>
-
 
-      <time title="创建时间：2023-10-16 18:45:49 / 修改时间：21:51:46" itemprop="dateCreated datePublished" datetime="2023-10-16T18:45:49+08:00">2023-10-16</time>
+      <time title="创建时间：2023-10-16 18:45:49" itemprop="dateCreated datePublished" datetime="2023-10-16T18:45:49+08:00">2023-10-16</time>
+    </span>
+    <span class="post-meta-item">
+      <span class="post-meta-item-icon">
+        <i class="far fa-calendar-check"></i>
+      </span>
+      <span class="post-meta-item-text">更新于</span>
+      <time title="修改时间：2023-10-27 19:06:31" itemprop="dateModified" datetime="2023-10-27T19:06:31+08:00">2023-10-27</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">

page/2/index.html

@@ -379,7 +379,7 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-calendar-check"></i>
       </span>
       <span class="post-meta-item-text">更新于</span>
-      <time title="修改时间：2023-10-15 20:48:36" itemprop="dateModified" datetime="2023-10-15T20:48:36+08:00">2023-10-15</time>
+      <time title="修改时间：2023-10-27 19:05:15" itemprop="dateModified" datetime="2023-10-27T19:05:15+08:00">2023-10-27</time>
     </span>
     <span class="post-meta-item">
       <span class="post-meta-item-icon">

search.xml

@@ -512,6 +512,9 @@ Hyb_i\)</span></p></li>
 </ol>
 <h2 id="lec03-commitment-scheme-zk-proof-for-general-np">Lec03
 Commitment Scheme , zk-proof for general NP</h2>
+<h3 id="important">3.0 Important</h3>
+<p><strong><em>In the next lecture , we re-defined commitment in a more
+simple way .</em></strong></p>
 <h3 id="commitment">3.1 Commitment</h3>
 <blockquote>
 <p>Intuition :</p>
@@ -3672,10 +3675,15 @@ convince verifier , so <span class="math display">\[
 \]</span> <span class="math inline">\(k\)</span> rounds : <span
 class="math inline">\(\Pr\{V \text{ accepts}\}\le\frac{1}{2^k}\)</span>
 .</p></li>
-<li><p>Zero-knowledge : NOT zero-knowledge</p>
+<li><p>Zero-knowledge : <strong>NOT (dishonest-verifier)
+zero-knowledge</strong></p>
 <p><span class="math inline">\(V\)</span> knows <span
 class="math inline">\(h^{-1}(y)\)</span> , which cannot be computed in
-poly-time by itself .</p></li>
+poly-time by itself .</p>
+<blockquote>
+<p>This is still <strong>honest-verifier zero-knowledge</strong> , see
+homework 1</p>
+</blockquote></li>
 </ol></li>
 <li><p>Notes</p>
 <blockquote>
@@ -4150,8 +4158,8 @@ class="math inline">\(dist(p)&lt;dist(p&#39;)=d(u)+l_e\)</span> , so
       <tags>
         <tag>算法</tag>
         <tag>算法-搜索</tag>
-        <tag>算法-强连通分量(SCC)</tag>
         <tag>算法-贪心</tag>
+        <tag>算法-强连通分量(SCC)</tag>
       </tags>
   </entry>
   <entry>