ZKP学习笔记
Lecture 11: From Practice to Theory (Guest Lecturer: Alex Lombardi)
11.4 Use CI to instantiate Fiat-Shamir
-
Avoid Bad Challenges
- Def: Given false claim
x
x
α
alpha
β
beta
g
a
m
m
a
gamma
V
V
- We want to say: if the (3 message) interactive protocol is sound, then (for all
x
x
α
alpha
β
beta
- Exactly what CI is good for! Define relation
R
x
=
α
,
β
:
β
i
s
b
a
d
R_x = {alpha, beta: beta is bad}
h
h
R
x
R_x
x
∉
L
x notin L
Π
F
S
Pi_{FS}
h
h
- Protocols with more than 3 messages: round-by-round soundness (each round has a type of “bad challenge” to avoid).
- Main technical challenges:
- Def: Given false claim
-
Important example: SNARGs via IOPs (PCPs)
-
SNARGs from PCPs [Kilian, Micali]
-
SNARGs for Batch NP
-
Interactive Batch Arguments from PCPs [CJJ21]
-
SSB Commitments
-
Interactive Batch Arguments from PCPs [CJJ21]
-
-
-
Summary of Fiat-Shamir without RO
原文地址:https://blog.csdn.net/weixin_45347752/article/details/134617886
本文来自互联网用户投稿,该文观点仅代表作者本人,不代表本站立场。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。
如若转载,请注明出处:http://www.7code.cn/show_918.html
如若内容造成侵权/违法违规/事实不符,请联系代码007邮箱:suwngjj01@126.com进行投诉反馈,一经查实,立即删除!