| 从Σ-协议到公共参考串模型下可否认零知识的高效编译器 |
| |
| 引用本文： | 黄桂芳,胡磊,林东岱.从Σ-协议到公共参考串模型下可否认零知识的高效编译器[J].中国科学院研究生院学报,2010,27(6):831-837. |
| |
| 作者姓名： | 黄桂芳 胡磊 林东岱 |
| |
| 作者单位： | 1. 中国科学院研究生院信息安全国家重点实验室, 北京 100049;
2. 中国科学院软件研究所, 北京 100190 |
| |
| 基金项目： | Supported by National Nature Science Foundation of China (60773134, 61003276, 60803128), the National 863 Program (2006AA01Z416), the National 973 Program (2007CB311201), and the 47th Postdoctoral Fund of China(20100470598) |
| |
| 摘 要： | 给出公共参考串(CRS)模型下可否认零知识的一个正面结果:从Σ-协议到CRS模型下的可否认零知识的高效转化.由Pass在CRYPTO 2003中给出的下界可知,我们的编译器取得了最优的轮效率.此外,转化所增加的通信复杂度较小.
|
| 关 键 词： | CRS模型下的可否认零知识 Σ-协议 Σ-编译器 |
| 收稿时间： | 2010-02-23 |
| 修稿时间： | 2010-05-07 |
An efficient compiler from Σ-protocol to deniable zero knowledge in CRS model |
| |
| HUANG Gui-Fang,HU Lei,LIN Dong-Dai.An efficient compiler from Σ-protocol to deniable zero knowledge in CRS model[J].Journal of the Graduate School of the Chinese Academy of Sciences,2010,27(6):831-837. |
| |
| Authors: | HUANG Gui-Fang HU Lei LIN Dong-Dai |
| |
| Institution: | 1 State Key Laboratory of Information Security, Graduate University, Chinese Academy of Sciences, Beijing 100049,China; 2 Institute of Software, Chinese Academy of Sciences, Beijing 100190, China |
| |
| 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. |
| |
| Keywords: | deniable zero knowledge in the CRS model &Sigma -protocol &Sigma -compiler |
|
| 点击此处可从《中国科学院研究生院学报》浏览原始摘要信息 |
| 点击此处可从《中国科学院研究生院学报》下载免费的PDF全文 |
