搜索结果: 1-1 共查到“密码学 Round-Optimal Zero-Knowledge Proofs”相关记录1条 . 查询时间(0.093 秒)
Round-Optimal Zero-Knowledge Proofs of Knowledge for NP
Round-Optimal Zero-Knowledge Proofs NP Hamiltonian Cycle
2009/6/10
It is well known that all the known black-box zero-knowledge proofs of knowledge for NP are nonconstant-
round. Whether there exit constant-round black-box zero-knowledge proofs of knowledge for
all...