diff --git a/2023/10/06/Algorithm-Design-2/index.html b/2023/10/06/Algorithm-Design-2/index.html index 1fd8a5f..8f00dda 100644 --- a/2023/10/06/Algorithm-Design-2/index.html +++ b/2023/10/06/Algorithm-Design-2/index.html @@ -29,8 +29,8 @@ - + @@ -648,8 +648,8 @@

2.3. Shortest Path (without - + diff --git a/2023/10/06/ZKP-and_MPC-1/index.html b/2023/10/06/ZKP-and_MPC-1/index.html index 88b20c5..6b29923 100644 --- a/2023/10/06/ZKP-and_MPC-1/index.html +++ b/2023/10/06/ZKP-and_MPC-1/index.html @@ -25,7 +25,7 @@ - + @@ -301,7 +301,7 @@

更新于 - + @@ -725,10 +725,15 @@

3 IP Examples

\] \(k\) rounds : \(\Pr\{V \text{ accepts}\}\le\frac{1}{2^k}\) .

-

  • Zero-knowledge : NOT zero-knowledge

    +

  • Zero-knowledge : NOT (dishonest-verifier) +zero-knowledge

    \(V\) knows \(h^{-1}(y)\) , which cannot be computed in -poly-time by itself .

    • +poly-time by itself .

    +
    +

    This is still honest-verifier zero-knowledge , see +homework 1

    +

  • Notes

    diff --git a/2023/10/16/ZKP-and-MPC-3/index.html b/2023/10/16/ZKP-and-MPC-3/index.html index 5eba2b5..dfba926 100644 --- a/2023/10/16/ZKP-and-MPC-3/index.html +++ b/2023/10/16/ZKP-and-MPC-3/index.html @@ -25,7 +25,7 @@ - + @@ -151,9 +151,9 @@
    1. 1. Lec02 Zero-Knowledge Proof under Composition
      1. 1.1. 2.3 Sequential Composition
        1. 1.1.1. Construction
        2. 1.1.2. Proof of \(M^*(x,z)\equiv \braket{P(y),V^*(z)}(x)\)
    2. 2. Lec03 -Commitment Scheme , zk-proof for general NP
      1. 2.1. 3.1 Commitment
      2. 2.2. 3.2 Perfect -Binding & Computationally Hiding Commitment
      3. 2.3. 3.3 -Computationally Binding & Perfect Hiding Commitment
      4. 2.4. 3.4 General NP Problem
    +Commitment Scheme , zk-proof for general NP
    1. 2.1. 3.0 Important
    2. 2.2. 3.1 Commitment
    3. 2.3. 3.2 Perfect +Binding & Computationally Hiding Commitment
    4. 2.4. 3.3 +Computationally Binding & Perfect Hiding Commitment
    5. 2.5. 3.4 General NP Problem
    • @@ -300,9 +300,15 @@

    发表于 - - + + + + + + + 更新于 + @@ -499,6 +505,9 @@

    Proof of

    Lec03 Commitment Scheme , zk-proof for general NP

    +

    3.0 Important

    +

    In the next lecture , we re-defined commitment in a more +simple way .

    3.1 Commitment

    Intuition :

    diff --git a/index.html b/index.html index c5a0725..0395b8f 100644 --- a/index.html +++ b/index.html @@ -365,9 +365,15 @@

    发表于 - - + + + + + + + 更新于 + diff --git a/page/2/index.html b/page/2/index.html index d417bf3..c03d969 100644 --- a/page/2/index.html +++ b/page/2/index.html @@ -379,7 +379,7 @@

    更新于 - + diff --git a/search.xml b/search.xml index 7e3c9ea..977da67 100644 --- a/search.xml +++ b/search.xml @@ -512,6 +512,9 @@ Hyb_i\)

    Lec03 Commitment Scheme , zk-proof for general NP

    +

    3.0 Important

    +

    In the next lecture , we re-defined commitment in a more +simple way .

    3.1 Commitment

    Intuition :

    @@ -3672,10 +3675,15 @@ convince verifier , so \[ \] \(k\) rounds : \(\Pr\{V \text{ accepts}\}\le\frac{1}{2^k}\) .

    -

  • Zero-knowledge : NOT zero-knowledge

    +

  • Zero-knowledge : NOT (dishonest-verifier) +zero-knowledge

    \(V\) knows \(h^{-1}(y)\) , which cannot be computed in -poly-time by itself .

    • +poly-time by itself .

    +
    +

    This is still honest-verifier zero-knowledge , see +homework 1

    +

  • Notes

    @@ -4150,8 +4158,8 @@ class="math inline">\(dist(p)<dist(p')=d(u)+l_e\) , so 算法 算法-搜索 - 算法-强连通分量(SCC) 算法-贪心 + 算法-强连通分量(SCC)