节点文献
从Σ-协议到公共参考串模型下可否认零知识的高效编译器(英文)
An efficient compiler from Σ-protocol to deniable zero knowledge in CRS model
【摘要】 给出公共参考串(CRS)模型下可否认零知识的一个正面结果:从Σ-协议到CRS模型下的可否认零知识的高效转化.由Pass在CRYPTO 2003中给出的下界可知,我们的编译器取得了最优的轮效率.此外,转化所增加的通信复杂度较小.
【Abstract】 In this paper,we present a positive result on deniable zero knowledge in the common reference string (CRS ) model: an efficient transformation from Σ-protocol to deniable zero knowledge in CRS model.According to the lower bound given by Pass,for deniable zero knowledge in CRS model,our compiler achieves optimal round efficiency.In addition,the transformation induces only a small additive overhead in communication complexity.
【关键词】 CRS模型下的可否认零知识；
Σ-协议；
Σ-编译器；
【Key words】 deniable zero knowledge in the CRS model； Σ-protocol； Σ-compiler；
【Key words】 deniable zero knowledge in the CRS model； Σ-protocol； Σ-compiler；
【基金】 Supported by National Nature Science Foundation of China (60773134,61003276,60803128);the National 863 Program (2006AA01Z416);the National 973 Program (2007CB311201);the 47th Postdoctoral Fund of China(20100470598)
- 【文献出处】 中国科学院研究生院学报 ,Journal of the Graduate School of the Chinese Academy of Sciences , 编辑部邮箱 ,2010年06期
- 【分类号】TP309
- 【下载频次】51