An efficient compiler from Σ-protocol to deniable zero knowledge in CRS model
Wei‐Qing Huang
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.
Journal of the Graduate School of the Chinese Academy of Sciences•Jan 1, 2010•0 citations