[ "柳璐(1992-),女,辽宁沈阳人,东北大学硕士生,主要研究方向为密码学与信息安全。" ]
[ "李宇溪(1990-),女,辽宁朝阳人,东北大学博士生,主要研究方向为密码学与信息安全。" ]
[ "周福才(1964-),男,吉林长春人,东北大学软件学院教授、博士生导师,主要研究方向为网络与信息安全。" ]
网络首发:2016-12,
纸质出版:2016-12-15
移动端阅览
柳璐, 李宇溪, 周福才. 基于非交互零知识证明的匿名电子调查系统[J]. 网络与信息安全学报, 2016,2(12):39-46.
Lu LIU, Yu-xi LI, Fu-cai ZHOU. Anonymous survey system based on NIZK[J]. Chinese Journal of Network and Information Security, 2016, 2(12): 39-46.
柳璐, 李宇溪, 周福才. 基于非交互零知识证明的匿名电子调查系统[J]. 网络与信息安全学报, 2016,2(12):39-46. DOI: 10.11959/j.issn.2096-109x.2016.00121.
Lu LIU, Yu-xi LI, Fu-cai ZHOU. Anonymous survey system based on NIZK[J]. Chinese Journal of Network and Information Security, 2016, 2(12): 39-46. DOI: 10.11959/j.issn.2096-109x.2016.00121.
针对电子调查存在的不少安全问题,如信息欺骗、隐私安全等,构建了一个基于非交互零知识证明(NIZK
non-interactive zero knowledge proofs)的匿名电子调查系统,系统具有自组织、非交互、防重放、更安全等特点。系统采用NIZK协议和Boneh-Boyen签名方案对用户的身份进行非交互式的验证,保证了系统的真实性;系统还采用Pedersen承诺方案和伪随机函数对用户的身份和相关信息进行隐藏,保证了系统的匿名性。安全性分析表明,系统具有抵抗恶意用户并发攻击和匿名性等安全特性。最后,对系统的功能进行了仿真并验证,结果表明,系统能够正确完成各项功能,并有效地保证系统的匿名性与真实性。
Aiming at the security problem that the existing in electronic surveys
such as information fraud
privacy security etc.An anonymous electronic survey scheme based on non-interactive zero knowledge proofs (NIZK) was constructed
which had the characteristics of self-organization
non-interactive
anti-replay
and high efficiency.The system uses the NIZK protocol and the Boneh-Boyen signature scheme to verify the user's identity in non-interactive manner
which guarantees the authenticity of the scheme.The system also uses the Pedersen commitment scheme and the pseudo random function to hide the user's identity and the related information
which guarantees the ano-nymity.Security analysis show that the system has security features such as malicious users attack resistance and anonymity.Finally
the function of the system was also verified and the result show that the system can accomplish all the functions correctly and guarantee the anonymity and authenticity of the system effectively.
孙立娟 . 现代电子调查技术研究 [J ] . 浙江统计 , 2005 ,( 6 ): 34 - 3 .
SUN L J . Study of modem electronic survey technique [J ] . Zhejiang Statistics , 2005 ,( 6 ): 34 - 35 .
[EB/OL ] . http://www.cnnic.net.cn/hlwfzyj/hlwxzbg/hlwtjbg/201502/P020150203548852631921.pdf http://www.cnnic.net.cn/hlwfzyj/hlwxzbg/hlwtjbg/201502/P020150203548852631921.pdf .
United Nations . United nations E-Government survey 2010 [EB/OL ] . https://publicadministration.un.org/egovkb/en-us/Reports/UN-E-Government-Survey-2010 https://publicadministration.un.org/egovkb/en-us/Reports/UN-E-Government-Survey-2010 .
晓晖 . 搜狐、零点携手演绎“新新合作”——中国调查业步入网络时代 [J ] . 计算机与网络 , 1998 ,( 8 ): 7 .
XIAO H . Soho,Zero demonstrate “new cooperation” ——China investigation step into network times [J ] . Computer&Network , 1998 ,( 8 ): 7 .
NEFF C A . A verifiable secret shuffle and its application to E-Voting[C]//The 8th ACM Conference on Computer and Commu-nications Security . 2001 : 116 - 125 .
CAMENISCH J , LYSYANSKAYA A . Signature schemes and anonymous credentials from bilinear maps[C]//Advances in Cryp-tology–CRYPTO 2004 . 2004 : 56 - 72 .
HOHENBERGER S , MYERS S , PASS R , et al . ANONIZE:a large-scale anonymous survey system[C]//Security and Privacy , 2014 IEEE Symposium on . 2014 : 375 - 389 .
BLUM M , FELDMAN P , MICALI S . Non-interactive zero-knowledge and its applications[C]//The 20th Annual ACM Symposium on Theory of Computing . 1988 : 1084 - 1118 .
DODIS Y , YAMPOLSKIY R . A verifiable random function with short Proofs and keys [J ] . Lecture Notes in Computer Science , 2004 : 416 - 431 .
BONEH D , BOYEN X . Efficient selective-ID secure identity-based encryption without random oracles [J ] . Lecture Notes in Computer Science , 2004 : 223 - 238 .
BRASSARD G , CHAUM D , CRE'PEAU C . Minimum disclosure proofs of knowledge [J ] . Journal of Computer&System Sciences , 1988 , 37 ( 2 ): 156 - 189 .
PEDERSEN T P . Non-interactive and information-theoretic secure verifiable secret sharing[C]//Advances in Cryptology . 1994 : 129 - 140 .
GOLDREICH O , MICALI S . Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof sys-tems [J ] . Journal of the ACM , 1991 , 38 ( 3 ): 691 - 29 .
BARAK B , PRABHAKARAN M , SAHAI A . PRABHAKARAN M,SAHAI A.Concurrent non-malleable zero knowledge [J ] . Foundations of Computer Science Annual Symposium on , 2006 ,( 4 ): 345 - 354 .
0
浏览量
4326
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621