Skip to main content

Health Data Sharing with Misbehavior Detection

  • Chapter
  • First Online:
  • 811 Accesses

Part of the book series: Wireless Networks ((WN))

Abstract

Despite the traditional health monitoring, MHNs can offer a wide range of social network and information sharing applications. In these social applications, MHNs are vulnerable to the malicious attacks and misbehaviors of mobile users, which may degrade the performance and even disrupt MHNs. The attackers may forge their social attributes to snatch other legitimate users’ health information during the information sharing, which violates users’ privacy. It may help them to push some biased health product recommendations and spam [1]. Moreover, these attackers may also misbehave, e.g., not following the network protocol, spreading spams, launching Denial-of-Service (DoS) attacks or consuming a large amount of network resources. Although some misbehavior detection schemes [2] can partially resist certain types of attacks, it is still challenging to adjust the security protection against the powerful attacks, such as Sybil attacks. The cost of misbehavior detection may increase due to the skyrocketing attacking capabilities of these attackers. To offer MHNs from QoP perspective, the misbehaviors should be categorized into different levels with the corresponding detection or protection schemes. In this chapter, we present social based mobile Sybil detection scheme to differentiate malicious attackers from normal users.

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

Buying options

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
Hardcover Book
USD   54.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

References

  1. K. Zhang, X. Liang, R. Lu, and X. S. Shen, “SAFE: A social based updatable filtering protocol with privacy-preserving in mobile social networks,” in Proc. of IEEE ICC, 2013, pp. 6045–6049.

    Google Scholar 

  2. J. Zhou, Z. Cao, X. Dong, X. Lin, and A. Vasilakos, “Securing m-healthcare social networks: challenges, countermeasures and future directions,” IEEE Wireless Communications, vol. 20, no. 4, pp. 12–21, 2013.

    Article  Google Scholar 

  3. Q. Lian, Z. Zhang, M. Yang, Y. Zhao, Y. Dai, and X. Li, “An empirical study of collusion behavior in the Maze P2P file-sharing system,” in Proc. of IEEE ICDCS, 2007, pp. 56–66.

    Google Scholar 

  4. K. Zhang, X. Liang, R. Lu, and X. Shen, “Exploiting multimedia services in mobile social network from security and privacy perspectives,” IEEE Communications Magazine, vol. 52, no. 3, pp. 58–65, 2014.

    Article  Google Scholar 

  5. D. Quercia and S. Hailes, “Sybil attacks against mobile users: Friends and foes to the rescue,” in Proc. of IEEE INFOCOM, 2010, pp. 336–340.

    Google Scholar 

  6. H. Yu, M. Kaminsky, P. Gibbons, and A. Flaxman, “SybilGuard: Defending against sybil attacks via social networks,” IEEE ACM Transactions on Networking, vol. 16, no. 3, pp. 576–589, 2008.

    Article  Google Scholar 

  7. H. Yu, P. Gibbons, M. Kaminsky, and F. Xiao, “SybilLimit: A near-optimal social network defense against sybil attacks,” IEEE/ACM Transactions on Networking, vol. 18, no. 3, pp. 885–898, 2010.

    Article  Google Scholar 

  8. Z. Yang, C. Wilson, X. Wang, T. Gao, B. Zhao, and Y. Dai, “Uncovering social network sybils in the wild,” CoRR, 2011.

    Google Scholar 

  9. X. Liang, X. Lin, and X. Shen, “Enabling trustworthy service evaluation in service-oriented mobile social networks,” IEEE Transactions on Parallel and Distributed Systems, vol. 25, no. 2, pp. 310–320, 2014.

    Article  Google Scholar 

  10. X. Lin, “LSR: Mitigating zero-day sybil vulnerability in privacy-preserving vehicular peer-to-peer networks,” IEEE Journal on Selected Areas in Communications, vol. 31, no. 9, pp. 237–246, 2013.

    Article  Google Scholar 

  11. K. Zhang, R. Lu, X. Liang, J. Qiao, and X. Shen, “Park: A privacy-preserving aggregation scheme with adaptive key management for smart grid,” in Proc. of IEEE ICCC, 2013, pp. 236–241.

    Google Scholar 

  12. J. Kleinberg, “The small-world phenomenon: An algorithm perspective,” in Proc. of STOC, 2000, pp. 163–170.

    Google Scholar 

  13. A. Cheng and E. Friedman, “Sybilproof reputation mechanisms,” in Proc. of SIGCOMM, 2005, pp. 128–132.

    Google Scholar 

  14. K. Walsh and E. Sirer, “Experience with an object reputation system for peer-to-peer filesharing,” in Proc. of NSDI, 2006.

    Google Scholar 

  15. R. Andersen, F. Chung, and K. Lang, “Local graph partitioning using pagerank vectors,” in Proc. of FOCS, 2006, pp. 475–486.

    Google Scholar 

  16. T. Haveliwala, “Topic-sensitive PageRank: A context-sensitive ranking algorithm for web search,” IEEE Transactions on Knowledge and Data Engineering, vol. 15, no. 4, pp. 784–796, 2003.

    Article  Google Scholar 

  17. R. Morselli, B. Bhattacharjee, M. Marsh, and A. Srinivasan, “Efficient lookup on unstructured topologies,” IEEE Journal on Selected Areas in Communications, vol. 25, no. 1, pp. 62–72, 2007.

    Article  MATH  Google Scholar 

  18. P. Flajolet, D. Gardy, and L. Thimonier, “Birthday paradox, coupon collectors, caching algorithms and self-organizing search,” Elsevier Discrete Applied Mathematics, vol. 39, no. 3, pp. 207–229, 1992.

    Article  MathSciNet  MATH  Google Scholar 

  19. F. Spitzer, Principles of random walk. Springer, 1964.

    Book  MATH  Google Scholar 

  20. H. Yu, “Sybil defenses via social networks: a tutorial and survey,” SIGACT News, vol. 42, no. 3, pp. 80–101, 2011.

    Article  Google Scholar 

  21. L. Alvisi, A. Clement, A. Epasto, S. Lattanzi, and A. Panconesi, “SoK: The evolution of sybil defense via social networks,” in IEEE Symposium on Security and Privacy, 2013, pp. 382–396.

    Google Scholar 

  22. L. Bilge, T. Strufe, D. Balzarotti, and E. Kirda, “All your contacts are belong to us: Automated identity theft attacks on social networks,” in Proc. of WWW, 2009, pp. 551–560.

    Google Scholar 

  23. L. Von Ahn, M. Blum, N. Hopper, and J. Langford, “CAPTCHA: Using hard AI problems for security,” pp. 294–311, 2003.

    Google Scholar 

  24. J. Leskovec, J. Kleinberg, and C. Faloutsos, “Graphs over time: Densification laws, shrinking diameters and possible explanations,” in Proc. of KDDWS, 2005, pp. 177–187.

    Google Scholar 

  25. Q. Cao, M. Sirivianos, X. Yang, and T. Pregueiro, “Aiding the detection of fake accounts in large scale social online services,” in Proc. of NSDI, 2012, pp. 1–14.

    Google Scholar 

  26. G. Danezis and P. Mittal, “SybilInfer: Detecting sybil nodes using social networks,” in Proc. of NDSS, 2009, pp. 1–15.

    Google Scholar 

  27. P. Fong, “Preventing Sybil Attacks by Privilege Attenuation: A design principle for social network systems,” in IEEE Symposium on Security and Privacy, 2011, pp. 263–278.

    Google Scholar 

  28. P. Denning, “Fault tolerant operating systems,” ACM Computing Surveys, vol. 8, no. 4, pp. 359–389, 1976.

    Article  MATH  Google Scholar 

  29. N. Tran, J. Li, L. Subramanian, and S. Chow, “Optimal Sybil-resilient node admission control,” in Proc. of IEEE INFOCOM, 2011, pp. 3218–3226.

    Google Scholar 

  30. Q. Cao and X. Yang, “SybilFence: Improving social-graph-based sybil defenses with user negative feedback,” CoRR, 2013.

    Google Scholar 

  31. P. Dandekar, A. Goel, R. Govindan, and I. Post, “Liquidity in credit networks: A little trust goes a long way,” in Proc. of ACM EC, 2011, pp. 147–156.

    Google Scholar 

  32. D. Tran, B. Min, J. Li, and L. Subramanian, “Sybil-Resilient online content voting,” in Proc. of NSDI, 2009, pp. 15–28.

    Google Scholar 

  33. B. Viswanath, M. Mondal, K. Gummadi, A. Mislove, and A. Post, “Canal: Scaling social network-based Sybil tolerance schemes,” in Proc. of EuroSys, 2012, pp. 309–322.

    Google Scholar 

  34. A. Mohaisen, N. Hopper, and Y. Kim, “Keep your friends close: Incorporating trust into social network-based sybil defenses,” in Proc. of IEEE INFOCOM, 2011, pp. 1943–1951.

    Google Scholar 

  35. R. Delaviz, N. Andrade, J. Pouwelse, and D. Epema, “SybilRes: A sybil-resilient flow-based decentralized reputation mechanism,” in Proc. of IEEE ICDCS, 2012, pp. 203–213.

    Google Scholar 

  36. B. Viswanath, A. Post, K. Gummadi, and A. Mislove, “An analysis of social network-based sybil defenses,” in Proc. of SIGCOMM, 2010, pp. 363–374.

    Google Scholar 

  37. W. Wei, F. Xu, C. Tan, and Q. Li, “SybilDefender: Defend against sybil attacks in large social networks,” in Proc. of IEEE INFOCOM, 2012, pp. 1951–1959.

    Google Scholar 

  38. L. Shi, S. Yu, W. Lou, and T. Hou, “SybilShield: An agent-aided social network-based sybil defense among multiple communities,” in Proc. of IEEE INFOCOM, 2013, pp. 1034–1042.

    Google Scholar 

  39. Z. Cai and C. Jermaine, “The latent community model for detecting sybils in social networks,” in Proc. of NDSS, 2012, pp. 1–13.

    Google Scholar 

  40. J. Xue, Z. Yang, X. Yang, X. Wang, L. Chen, and Y. Dai, “VoteTrust: Leveraging friend invitation graph to defend against social network sybils,” in Proc. of IEEE INFOCOM, 2013, pp. 2400–2408.

    Google Scholar 

  41. G. Wang, T. Konolige, C. Wilson, X. Wang, H. Zheng, and B. Zhao, “You are How You Click: Clickstream analysis for sybil detection,” in Proc. of USENIX, 2013, pp. 241–255.

    Google Scholar 

  42. J. Jiang, C. Wilson, X. Wang, P. Huang, W. Sha, Y. Dai, and B. Zhao, “Understanding latent interactions in online social networks,” in Proc. of IMC, 2010, pp. 369–382.

    Google Scholar 

  43. N. Dalal and B. Triggs, “Histograms of oriented gradients for human detection,” in Proc. of IEEE CVPR, 2005, pp. 886–893.

    Google Scholar 

  44. C. Hsu and C. Lin, “A comparison of methods for multiclass support vector machines,” IEEE Transactions on Neural Networks, vol. 13, no. 2, pp. 415–425, 2002.

    Article  Google Scholar 

  45. G. Wang, M. Mohanlal, C. Wilson, X. Wang, M. Metzger, H. Zheng, and B. Zhao, “Social turing tests: Crowdsourcing sybil detection,” in Proc. of NDSS, 2012, pp. 1–16.

    Google Scholar 

  46. H. Yu, C. Shi, M. Kaminsky, P. Gibbons, and F. Xiao, “DSybil: Optimal sybil-resistance for recommendation systems,” in IEEE Symposium on Security and Privacy, 2009, pp. 283–298.

    Google Scholar 

  47. W. Chang, J. Wu, C. Tan, and F. Li, “Sybil defenses in mobile social networks,” in Proc. of IEEE GLOBECOM, 2013, pp. 641–646.

    Google Scholar 

  48. D. Boneh and H. Shacham, “Group signatures with verifier-local revocation,” in Proc. of CCS, 2004, pp. 168–177.

    Google Scholar 

  49. T. Zhou, R. Choudhury, P. Ning, and K. Chakrabarty, “Privacy-preserving detection of sybil attacks in vehicular ad hoc networks,” in Proc. of MobiQuitous, 2007, pp. 1–8.

    Google Scholar 

  50. ——, “P2DAP - Sybil attacks detection in vehicular ad hoc networks,” IEEE Journal on Selected Areas in Communications, vol. 29, no. 3, pp. 582–594, 2011.

    Google Scholar 

  51. B. Triki, S. Rekhis, M. Chammem, and N. Boudriga, “A privacy preserving solution for the protection against sybil attacks in vehicular ad hoc networks,” in Proc. of WMNC, 2013, pp. 1–8.

    Google Scholar 

  52. K. Ren, H. Su, and Q. Wang, “Secret key generation exploiting channel characteristics in wireless communications,” IEEE Wireless Communications, vol. 18, no. 4, pp. 6–12, 2011.

    Article  Google Scholar 

  53. K. Ren, W. Lou, and Y. Zhang, “LEDS: Providing location-aware end-to-end data security in wireless sensor networks,” IEEE Transactions on Mobile Computing, vol. 7, no. 5, pp. 585–598, 2008.

    Article  Google Scholar 

  54. L. Xiao, L. Greenstein, N. Mandayam, and W. Trappe, “Channel-based detection of sybil attacks in wireless networks,” IEEE Transactions on Information Forensics and Security, vol. 4, no. 3, pp. 492–503, 2009.

    Article  Google Scholar 

  55. M. Demirbas and Y. Song, “An RSSI-based Scheme for Sybil Attack Detection in Wireless Sensor Networks,” in Proc. of WOWMOM, 2006, pp. 564–570.

    Google Scholar 

  56. S. Lv, X. Wang, X. Zhao, and X. Zhou, “Detecting the sybil attack cooperatively in wireless sensor networks,” in Proc. of CIS, 2008, pp. 442–446.

    Google Scholar 

  57. G. Guette and B. Ducourthial, “On the sybil attack detection in VANET,” in Proc. of MASS, 2007, pp. 1–6.

    Google Scholar 

  58. B. Yu, C. Xu, and B. Xiao, “Detecting sybil attacks in VANETs,” Journal of Parallel Distributed Compututing, vol. 73, no. 6, pp. 746–756, 2013.

    Article  Google Scholar 

  59. S. Abbas, M. Merabti, D. Llewellyn-Jones, and K. Kifayat, “Lightweight sybil attack detection in MANETs,” IEEE Systems Journal, vol. 7, no. 2, pp. 236–248, 2013.

    Article  Google Scholar 

  60. C. Piro, C. Shields, and B. Levine, “Detecting the sybil attack in mobile ad hoc networks,” in Proc. of SecureComm, 2006, pp. 1–11.

    Google Scholar 

  61. M. Mutaz, L. Malott, and S. Chellappan, “Leveraging platoon dispersion for sybil detection in vehicular networks,” in Proc. of PST, 2013, pp. 340–347.

    Google Scholar 

  62. S. Park, B. Aslam, D. Turgut, and C. Zou, “Defense against sybil attack in the initial deployment stage of vehicular ad hoc network based on roadside unit support,” Security and Communication Networks, vol. 6, no. 4, pp. 523–538, 2013.

    Article  Google Scholar 

  63. J. Newsome, E. Shi, D. Song, and A. Perrig, “The sybil attack in sensor networks: analysis and defenses,” in Proc. of IPSN, 2004, pp. 259–268.

    Google Scholar 

  64. Y. Reddy, “A game theory approach to detect malicious nodes in wireless sensor networks,” in Proc. of SENSORCOMM, 2009, pp. 462–468.

    Google Scholar 

  65. Q. Zhang, P. Wang, D. Reeves, and P. Ning, “Defending against sybil attacks in sensor networks,” in Proc. of IEEE ICDCS, 2005, pp. 185–191.

    Google Scholar 

  66. F. Li, P. Mittal, M. Caesar, and N. Borisov, “SybilControl: Practical sybil defense with computational puzzles,” CoRR, vol. abs/1201.2657, 2012.

    Google Scholar 

  67. E. Damiani, S. De Capitani di Vimercati, S. Paraboschi, and P. Samarati, “Managing and sharing servents’ reputations in P2P systems,” IEEE Transactions on Knowledge and Data Engineering, vol. 15, no. 4, pp. 840–854, 2003.

    Article  Google Scholar 

  68. S. Marti, T. Giuli, K. Lai, and M. Baker, “Mitigating routing misbehavior in mobile ad hoc networks,” in Proc. of MOBICOM, 2000, pp. 255–265.

    Google Scholar 

  69. J. Dinger and H. Hartenstein, “Defending the sybil attack in P2P networks: Taxonomy, challenges, and a proposal for self-registration,” in Proc. of ARES, 2006, pp. 756–763.

    Google Scholar 

  70. K. Zhang, X. Liang, R. Lu, and X. Shen, “Sybil Attacks and Their Defenses in the Internet of Things,” IEEE Internet of Things Journal, vol. 1, no. 5, pp. 372–383, 2014.

    Article  Google Scholar 

  71. X. Liang, X. Li, K. Zhang, R. Lu, X. Lin, and X. Shen, “Fully anonymous profile matching in mobile social networks,” IEEE Journal on Selected Areas in Communications, vol. 31, no. 9, pp. 641–655, 2013.

    Article  Google Scholar 

  72. J. Scott, R. Gass, J. Crowcroft, P. Hui, C. Diot, and A. Chaintreau, “CRAWDAD trace cambridge/haggle/imote/infocom (v. 2006-01-31),” Jan. 2006.

    Google Scholar 

  73. D. Boneh, C. Gentry, B. Lynn, and H. Shacham, “Aggregate and verifiably encrypted signatures from bilinear maps,” in Proc. of EUROCRYPT, 2003.

    Google Scholar 

  74. D. Zhang, D. G. Perez, S. Bengio, and I. McCowan, “Semi-supervised adapted HMMs for unusual event detection,” in Proc. of CVPR, 2005, pp. I: 611–618.

    Google Scholar 

  75. D. Reynolds, T. Quatieri, and R. Dunn, “Speaker verification using adapted gaussian mixture models,” Digital Signal Processing, vol. 10, no. 1–3, pp. 19–41, 2000.

    Article  Google Scholar 

  76. C. Bron and J. Kerbosch, “Finding all cliques of an undirected graph (algorithm 457),” Commun. ACM, vol. 16, no. 9, pp. 575–576, 1973.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Zhang, K., Shen, X. (2015). Health Data Sharing with Misbehavior Detection. In: Security and Privacy for Mobile Healthcare Networks. Wireless Networks. Springer, Cham. https://doi.org/10.1007/978-3-319-24717-5_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-24717-5_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-24715-1

  • Online ISBN: 978-3-319-24717-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics