期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

从Σ-协议到公共参考串模型下可否认零知识的高效编译器(英文)

An efficient compiler from Σ-protocol to deniable zero knowledge in CRS model
原文传递
导出
摘要 给出公共参考串(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.
作者 黄桂芳 胡磊 林东岱
机构地区 中国科学院研究生院信息安全国家重点实验室 中国科学院软件研究所
出处 《中国科学院研究生院学报》 CAS CSCD 北大核心 2010年第6期831-837,共7页 Journal of the Graduate School of the Chinese Academy of Sciences
基金 Supported by National Nature Science Foundation of China (60773134,61003276,60803128) the National 863 Program (2006AA01Z416) the National 973 Program (2007CB311201) the 47th Postdoctoral Fund of China(20100470598)
关键词 CRS模型下的可否认零知识 Σ-协议 Σ-编译器 deniable zero knowledge in the CRS model Σ-protocol Σ-compiler
分类号 TP309 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献16

  • 1Goldwasser S, Micali S, Rackoff C. The knowledge complexity of interactive proof system[J]. SIAM Journal on Computing, 1989, 18 ( 1 ) : 186-208.
  • 2Goldreich O, Micali S, Widerson A. Proofs that yields nothing but their validity or all languages in NP have zero knowledge proof systems [J]. Journal of ACM, 1991, 38(3) : 691-729.
  • 3Dwork C, Naor M, Sahai A. Concurrent zero knowledge[ C ]//Proceedings of the 30th Annual ACM Symposium on Theory of Computing, ACM Press, 1998, 409- 428.
  • 4Canetti R, Kilian R, Petrank J, et al. Black-box concurrent zero- knowledge requires (almost) logarithm many rounds[ J]. SIAM Jonrnal on Computing, 2002, 32( 1 ) : 1- 47.
  • 5Canetti R, Goldreich O, Goldwasser S, et al. Resettable zero knowledge [ C ]//Proceedings of 32nd Annual ACM Symposium on Theory of Computing. ACM Press, 2000:235-244.
  • 6Barak B, Goldreich O, Golawasser S, et al. Resettably-sound zero knowledge and its applications [ C ] //Proceedings of 42nd Annual Symposium on Foundations of Computer Science. IEEE Computer Society, 2001:116-125.
  • 7Blum M, Feldman P, Micali S. Non-interactive zero-knowledge and its applications[ C]//Proceedings of the 20th Annual ACM Symposium on Theory of Computing. ACM Press, 1988 : 103-112.
  • 8Damgard I. Efficient concurrent zero knowledge in the auxiliary string model[ C ]///Advances in Cryptology-EUROCRYPT 2000. Springer- Verlag, 2000:419- 430.
  • 9Canetti R. Universally composable security: A new paradigm for cryptographic protocols[ C ]//Proceedings of 42nd IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, 2002 : 136-145.
  • 10Canetti R, Fischlin M. Universally composable commitments[ C]//Advances in Cryptology-Crypto 2001. Springer-Verlag, 2001:19-40.
中国科学院研究生院学报
2010年 第6期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部