1. 首页
  2. 数据库
  3. 其它
  4. Round optimal zero knowledge proofs of knowledge for NP

Round optimal zero knowledge proofs of knowledge for NP

上传者: 2021-02-23 20:53:30上传 PDF文件 550.14KB 热度 26次
It is well known that all the known black-box zero-knowledge proofs of knowledge for NP are non-constant-round. Whether there exit constant-round black-box zero-knowledge proofs of knowledge for all NP languages under certain standard assumptions is an open problem. This paper focuses on the problem
下载地址
用户评论