Skip to main content
SpringerLink
Log in

Enhancing the Trustworthiness of Service On-Demand Systems via Smart Vote Filtering

  • Conference paper
  • First Online:
Trust and Trustworthy Computing (Trust 2015)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 9229))

Included in the following conference series:

  • 1451 Accesses

Abstract

Service on-demand (SoD) systems allow their users to regulate the sharing of common resources via a voting process. A common application example is the collaborative scheduling of multimedia transmissions in e-radio or video streaming services. Therefore, high user commitment and participation is critical to the success of a SoD system. Securing a SoD system against common attacks, such as vote flooding, can impose client anonymity retraction, online registering and access control mechanisms. Nonetheless, such processes can degrade the users’ quality of experience, discouraging user participation. The present study proposes a defense mechanism against vote flooding attacks that can operate under complete vote anonymity and without any user access restrictions. The novel scheme is implemented as a vote filtering scheme, executed prior to each service scheduling decision. The proposed scheme has linear complexity and is shown via simulations to considerably mitigate or completely negate the effects of several attacks types.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Aksoy, D., Franklin, M.: R\(\times \)W: a scheduling approach for large-scale on-demand data broadcast. IEEE/ACM Trans. Network. 7(6), 846–860 (1999)

    Article  Google Scholar 

  2. Backes, M., Hritcu, C., Maffei, M.: Automated verification of remote electronic voting protocols in the applied pi-calculus. In: Proceedings of the 21st IEEE Computer Security Foundations Symposium (CSF 2008), pp. 195–209, Pittsburgh, 23–25 June 2008 (2008). http://doi.ieeecomputersociety.org/10.1109/CSF.2008.26

  3. Baiardi, F., Falleni, A., Granchi, R., Martinelli, F., Petrocchi, M., Vaccarelli, A.: Seas, a secure e-voting protocol: design and implementation. Comput. Secur. 24(8), 642–652 (2005). http://dx.doi.org/10.1016/j.cose.2005.07.008

    Article  Google Scholar 

  4. Benkaouz, Y., Erradi, M.: A distributed protocol for privacy preserving aggregation with non-permanent participants. Computing. J. 3, 1–20 (2014). doi:10.1007/s00607-013-0373-6

    Article  Google Scholar 

  5. Benkaouz, Y., Guerraoui, R., Erradi, M., Huc, F.: A distributed polling with probabilistic privacy. In: IEEE 32nd Symposium on Reliable Distributed Systems (SRDS 2013), pp. 41–50, Braga, 1–3 October 2013 (2013). http://dx.doi.org/10.1109/SRDS.2013.13

  6. Camenisch, J.L., Lysyanskaya, A.: An efficient system for non-transferable anonymous credentials with optional anonymity revocation. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 93–118. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  7. Chaum, D.: Security without identification: transaction systems to make big brother obsolete. Commun. ACM 28(10), 1030–1044 (1985). http://doi.acm.org/10.1145/4372.4373

    Article  Google Scholar 

  8. Chen, Y., Jan, J., Chen, C.: The design of a secure anonymous internet voting system. Comput. Secur. 23(4), 330–337 (2004). http://dx.doi.org/10.1016/j.cose.2004.01.015

    Article  Google Scholar 

  9. Clarkson, M.R., Chong, S., Myers, A.C.: Civitas: Toward a secure voting system. In: 2008 IEEE Symposium on Security and Privacy (S&P 2008), pp. 354–368, Oakland, 18–21 May 2008. http://dx.doi.org/10.1109/SP.2008.32

  10. Cortier, V., Smyth, B.: Attacking and fixing helios: an analysis of ballot secrecy. J. Comput. Secur. 21(1), 89–148 (2013)

    Google Scholar 

  11. Cranor, L.F., Cytron, R.: Sensus: a security-conscious electronic polling system for the internet. In: 30th Annual Hawaii International Conference on System Sciences (HICSS-30), pp. 561–570, Maui, 7–10 January 1997. http://doi.ieeecomputersociety.org/10.1109/HICSS.1997.661700

  12. Degroot, M.H.: Reaching a consensus. J. Am. Stat. Assoc. 69(345), 118–121 (1974)

    Article  MATH  Google Scholar 

  13. Dykeman, H.D., Ammar, M.H., Wong, J.W.: Scheduling algorithms for videotex systems under broadcast delivery. In: Proceedings of the International Conference on Communications (ICC 1986), pp. 1847–1851, Toronto, June 1986

    Google Scholar 

  14. Englert, B., Gheissari, R.: Multivalued and deterministic peer-to-peer polling in social networks with reputation conscious participants. In: 12th IEEE International Conference on Ubiquitous Computing and Communications (IUCC-2013), pp. 895–902, Melbourne, July 16–18 2013. http://dx.doi.org/10.1109/TrustCom.2013.109

  15. Fan, C., Sun, W.: An efficient multi-receipt mechanism for uncoercible anonymous electronic voting. Math. Comput. Model. 48(9–10), 1611–1627 (2008). http://dx.doi.org/10.1016/j.mcm.2008.05.039

    Article  MathSciNet  MATH  Google Scholar 

  16. Frith, D.: E-voting security: hope or hype? Netw. Secur. 2007(11), 14–16 (2007)

    Article  Google Scholar 

  17. Gambs, S., Guerraoui, R., Harkous, H., Huc, F., Kermarrec, A.: Scalable and secure polling in dynamic distributed networks. In: IEEE 31st Symposium on Reliable Distributed Systems (SRDS 2012), pp. 181–190, Irvine, 8–11 October 2012. http://dx.doi.org/10.1109/SRDS.2012.63

  18. Greensmith, J., Aickelin, U., Tedesco, G.: Information fusion for anomaly detection with the dendritic cell algorithm. Inf. Fusion 11(1), 21–34 (2010)

    Article  Google Scholar 

  19. Gritzali, D.: Principles and requirements for a secure e-voting system. Comput. Secur. 21(6), 539–556 (2002). http://dx.doi.org/10.1016/S0167-4048(02)01014–3

    Article  Google Scholar 

  20. Guerraoui, R., Huguenin, K., Kermarrec, A., Monod, M., Vigfusson, Y.: Decentralized polling with respectable participants. J. Parallel Distrib. Comput. 72(1), 13–26 (2012). http://dx.doi.org/10.1016/j.jpdc.2011.09.003

    Article  MATH  Google Scholar 

  21. Hoang, B., Imine, A.: Efficient polling protocol for decentralized social networks. CoRR abs/1412.7653 (2014). http://arxiv.org/abs/1412.7653

  22. Joaquim, R., Zúquete, A., Ferreira, P.: Revs-a robust electronic voting system. IADIS Int. J. WWW/Internet 1(2), 47–63 (2003)

    Google Scholar 

  23. Jonker, H., Mauw, S., Pang, J.: Privacy and verifiability in voting systems: Methods, developments and trends. Comput. Sci. Rev. 10, 1–30 (2013). http://dx.doi.org/10.1016/j.cosrev.2013.08.002

    Article  Google Scholar 

  24. Li, C., Hwang, M., Liu, C.: An electronic voting protocol with deniable authentication for mobile ad hoc networks. Comput. Commun. 31(10), 2534–2540 (2008). http://dx.doi.org/10.1016/j.comcom.2008.03.018

    Article  Google Scholar 

  25. Liaskos, C., Petridou, S., Papadimitriou, G.: Towards realizable, low-cost broadcast systems for dynamic environments. IEEE/ACM Trans. Netw. 19(2), 383–392 (2011)

    Article  Google Scholar 

  26. Liaskos, C., Papadimitriou, G., Douligeris, C.: Sensor swarm query filtering: heightened attack resilience for broadcast on-demand services. In: IEEE Symposium on Computers and Communications (ISCC 2013), pp. 000312–000317. IEEE (2013)

    Google Scholar 

  27. Liaskos, C., Tsioliaridou, A., Papadimitriou, G., Nicopolitidis, P.: Minimal wireless broadcast schedules for multi-objective pursuits. IEEE Transactions on Vehicular Technology p. preprint (2014)

    Google Scholar 

  28. Malkhi, D., Margo, O., Pavlov, E.: E-voting without cryptography. In: Financial Cryptography, 6th International Conference (FC 2002), pp. 1–15, Southampton, 11–14 March 2002. http://dx.doi.org/10.1007/3-540-36504-4_1

  29. Meng, B.: A critical review of receipt-freeness and coercion-resistance. Inf. Technol. J. 8(7), 934–964 (2009)

    Article  Google Scholar 

  30. Meng, B., Li, Z., Qin, J.: A receipt-free coercion-resistant remote internet voting protocol without physical assumptions through deniable encryption and trapdoor commitment scheme. J. Softw. 5(9), 942–949 (2010)

    Article  Google Scholar 

  31. Misra, J., Gries, D.: Finding repeated elements. Sci. Comput. Program. 2(2), 143–152 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  32. Pardede, E., Taniar, D., Awan, I., Al-Sudani, W., Gill, A., Li, C., Wang, J., Liu, F.: Protection through multimedia CAPTCHAs. In: Proceedings of the 8th International Conference on Advances in Mobile Computing and Multimedia (MoMM 2010), p. 63. ACM Press (2010)

    Google Scholar 

  33. Pietronero, L., Tosatti, E., Tosatti, V., Vespignani, A.: Explaining the uneven distribution of numbers in nature: the laws of Benford and Zipf. Physica A 293(1–2), 297–304 (2001)

    Article  MATH  Google Scholar 

  34. Qadah, G.Z., Taha, R.: Electronic voting systems: Requirements, design, and implementation. Computer Standards Interfaces 29(3), 376–386 (2007). http://dx.doi.org/10.1016/j.csi.2006.06.001

    Article  Google Scholar 

  35. Sampigethaya, K., Poovendran, R.: A framework and taxonomy for comparison of electronic voting schemes. Comput. Secur. 25(2), 137–153 (2006). http://dx.doi.org/10.1016/j.cose.2005.11.003

    Article  Google Scholar 

  36. Sharaf, M.A., Chrysanthis, P.: On-Demand Broadcast: new Challenges and Scheduling Algorithms. In: Proceedings of the 1st Hellenic Conference on the Management of Data (2002)

    Google Scholar 

  37. Sieka, B., Kshemkalyani, A.D., Singhal, M.: On the security of polling protocols in peer-to-peer systems. In: 4th International Conference on Peer-to-Peer Computing (P2P 2004), pp. 36–44, Zurich, 15–17 August 2004. http://doi.ieeecomputersociety.org/10.1109/PTP.2004.1334929

  38. Smart, M., Ritter, E.: True trustworthy elections: remote electronic voting using trusted computing. In: Calero, J.M.A., Yang, L.T., Mármol, F.G., García Villalba, L.J., Li, A.X., Wang, Y. (eds.) ATC 2011. LNCS, vol. 6906, pp. 187–202. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  39. Tsioliaridou, A., Zhang, C., Liaskos, C.: Fast and fair handling of multimedia captcha flows. International Journal of Interactive Mobile Technologies (2015). (To appear )

    Google Scholar 

  40. XJ Technologies: The AnyLogic Simulator (2013). http://www.xjtek.com/anylogic/

  41. Zwierko, A., Kotulski, Z.: A light-weight e-voting system with distributed trust. Electr. Notes Theor. Comput. Sci. 168, 109–126 (2007). http://dx.doi.org/10.1016/j.entcs.2006.12.004

    Article  Google Scholar 

Download references

Acknowledgment

This work was partially supported by EU FP7 project OPTET (Grant no.317631).

Author information

Authors and Affiliations

  1. Foundation of Research and Technology - Hellas (FORTH), Heraklion, Greece

    Christos V. Samaras, Ageliki Tsioliaridou, Christos Liaskos, Dimitris Spiliotopoulos & Sotiris Ioannidis

Authors
  1. Christos V. Samaras
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ageliki Tsioliaridou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Christos Liaskos
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Dimitris Spiliotopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Sotiris Ioannidis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Christos V. Samaras .

Editor information

Editors and Affiliations

  1. University of Padua, Padua, Italy

    Mauro Conti

  2. Intel Labs, Darmstadt, Germany

    Matthias Schunter

  3. - Hellas (FORTH), Crete, Institute of Computer Science (ICS), Foundation for Research & Technology, Heraklion, Greece

    Ioannis Askoxylakis

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Samaras, C.V., Tsioliaridou, A., Liaskos, C., Spiliotopoulos, D., Ioannidis, S. (2015). Enhancing the Trustworthiness of Service On-Demand Systems via Smart Vote Filtering . In: Conti, M., Schunter, M., Askoxylakis, I. (eds) Trust and Trustworthy Computing. Trust 2015. Lecture Notes in Computer Science(), vol 9229. Springer, Cham. https://doi.org/10.1007/978-3-319-22846-4_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-22846-4_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-22845-7

  • Online ISBN: 978-3-319-22846-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation