中国科学院研究生院学报
中國科學院研究生院學報
중국과학원연구생원학보
JOURNAL OF THE GRADUATE SCHOOL OF THE CHINESE ACADEMY OF SCIENCES
2010年
6期
831-837
,共7页
CRS模型下的可否认零知识%∑-协议%∑-编译器
CRS模型下的可否認零知識%∑-協議%∑-編譯器
CRS모형하적가부인령지식%∑-협의%∑-편역기
deniable zero knowledge in the CRS model%∑-protocol%∑-compiler
给出公共参考串(CRS)模型下可否认零知识的一个正面结果:从∑-协议到CRS模型下的可否认零知识的高效转化.由Pass在CRYPTO 2003中给出的下界可知,我们的编译器取得了最优的轮效率.此外,转化所增加的通信复杂度较小.
給齣公共參攷串(CRS)模型下可否認零知識的一箇正麵結果:從∑-協議到CRS模型下的可否認零知識的高效轉化.由Pass在CRYPTO 2003中給齣的下界可知,我們的編譯器取得瞭最優的輪效率.此外,轉化所增加的通信複雜度較小.
급출공공삼고천(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.
