ZKP Mathematical Building Blocks (1)

MIT IAP 2023 Modern Zero Knowledge Cryptography课程笔记

Lecture 3: Mathematical Building Blocks (Yufei Zhao)

  • Example: I (Prover) want to convince you (Verifier) that I can distinguish two colors that you see as identical
    在这里插入图片描述

    • A Similar Example: How to prove two colors are different to a blind verifier
      在这里插入图片描述

    • What is a proof?

      • A proof is something that could convince someone else
      • Properties: completeness, soundness, zero-knowledge
    • What is the prover and the verifier (based on blockchain)

      • Prover: run on the regular computer (much more powerful than the verifier)
      • Verifier: run on the smart contract
  • Example: Hamilton cycle [Blum '87]

    • Hamilton cycle: a cycle can go through every vertex of the graph exactly once and return to the start
    • Everybody knows a graph
    • P knows a Hamilton cycle in the graph without revealing any additional information
    • Protocol
      在这里插入图片描述
  • ZKP Properties

    • Completeness: If everyone behaves then protocol accepts
    • Soundness: If there is no Ham cycle, then no matter what P does, V rejects with the probability of ≥ 1 2 \geq \frac{1}{2} 21
      • There is a stronger requirement called knowledge soundness which says that even if the graph has a Ham Cycle , the prover doesn’t know it, the protocol will still fail. The precise definition involves an extractor with rewinding abilities.
    • Zero-knowledge: If V accepts then it learns no addl into from the interaction because V could have simulated the entire dialog by itself.
  • 18
    点赞
  • 22
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值