An efficient compiler from Σ-protocol to deniable zero knowledge in CRS model
从Σ-协议到公共参考串模型下可否认零知识的高效编译器

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.