New Insight to Preserve Online Survey Accuracy and Privacy in Big Data Era

  • Joseph K. Liu
  • Man Ho Au
  • Xinyi Huang
  • Willy Susilo
  • Jianying Zhou
  • Yong Yu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8713)


An online survey system provides a convenient way for people to conduct surveys. It removes the necessity of human resources to hold paper surveys or telephone interviews and hence reduces the cost significantly. Nevertheless, accuracy and privacy remain as the major obstacles that need additional attention. To conduct an accurate survey, privacy maybe lost, and vice versa. In this paper, we provide new insight to preserve these two seeming contradictory issues in online survey systems especially suitable in big data era. We propose a secure system, which is shown to be efficient and practical by simulation data. Our analysis further shows that the proposed solution is desirable not only in online survey systems but also in several potential applications, including E-Voting, Smart-Grid and Vehicular Ad Hoc Networks.


Online Survey Privacy Big Data 


  1. 1.
    Kwik Survey: KwikSurveys: Offical Free online survey and questionnaire tool,
  2. 2.
    My3q: FREE Online Survey Questionnaire Research by my3q,
  3. 3.
    Survey Monkey: SurveyMonkey: Free online survey software and questionnaire tool,
  4. 4.
    Shamir, A.: Identity-Based Cryptosystems and Signature Schemes. In: Blakely, G.R., Chaum, D. (eds.) Advances in Cryptology - CRYPTO 1984. LNCS, vol. 196, pp. 47–53. Springer, Heidelberg (1985)Google Scholar
  5. 5.
    Rivest, R.L., Shamir, A., Tauman, Y.: How to Leak a Secret. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 552–565. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  6. 6.
    Boyen, X.: Mesh Signatures. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 210–227. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  7. 7.
    Chaum, D., van Heyst, E.: Group Signatures. In: Davies, D.W. (ed.) Advances in Cryptology - EUROCRYPT 1991. LNCS, vol. 547, pp. 257–265. Springer, Heidelberg (1991)Google Scholar
  8. 8.
    Ateniese, G., Camenisch, J., Joye, M., Tsudik, G.: A Practical and Provably Secure Coalition-Resistant Group Signature Scheme. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 255–270. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  9. 9.
    Shahandashti, S.F., Safavi-Naini, R.: Threshold Attribute-Based Signatures and Their Application to Anonymous Credential Systems. In: Preneel, B. (ed.) AFRICACRYPT 2009. LNCS, vol. 5580, pp. 198–216. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  10. 10.
    Li, J., Au, M.H., Susilo, W., Xie, D., Ren, K.: Attribute-Based Signature and Its Applications. In: Feng, D., Basin, D.A., Liu, P. (eds.) ASIACCS, pp. 60–69. ACM (2010)Google Scholar
  11. 11.
    Maji, H.K., Prabhakaran, M., Rosulek, M.: Attribute-Based Signatures. In: Kiayias, A. (ed.) CT-RSA 2011. LNCS, vol. 6558, pp. 376–392. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  12. 12.
    Okamoto, T., Takashima, K.: Efficient Attribute-Based Signatures for Non-Monotone Predicates in the Standard Model. In: Catalano, D., Fazio, N., Gennaro, R., Nicolosi, A. (eds.) PKC 2011. LNCS, vol. 6571, pp. 35–52. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  13. 13.
    Okamoto, T.: Receipt-Free Electronic Voting Schemes for Large Scale Elections. In: Christianson, B., Crispo, B., Lomas, M., Roe, M. (eds.) Security Protocols 1997. LNCS, vol. 1361, pp. 25–35. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  14. 14.
    Juels, A., Catalano, D., Jakobsson, M.: Coercion-resistant electronic elections. In: WPES 2005, pp. 61–70. ACM Press (2005)Google Scholar
  15. 15.
    Abe, M., Groth, J., Haralambiev, K., Ohkubo, M.: Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 649–666. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  16. 16.
    Lynn, B.: The Java Pairing Based Cryptography Library, jPBC (2010),
  17. 17.
    Chaum, D.: Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms. Communications of the ACM 24(2), 84–88 (1981)CrossRefGoogle Scholar
  18. 18.
    Fujioka, A., Okamoto, T., Ohta, K.: A Practical Secret Voting Scheme for Large Scale Election. In: Zheng, Y., Seberry, J. (eds.) AUSCRYPT 1992. LNCS, vol. 718, pp. 244–260. Springer, Heidelberg (1993)CrossRefGoogle Scholar
  19. 19.
    Benaloh, J., Tuinstra, D.: Receipt-Free Secret-Ballot Elections (Extended Abstract). In: STOC 1994: Proceedings of the Twenty-sixth Annual ACM Symposium on Theory of Computing, pp. 544–553. ACM Press (1994)Google Scholar
  20. 20.
    Hirt, M., Sako, K.: Efficient Receipt-Free Voting Based on Homomorphic Encryption. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 539–556. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  21. 21.
    Groth, J.: A Verifiable Secret Shuffle of Homomorphic Encryptions. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 145–160. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  22. 22.
    Liu, J.K., Wong, D.S.: A Restricted Multi-show Credential System and its Application on E-Voting. In: Deng, R.H., Bao, F., Pang, H., Zhou, J. (eds.) ISPEC 2005. LNCS, vol. 3439, pp. 268–279. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  23. 23.
    Liu, J.K., Wei, V.K., Wong, D.S.: Linkable Spontaneous Anonymous Group Signature for Ad Hoc Groups (Extended Abstract). In: Wang, H., Pieprzyk, J., Varadharajan, V. (eds.) ACISP 2004. LNCS, vol. 3108, pp. 325–335. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  24. 24.
    Liu, J.K., Wong, D.S.: Enhanced security models and a generic construction approach for linkable ring signature. Int. J. Found. Comput. Sci. 17(6), 1403–1422 (2006)CrossRefzbMATHMathSciNetGoogle Scholar
  25. 25.
    Au, M.H., Liu, J.K., Susilo, W., Yuen, T.H.: Certificate based (linkable) ring signature. In: Dawson, E., Wong, D.S. (eds.) ISPEC 2007. LNCS, vol. 4464, pp. 79–92. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  26. 26.
    Chow, S.S.M., Liu, J.K., Wong, D.S.: Robust Receipt-Free Election System with Ballot Secrecy and Verifiability. In: NDSS. The Internet Society (2008)Google Scholar
  27. 27.
    Yuen, T.H., Liu, J.K., Au, M.H., Susilo, W., Zhou, J.: Efficient linkable and/or threshold ring signature without random oracles. Comput. J. 56(4), 407–421 (2013)CrossRefGoogle Scholar
  28. 28.
    Au, M.H., Liu, J.K., Susilo, W., Yuen, T.H.: Secure id-based linkable and revocable-iff-linked ring signature with constant-size construction. Theor. Comput. Sci. 469, 1–14 (2013)CrossRefzbMATHMathSciNetGoogle Scholar
  29. 29.
    Liu, J.K., Au, M.H., Susilo, W., Zhou, J.: Linkable ring signature with unconditional anonymity. IEEE Trans. Knowl. Data Eng. 26(1), 157–165 (2014)CrossRefGoogle Scholar
  30. 30.
    of Standards, N.I., Technology: NIST IR 7628: Guidelines for Smart Grid Cyber Security. Technical report (2010),
  31. 31.
    Chen, L., Ng, S.L., Wang, G.: Threshold Anonymous Announcement in VANETs. IEEE Journal on Selected Areas in Communications 29(3), 605–615 (2011)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Joseph K. Liu
    • 1
  • Man Ho Au
    • 2
    • 4
  • Xinyi Huang
    • 3
  • Willy Susilo
    • 4
  • Jianying Zhou
    • 1
  • Yong Yu
    • 4
    • 5
  1. 1.Infocomm Security DepartmentInstitute for Infocomm ResearchSingapore
  2. 2.Department of ComputingThe Hong Kong Polytechnic UniversityHong Kong
  3. 3.Fujian Provincial Key Laboratory of Network Security and Cryptology, School of Mathematics and Computer ScienceFujian Normal UniversityFuzhouChina
  4. 4.Centre for Computer and Information Security Research, School of Computer Science and Software EngineeringUniversity of WollongongAustralia
  5. 5.School of Computer Science and EngineeringUniversity of Electronic Science and Technology of ChinaChengduChina

Personalised recommendations