TCSC: A Trustworthy and Communal Social Classifieds
Keywords:P2P, decentralized search/retrieval, probabilistic analysis, distributed systems, trustworthiness, statistical inference
Today, everyone relies heavily on the Internet to access information, and it changes the way we live, including our use of social networking services and community-based classified systems. However, two major problems lurk behind both social networking and community-based classified systems. privacy and security. First, the current systems could be modified someday to filter, conceal or censor information. Second, the anonymity inherent in the community-based classifieds does not provide any safeguard to the users.In order to address the privacy concerns and give better protection to the users, we present a trustworthy and communal social classifieds, named TCSC, in this paper. Our TCSC is a decentralized communal social classifieds infrastructure, and it contains: 1) distributed search and retrieval system, 2) reputation system, 3) protection system, and 4) randomized message routing system. We further demonstrate that our TCSC can accurately and retain significant utility even in the presence of malicious nodes.
(1) 2Peer (n.d.), http://2peer.com. Accessed: Mar. 20, 2015.
(2) Bamman, D., O’Connor, B. & Smith, N. (2012), ‘Censorship and deletion practices in chinese social media’, First Monday 17(3).
(3) Bianchi, S., Felber, P. & Gradinariu, M. (August 2007), Content-based publish/subscribe using distributed r-trees, in ‘Proceedings of Euro-Par’, Rennes, France, pp. 537–548.
(4) Buchegger, S. & Le Boudec, J.-Y. (2004), A robust reputation system for peer-to-peer and mobile ad-hoc networks, in ‘Proceedings of P2PEcon’, Vol. 2004.
(5) Buchegger, S., Schioberg, D.,Vu, L.-H.&Datta, A. (2009), Peerson: P2p social networking: early experiences and insights, in ‘Proceedings of the Second ACM EuroSys Workshop on Social Network Systems’, ACM, pp. 46–52.
(6) Chuang, Y. T., Melliar-Smith, P. M., Moser, L. E. & Lombera, I. M. (March 2015),‘Maintaining censorship resistance in the itrust network for publication, search and retrieval’, Peer-to-Peer Networking and Applications 8(2), 1–18.
(7) Chuang, Y. T., Melliar-Smith, P. M., Moser, L. E. & Lombera, I. M. (September 2012),‘Protecting the iTrust information retrieval network against malicious attacks’, Journal of Computing Science and Engineering 6(3), 179–192.
(8) Clarke, I., Sandberg, O.,Wiley, B. & Hong,T. (July 2001), Freenet: A distributed anonymous information storage and retrieval system, in ‘Proceedings of the Workshop on Design Issues in Anonymity and Unobservability’, Springer, Berkeley,
CA, pp. 46–66.
(9) Condie, T., Kamvar, S. D. & Garcia-Molina, H. (August 2004), Adaptive peer-to-peer topologies, in ‘Proceedings of the 4th IEEE International Conference on Peer-to-Peer Computing’, Zurich, Switzerland, pp. 53–62.
(10) Cutillo, L. A., Molva, R. &Strufe, T. (2009), ‘Safebook: A privacy-preserving online social network leveraging on real-life trust’, Communications Magazine, IEEE 47(12), 94–101.
(11) Damiani, E., di Vimercati, D. C., Paraboschi, S., Samarati, P. & Violante, F. (2002), A reputation-based approach for choosing reliable resources in peer-to-peer networks, in‘Proceedings of the 9th ACM Conference on Computer and Communications Security’, pp. 207–216.
(12) Feller, W. (1968), An Introduction to Probability Theory and Its Applications, Vol. I, John Wiley & Sons.
(13) Ferreira, R. A., Ramanathan, M. K., Awan, A., Grama, A. & Jagannathan, S. (August 2005), Search with probabilistic guarantees in unstructured peer-to-peer networks, in ‘Proceedings of 5th IEEE International Conference on Peer-to-Peer Computing’, Konstanz, Germany, pp. 165–172.
(14) Gnutella, http://en.wikipedia.org/wiki/Gnutella. Accessed: Mar. 20, 2015.
(15) Guo, S., Wang, M. & Leskovec, J. (2011), The role of social networks in online shopping: information passing, price of trust, and consumer choice, in ‘Proceedings of the 12th ACM conference on Electronic commerce’, ACM, pp. 157–166.
(16) Gupta, A., Sahin, O. D., Agrawal, D. & El Abbadi, A. (2004), Meghdoot: Content-based publish/subscribe over P2P networks, in ‘Proceedings of the 5th ACM/IFIP/USENIX International Conference on Middleware’, Toronto, Canada, pp. 254–273.
(17) Hu, J. & Burmester, M. (2009), Cooperation in mobile ad hoc networks, in ‘Guide to Wireless Ad Hoc Networks’, Springer, pp. 43–57.
(18) Jesi, G. P., Hales, D.&Van Steen, M. (July 2007), Identifying malicious peers before it’s too late: A decentralized secure peer sampling service, in ‘Proceedings of the 1st International Conference on Self-Adaptive and Self-Organizing Systems’, Boston, MA, pp. 237–246.
(19) Kavianpour, S., Ismail, Z., & Mohtasebi, A. (2011). Preserving Identity of Users In Social Network Sites By Integrating Anonymization And Diversification Algorithms. International Journal of Digital Information and Wireless Communications (IJDIWC), 1(1), 32-40.
(20) Leng, C., Terpstra,W.W., Kemme, B., Stannat,W. & Buchmann, A. P. (2008), Maintaining replicas in unstructured P2P systems, in ‘Proceedings of the 4th International Conference on Emerging Networking Experiments and Technologies’, Madrid, Spain, pp. 19–30.
(21) Mischke, J. & Stiller, B. (2004), ‘A methodology for the design of distributed search in P2P middleware’, IEEE Network 18(1), 30–37.
(22) Mislove, A., Post, A., Haeberlen, A. & Druschel, P. (2006), Experiences in building and operating epost, a reliable peer-to-peer application, in ‘ACM SIGOPS Operating Systems Review’, Vol. 40, ACM, pp. 147–159.
(23) Morselli, R., Bhattacharjee, B., Srinivasan, A.&Marsh, M. A. (July 2005), Efficient lookup on unstructured topologies, in ‘Proceedings of the 24th ACM Symposium on Principles of Distributed Computing’, Las Vegas, NV, pp. 77–86.
(24) Om, S., & Talib, M. (2011). Wireless Ad-hoc Network under Black-hole Attack. International Journal of Digital Information and Wireless Communications (IJDIWC), 1(3), 591-596.
(25) Press, W. H., Teukolsky, S. A.,Vetterling,W. T.&Flannery, B. P. (2007), Numerical Recipes in Fortran: The Art of Scientific Computing, Cambridge University Press, Cambridge, United Kingdom.
(26) Seong, S.-W., Seo, J., Nasielski, M., Sengupta, D., Hangal, S., Teh, S. K., Chu, R., Dodson, B. & Lam, M. S. (2010), Prpl: a decentralized social networking infrastructure, in Proceedings of the 1st ACMWorkshop on Mobile Cloud Computing & Services: Social Networks and Beyond’, ACM, p. 8.
(27) Shakimov, A., Lim, H., Caceres, R., Cox, L. P., Li, K., Liu, D. & Varshavsky, A. (2011), Vis-a-vis: Privacy-preserving online social networking via virtual individual servers, in ‘Communication Systems and Networks (COMSNETS), 2011 Third International Conference on’, IEEE, pp. 1–10.
(28) Story, L. & Stone, B. (2007), ‘Facebook retreats on online
tracking’, The New York Times 30.
(29) Terpstra, W. W., Kangasharju, J., Leng, C. & Buchmann, A. P. (2007), Bubblestorm: Resilient, probabilistic, and exhaustive peer-to-peer search, in ‘Proceedings of the ACM Conference on Applications, Technologies, Architectures and Protocols for Computer Communications’, Kyoto, Japan, pp. 49–60.
(30) The Diaspora Project (n.d.), https://diasporafoundation.org/. Accessed: Mar. 20, 2015.
(31) Tran, D. A. & Pham, C. (August 2010), ‘Enabling content-based publish/subscribe services in cooperative P2P networks’, Computer Networks: The International Journal of Computer and Telecommunications Networking 52(11), 1739–1749.
(32) Verma, P. (2013), Serefind: a social networking website for classifieds, in ‘Proceedings of the 22nd international conference on World Wide Web companion’, International World Wide Web Conferences Steering Committee, pp. 289–292.
(33) Verma, P. (2014), Serefind: a crowd-powered search engine, in ‘Proceedings of the companion publication of the 17th ACM conference on Computer supported cooperative work & social computing’, ACM, pp. 297–300.
(34) Viinikka, J. & Debar, H. (2004), Monitoring IDS background noise using EWMA control charts and alert information, in ‘Proceedings of the 7th International Symposium on Recent Advances in Intrusion Detection’, French Riviera, France, pp. 166–187.