Skip to main content
SpringerLink
Log in

A quality model for social networks populated with web services

  • Original Research Paper
  • Published:
Service Oriented Computing and Applications Aims and scope Submit manuscript

Abstract

This paper presents the development and evaluation of a \(\mathcal {Q}\)o\(\mathcal {SN}\) (standing for \(\mathcal {Q}\)uality of \(\mathcal {S}\)ocial \(\mathcal {N}\)etwork) model for social networks populated with Web services. These Web services are given the opportunity to select the networks in which they would like to sign in taking into account their concerns (in fact their providers’ concerns) like better protection to their details and better exposure to potential users. To support Web services selection, the \(\mathcal {Q}\)o\(\mathcal {SN}\) model is built upon four criteria including robustness, trust, fairness, and traceability. The computation of these criteria uses a cryptographic technique known as secure multi-party computation. Different experiments showing how the networks react to Web services’ actions (e.g., attack, join, and kick out) are also presented in the paper.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

Notes

  1. Quality of Service (QoS) is adopted in other disciplines like networking and uses non-functional properties like response time, reliability level, and latency.

  2. It is worth noticing that robustness was called privacy in [17]. In this paper, we rename it to avoid overlap with the privacy property that SMC guarantees (Sect. 4).

  3. Repetitive and considerable gaps between a Web service announced-QoS and effective-QoS might indicate performance degradation and inability of delivering the announced QoS [25].

  4. http://www.cs.huji.ac.il/project/Fairplay/FairplayMP/SFDL2.0.

  5. FairPlay allows to write secure functions that deal with integers, only. Thus, in the implementation, we round each ratio to an integer. In particular, each decimal number is multiplied by 10, and then rounded to the next integer, if bigger or equal to .5 (otherwise, to the previous one).

  6. Despite the division is performed out of the SMC-function, inputs of all SWSs are kept preserved by the function 1.

  7. It is worth noticing that comparisons between a threshold value and the actual attackRatio of SWSs may be done by an appropriate use of secure two-party computation.

  8. A confidence interval gives an estimated range of values which is likely to include an unknown population parameter, the estimated range being calculated from a given set of sample data (http://www.stat.yale.edu/Courses/1997-98/101/confint.htm).

References

  1. Al-Sharawneh J, Williams M-A (2009) A social network approach in semantic web services selection using follow the leader behavior. In: Proceedings of the 13th enterprise distributed object computing conference workshops (EDOCW’2009), Auckland, New Zealand

  2. Audun J, Ismail R, Boyd C (2007) A survey of trust and reputation systems for online service provision. Decis Support Syst 43(2):618–644

    Article  Google Scholar 

  3. Badr Y, Maamar Z (2009) Can enterprises capitalize on their social networks? Cutter IT J 22(10):10–14

    Google Scholar 

  4. Bansal S, Bansal A, Blake MB (2010) Trust-based dynamic web service composition using social network analysis. In: Proceedings of the international workshop on business applications for social network analysis (BASNA’2010) held in conjunction with the fourth international conference on internet multimedia systems architecture and applications (IMSAA’2010), Bangalore, India

  5. Beaver D, Micali S, Rogaway P (1990) The round complexity of secure protocols. In: Proceedings of the twenty-second annual ACM symposium on theory of computing (STOC’1990), Baltimore, MD, USA

  6. Ben-David A, Nisan N, Pinkas B (2008) FairplayMP: A system for secure multi-party computation. In: Proceedings of the 15th ACM conference on computer and communications security (CCS’2008), New York, NY, USA

  7. Bistarelli S, Foley SN, O’Sullivan B, Santini F (2010) Semiring-based frameworks for trust propagation in small-world networks and coalition formation criteria. Secur Commun Netw 3(6):595–610

    Article  Google Scholar 

  8. Bogetoft P, Christensen DL, Damgård I, Geisler M, Jakobsen TP, Krøigaard M, Dam Nielsen J, Buus Nielsen J, Nielsen K, Pagter J, Schwartzbach MII, Toft T (2009) Secure multiparty computation goes live. In: Proceedings of 13th international conference on financial cryptography and data security (FC’2009), Accra Beach, Barbados

  9. Bruno G, Dengler F, Jennings B, Khalaf R, Nurcan S, Prilla M, Sarini M, Schmidt R, Silva R (2010) Key challenges for enabling agile BPM with social software. J Softw Maint Evol Res Pract 22(6–7):297–326

    Google Scholar 

  10. Chen W, Paik I (2012) Improving efficiency of service discovery using linked data-based service publication. Inf Syst Front Spinger (forthcoming)

  11. Drupad S (2008) Enterprise Web 2.0 Worth \(\$4.6\) Billion in 2013, Visited September 2008. Searchviews, 21 April 2008. www.searchviews.com/index.php/archives/2008/04/enterprise-web-20-worth-46-billion-in-2013.php

  12. Elnaffar S, Maamar Z, Sheng QZ (April-June 2013) When clouds start socializing: the sky model. Int J E-Bus Res IGI Global Pub 9(2):1–7

  13. Goldreich O, Micali S, Wigderson A (1987) How to play any mental game. In: Proceedings of the nineteenth annual ACM symposium on theory of computing, STOC ’87

  14. Maamar Z, Faci N, Boukadi K, Sheng QZ, Yao L (2014) Commitments to regulate social web services operation. IEEE Trans Serv Comput (forthcoming)

  15. Maamar Z, Faci N, Krug Wives L, Badr Y, Bispo Santos P, de Oliveira Palazzo MJ (2011) Using social networks to web services discovery. IEEE Internet Comput 15(4):48–54

    Google Scholar 

  16. Maamar Z, Faci N, Krug Wives L, Yahyaoui H, Hacid H (2011) Towards a method for engineering social web services. In: Proceedings of the IFIP WG8.1 working conference on method engineering (ME’2011), Paris, France

  17. Maamar Z, Faci N, Loo A, Ghodous P (2012) Towards a quality of social network (QoSN) model in the context of social web services. In: The proceedings of the 3rd international conference of exploring services science (IESS’2012), Geneva, Switzerland

  18. Maamar Z, Faci N, Luck M, Hachimi S (2012) Specifying and implementing social web services operation using commitments. In: The proceedings of the 27th annual ACM symposium on applied computing (SAC’2012), Riva del Garda, Trento, Italy

  19. Maamar Z, Faci N, Sheng QZ, Yao L (2012) Towards a user-centric social approach to web services composition, execution, and monitoring. In: Proceedings of the 13th international conference on web information system engineering (WISE’2012), Paphos, Cyprus

  20. Maamar Z, Hacid H, Hunhs MN (2011) Why web services need social networks. IEEE Internet Comput 15(2):90–94

    Google Scholar 

  21. Maamar Z, Krug Wives L, Badr Y, Elnaffar S, Boukadi K, Faci N (2011) LinkedWS: A novel web services discovery model based on the metaphor of “Social Networks”. Simul Model Pract Theory 19(10):121–132

    Google Scholar 

  22. Maamar Z, Yahyaoui H, Lim E, Thiran P (2011) Social Engineering of Communities of Web Services. In: Proceedings of the 11th annual international symposium on applications and the internet (SAINT’2011), Munich, Germany

  23. Maaradji A, Hacid H, Daigremont J, Crespi N (2010) Towards a Social Network Based Approach for Services Composition. In: Proceedings of the 2010 IEEE international conference on communications (ICC’2010), Cap Town, South Africa

  24. Malkhi D, Nisan N, Pinkas B, Sella Y (2004) Fairplay: a secure two-party computation system. In: Proceedings of the 13th conference on USENIX security symposium (SSYM’2004), Berkeley, CA, USA

  25. Medjahed B, Rezgui A, Bouguettaya A, Ouzzani M (2003) Infrastructure for e-government web services. IEEE Internet Comput 7(1):58–65

    Article  Google Scholar 

  26. Nam Ko M, Cheek GP, Shehab M, Sandhu R (2010) Social-networks connect services. IEEE Comput 43(8):37–43

    Google Scholar 

  27. Orlandi C (2011) Is multiparty computation any good in practice? In: Proceedings of the IEEE international conference on acoustics, speech, and signal processing (ICASSP’2011), Prague, Czech Republic

  28. Papadimitriou P, Garcia-Molina H (2011) Data leakage detection. IEEE Trans Knowl Data Eng 23(1):51–63

    Google Scholar 

  29. Pinkas B, Schneider T, Smart NP, Williams SC (2009) Secure two-party computation is practical. In: Proceedings of the 15th international conference on the theory and application of cryptology and information security: advances in cryptology (ASIACRYPT’2009), Tokyo, December

  30. Rubin S, Jha S, Miller BP (2004) Automatic generation and analysis of NIDS attacks. In: Proceedings of the 20th annual computer security applications conference (ACSAC’2004), Tucson, Arizona, USA

  31. Schmidt R, Nurcan S (2008) BPM and Social Software. In: Proceedings of the first workshop on business process management and social software (BPMS2’2008), Milan, Italy

  32. Wu Q, Iyengar A, Subramanian R, Rouvellou I, Silva-Lepe I, Mikalsen T (2009) Combining quality of service and social information for ranking services. In: Proceedings of ServiceWave 2009 workshops held in conjunction with the 7th international conference on service service-oriented computing (ICSOC’2009), Stockholm, Sweden

  33. Xie X, Du B, Zhang Z (2008) Semantic service composition based on social network. In: Proceedings of the 17th international world wide web conference (WWW’2008), Beijing, China

  34. Yao AC-C (1986), How to generate and exchange secrets. In: Proceedings of the 27th annual symposium on foundations of computer, science (SFCS’1986), October 1986

Download references

Author information

Authors and Affiliations

  1. Université Lyon 1, Lyon, France

    Noura Faci

  2. Istituto di Informatica e Telematica, CNR, Pisa, Italy

    Marinella Petrocchi, Gianpiero Costantino & Fabio Martinelli

  3. Zayed University, Dubai, UAE

    Zakaria Maamar

Authors
  1. Noura Faci
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marinella Petrocchi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gianpiero Costantino
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Fabio Martinelli
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Zakaria Maamar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zakaria Maamar.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Faci, N., Petrocchi, M., Costantino, G. et al. A quality model for social networks populated with web services. SOCA 9, 139–155 (2015). https://doi.org/10.1007/s11761-014-0156-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11761-014-0156-8

Keywords

Search

Navigation