[1] |
孙立娟 . 现代电子调查技术研究[J]. 浙江统计, 2005,(6): 34-3.
|
|
SUN L J . Study of modem electronic survey technique[J]. Zhejiang Statistics, 2005,(6): 34-35.
|
[2] |
[EB/OL]..
|
[3] |
United Nations. United nations E-Government survey 2010[EB/OL]. .
|
[2] |
晓晖 . 搜狐、零点携手演绎“新新合作”——中国调查业步入网络时代[J]. 计算机与网络, 1998,(8): 7.
|
|
XIAO H . Soho,Zero demonstrate “new cooperation” ——China investigation step into network times[J]. Computer&Network, 1998,(8): 7.
|
[5] |
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.
|
[6] |
CAMENISCH J , LYSYANSKAYA A . Signature schemes and anonymous credentials from bilinear maps[C]//Advances in Cryp-tology–CRYPTO 2004. 2004:56-72.
|
[7] |
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.
|
[8] |
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.
|
[9] |
DODIS Y , YAMPOLSKIY R . A verifiable random function with short Proofs and keys[J]. Lecture Notes in Computer Science, 2004:416-431.
|
[10] |
BONEH D , BOYEN X . Efficient selective-ID secure identity-based encryption without random oracles[J]. Lecture Notes in Computer Science, 2004:223-238.
|
[11] |
BRASSARD G , CHAUM D , CRE'PEAU C . Minimum disclosure proofs of knowledge[J]. Journal of Computer&System Sciences, 1988,37(2): 156-189.
|
[12] |
PEDERSEN T P . Non-interactive and information-theoretic secure verifiable secret sharing[C]//Advances in Cryptology. 1994:129-140.
|
[13] |
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.
|
[14] |
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.
|