中文摘要：

给出公共参考串（CRS）模型下可否认零知识的一个正面结果：从Σ-协议到CRS模型下的可否认零知识的高效转化.由Pass在CRYPTO 2003中给出的下界可知,我们的编译器取得了最优的轮效率.此外,转化所增加的通信复杂度较小.

英文摘要：

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.