Avoid Bad Challenges
x
x
x and a first message
α
alpha
α, a challenge
β
beta
β is “bad” if there exists a prover message
g
a
m
m
a
gamma
gamma making
V
V
V accept
x
x
x,
α
alpha
α) most
β
beta
β are not bad. True for statistically sound IPs.
R
x
=
α
,
β
:
β
i
s
b
a
d
R_x = {alpha, beta: beta is bad}
Rx=α,β:βisbad. Then if
h
h
h is CI for
R
x
R_x
Rx (when
x
∉
L
x notin L
x∈/L),
Π
F
S
Pi_{FS}
ΠFS is sound using
h
h
h!
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进行投诉反馈,一经查实,立即删除!