Czasopismo | PRZEGLĄD TELEKOMUNIKACYJNY - WIADOMOŚCI TELEKOMUNIKACYJNE | Rocznik 2016 - zeszyt 8-9

Reputacja i zaufanie w systemach teleinformatycznych z podmiotami anonimowymi - podejście dynamiczne

10.15199/59.2016.8-9.1

Jerzy Konorski

nr katalogowy: 100726
10.15199/59.2016.8-9.1

Abstrakcją współczesnego systemu teleinformatycznego jest system wieloagentowy z autonomicznymi, racjonalnymi i wirtualnie anonimowymi agentami wchodzącymi we wzajemne interakcje dla wymiany usług. Uzasadniono konieczność projektowania dla niego podsystemu budowy reputacji i zaufania oraz odpowiednich analiz w ujęciu dynamicznym. Dokonano przeglądu motywacyjnie zgodnych mechanizmów uczciwego raportowania usług oraz omówiono dynamikę zachowań i miar zaufania agentów w zależności od polityki wyboru partnerów w interakcjach i polityki świadczenia usług. Słowa kluczowe: systemy wieloagentowe, zaufanie, reputacja, dynamika zachowań, racjonalność, zgodność motywacyjna, teoria gier.We współczesnych systemach ICT (Information and Communication Technology) rozpowszechnia się mikroekonomiczny paradygmat projektowania.Według niego hierarchiczne zarządzanie ustępuje miejsca motywacyjnie zgodnej (tj. wzajemnie korzystnej) współpracy elementów systemu. Wśród licznych zwiastunów paradygmatu mikroekonomicznego w systemach teleinformatycznych należy wymienić m.in. bezprzewodowe sieci sensorowe i ad hoc [36], sieci radia kognitywnego [33], współdzielenie licencjonowanych pasm elektromagnetycznych w systemach LTE [70], sieci zdefiniowane programowo [80], środowiska rozproszone typu Crowd Assisted Sensing [10] i Fog Computing [4], systemy dystrybucji treści o architekturach typu peer-to-peer (P2P) i sieci informacjo-centryczne [1], platformy Economic Traffic Management dla sieci nakładkowych [34] oraz nowatorskie architektury proponowane w ramach szeroko rozumianego Internetu przyszłości. W niniejszym tekście, dalekim od wyczerpującego omówienia zagadnienia, podjęto próbę spojrzenia na główne motywacje oraz wybrane koncepcje związane z budową reputacji i zaufania w takich systemach. Stosowną abstrakcją systemu teleinformatycznego w paradygmacie mikroekonomicznym jest system wieloagentowy - społeczność inteligentnych agentów, które okazjonalnie w[...]

Bibliografia

[1] Ahlgren B., C. Dannewitz, C. Imbrenda, D. Kutscher, B. Ohlman. 2012 "A survey of information-centric networking". IEEE Comm. Magazine 50 (7) : 26-36.
[2] Amazon website, http://www.amazon.com/.
[3] Boero R., G. Bravo, M. Castellani, F. Squazzoni. 2009. "Reputational cues in repeated trust games". J. Socio-Economics 38 : 871-877.
[4] Bonomi F., R. Milito, J. Zhu, S. Addepalli. 2012. "Fog computing and its role in the Internet of things," Proc. 1st Workshop on Mobile Cloud Computing, Helsinki, Finland.
[5] Brown J., J. Morgan. 2006. “Reputation in online auctions: the market for trust". Calif. Manag. Rev. 49 (1) : 61-81.
[6] Buchegger S., J.-Y. Le Boudec. 2002. “Performance analysis of the CONFIDANT protocol," Tech. Rep. IC/2002/01, Swiss Federal Institute of Technology, Lausanne, Switzerland.
[7] Buttyan L., J.-P. Hubaux. 2001. “Rational exchange - a formal model based on game theory". Springer LNCS 2232 : 114-126.
[8] V. Cahill et al. 2003. “Using trust for secure collaboration in uncertain environments". IEEE Pervasive Computing, 2 (3) : 52-61.
[9] Callaud B., E. B. Hermalin. 2002. “Hidden action and incentives". Working Paper, Berkeley University.
[10] Campbell A. et al. 2008. “The rise of people-centric sensing". IEEE Internet Computing, 12 (4) : 12-21.
[11] Cao J., W. Yu, Y. Qu. 2006. “A new complex network model and convergence dynamics for reputation computation in virtual organizations". Physics Letters A 356 (6) : 414-425.
[12] Chen T. M., V. Venkataramanan. 2005. “Dempsteřr-Shafer Theory for intrusion detection in ad hoc networks". IEEE Internet Computing 9 (6) : 35-41.
[13] Chen R., X. Zhao, L. Tang, J. Hu, Z. Chen. 2007. “CuboidTrust: a global reputation-based trust model in peer-to-peer networks". Springer LNCS 4610 : 203-215.
[14] Damiani E., D. C. di Vimercati, S. Paraboschi, P. Samarati, F. Violante. 2002. “A reputation-based approach for choosing reliable resources in peer-to-peer networks". Proc. 9th ACM CCS, New York.
[15] Dellarocas C. 2000. “Immunizing online reputation reporting systems against unfair ratings and discriminatory behavior". Proc. 2nd ACM Conf. on Electronic Commerce, Minneapolis, MN.
[16] Douceur J. R.. 2002. “The Sybil attack". Proc. 1st IPTPS ‘01, revised papers. Springer.
[17] eBay website, http://ebay.com/.
[18] Ekmekci M. 2006. “Sustainable reputations with rating systems". Mimeo, Princeton Univ.
[19] Epinions website, http://www.epinions.com/.
[20] eRep website, http://megatron.iiia.csic.es/eRep.
[21] Feldman M., J. Chuang, I. Stoica, S. Shenker. 2007. “Hidden-action in network routing". IEEE J. Selected Areas in Communications 25 (6) : 1161-1172.
[22] Feng J., G. Lu, Z. Bao, G. Zhang. 2014. “Supporting trustworthy cooperative spectrum sensing cognitive radio networks". J. Computational Information Systems 10 (10) : 4307-4318.
[23] Fischer M. J., N. A. Lynch, M. S. Paterson. 1985. “Impossibility of distributed consensus with one faulty process". JACM 32 (2) : 374-382.
[24] Fudenberg D., J. Tirole. 1991. Game Theory. The MIT Press.
[25] Fudenberg D., D. K. Levine. 1998. The Theory of Learning in Games. The MIT Press.
[26] Fullam K. K. et al. 2005. “A specification of the Agent Reputation and Trust (ART) testbed: experimentation and competition for trust in agent societies". Proc. 4th AAMAS, Utrecht, The Netherlands.
[27] Fullam K. K., K. S. Barber. 2006. “Learning trust strategies in reputation exchange networks". Proc. 5th AAMAS, Hakodate, Japan.
[28] Głowacka J., M. Amanowicz, M. Głowacki. 2015. “Robustness of trust-based protection (TUBE) scheme to reputation attacks in military mobile ad-hoc networks". Proc. ICMCIS, Cracow, Poland.
[29] Gomez Marmol F., G. Martinez Perez. 2010. “State of the art in trust and reputation models in P2P networks". In: Handbook of Peer-to-Peer Networking, X. Shen, H. Yu, J. Buford, and M. Akon, Eds. Springer.
[30] Grandison T., M. Sloman. 2000. “A survey of trust in internet applications". IEEE Comm. Surveys & Tutorials 3 (4th Quarter) : 2-16.
[31] Grubshtein A., N. Gal-Oz, T. Grinshpoun, A. Meisels, R. Zivan. 2010. “Manipulating recommendation lists by global considerations", Proc. 2nd ICAART, Valencia, Spain.
[32] Harmon A. 2004. “Amazon glitch unmasks war of reviewers". The New York Times (http://www.nytimes.com/2004/02/14/us/amazon-glitchunmasks- war-of-reviewers.html).
[33] Hassan M. R., G. Karmakar, J. Kamruzzaman. 2014. “Reputation and user requirement based price modeling for dynamic spectrum access". IEEE Trans. Mobile Comput. 13 (9) : 2128-2140.
[34] Hecht F., B. Stiller. 2012. “Economic Traffic Management: mechanisms and applications". Springer LNCS 7216 : 188-198.
[35] Hendrikx F., K. Bubendorfer, R. Chard. 2015. “Reputation systems: a survey and taxonomy". J. Parallel and Distrib. Comput. 75 : 184-197.
[36] Hoffman K., D. Zage, C. Nita-Rotaru. 2009. “A survey of attack and defense techniques for reputation systems". ACM Computing Surveys 42 (1).
[37] Hui Z., A. Goel, R. Govindan, K. Mason, B. Van Roy. 2004. “Making eigenvector-based reputation systems robust to collusion". In: Algorithms and Models for the Web-Graph, S. Leonardi, Ed., Springer LNCS 3243 : 92-104.
[38] Huynh T. D., N. R. Jennings, N. R. Shadbolt. 2006. “Certified reputation: how an agent can trust a stranger," Proc. 5th AAMAS, Hakodate, Japan.
[39] Janiszewski M. 2014. “The oracle: a new intelligent cooperative strategy of attacks on trust and reputation systems". Annales UMCS Informatica 14 (2) : 86-102.
[40] Jiang T., J. S. Baras. 2006. “Trust evaluation in anarchy: A case study on autonomous networks". Proc. 25th IEEE INFOCOM, Barcelona, Spain.
[41] Jřsang A., S. Lo Presti. 2004. “Analysing the relationship between risk and trust". Springer LNCS 2995 : 135-145.
[42] Jřsang A., R. Ismail, C. Boyd. 2007. “A survey of trust and reputation systems for online service provision". Decision Support Systems 43 : 618-644.
[43] Jurca R., B. Faltings. 2003. “An incentive compatible reputation mechanism". Proc. 2nd AAMAS, Melbourne, Australia.
[44] Jurca R., B. Faltings. 2007. “Collusion-resistant, incentive-compatible feedback payments". Proc. 8th ACM Conf. on Electronic Commerce, San Diego, CA.
[45] Kalai E., E. Lehrer. 1993. “Rational learning leads to Nash equilibrium". Econometrica 61 : 1019-1045.
[46] Kamvar S. D., M. T. Schlosser, H. Garcia-Molina. 2003. “The EigenTrust algorithm for reputation management in P2P networks". Proc. 12th Int. Conf. on World Wide Web, Budapest, Hungary.
[47] Kerr R., R. Cohen. 2009. “Smart cheaters do prosper: defeating trust and reputation systems". Proc. 8th AAMAS, Budapest, Hungary.
[48] Khosravifara B., J. Bentahara, M. Alishahia, M. Gomrokchia. 2011. “Collusion-resistant reputation mechanism for multi-agents systems", Procedia Computer Science 5 : 181-189.
[49] Konorski J., R. Orlikowski. 2010. “A reputation system for MANETs and WSNs using traffic shedding". Proc. 3rd Int. Symp. on Applied Sciences in Biomedical and Comm. Technologies, Rome, Italy.
[50] Konorski J. 2016. “Trust dynamics analysis of CTR scheme subversion under virtual anonymity and trust-unaware partner selection". Proc. 18th Int. Workshop on Trust in Agent Societies, Singapore.
[51] Konorski J. 2016. “Dynamika miar zaufania w teleinformatycznym systemie wieloagentowym". Mat. KSTiT, Gliwice, Poland.
[52] Koutrouli E., A. Tsalgatidou. 2012. “Taxonomy of attacks and defense mechanisms in P2P reputation systems—Lessons for reputation system designers". Computer Science Rev. 6 (2-3) : 47-70.
[53] Laureti P., L. Moret, Y.-C. Zhang, Y.-K. Yu. 2006. “Information filtering via iterative refinement". Europhys. Lett. 75 (6) : 1006-1012.
[54] Liu J., V. Issarny. 2006. “An incentive compatible reputation mechanism for ubiquitous computing environments". Proc. Int. Conf. on Privacy, Security and Trust, Markham, Canada.
[55] Liu Y., Y. Yang, Y. L. Sun. 2008. “Detection of collusion behaviors in online reputation systems". Proc. 42nd Asilomar Conf. on Signals, Systems and Computers, Pacific Grove, CA.
[56] Liu Q. 2011. “Information acquisition and reputation dynamics". Review of Economic Studies 78 (4) :1400-1425.
[57] Liu S., J. Zhang, C. Miao, Y. Theng, A. Kot. 2011. “iCLUB: an integrated clustering based approach to improve the robustness of reputation systems". Proc. 10th AAMAS, Taipei, Taiwan.
[58] Malik Z., A. Bouguettaya. 2009. “RATEWeb: Reputation assessment for trust establishment among Web services". VLDB J. 18 (4) : 885- 911.
[59] Michiardi P., R. Molva. 2002. “CORE: A collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks". Proc. 6th IFIP Comm. and Multimedia Security Conf., Portoroz, Slovenia.
[60] Miller N., P. Resnick, R. Zeckhauser. 2005. “Eliciting informative feedback: the peer-prediction method". Management Science 51 (9) :1359-1373.
[61] Mui L., M. Mohtashemi, A. Halberstadt. 2002. “A computational model of trust and reputation". Proc. 35th Annual Hawaii Int. Conf. on System Sciences, Waikoloa Village, HI.
[62] Nisan N., T. Roughgarden, E. Tardos, V. V. Vazirani, Eds. 2007. Algorithmic Game Theory. Cambridge University Press.
[63] Nowak M. A., K. Sigmund. 1998. “Evolution of indirect reciprocity by image scoring". Nature 393 : 573-577.
[64] Nowak M. A., K. Sigmund. 2005. “Evolution of indirect reciprocity". Nature 437 : 1291-1298.
[65] Ohtsuki H., Y. Iwasa. 2004. “How should we define goodness?-reputation dynamics in indirect reciprocity," J. Theor. Biol. 231 : 107-120.
[66] Orman L. V. 2010. “Transitivity and aggregation in trust networks". Proc. Workshop on Information Technology and Systems, St. Louis, MO.
[67] Pagnia H., F. C. Gaertner. 1999. “On the impossibility of fair exchange without a trusted third party". Tech. Rep., Darmstadt Univ. of Technology.
[68] Page L. 2001. “Method for node ranking in a linked database". Patent US 09/004,827.
[69] Papaioannou T. G., G. D. Stamoulis. 2005. “An incentives’ mechanism promoting truthful feedback in peer-to-peer systems". Proc. IEEE Int. Symp. on Cluster Computing and the Grid, Cardiff, UK.
[70] Peha J.. 2005. “Approaches to spectrum sharing". IEEE Comm. Magazine 43 (2) : 10-12.
[71] Peleteiro A., J. C. Burguillo, S. Y. Chong. 2014. “Exploring indirect reciprocity in complex networks using coalitions and rewiring". Proc. 13th AAMAS, Paris, France.
[72] Pinyol I., J. Sabater-Mir. 2013. “Computational trust and reputation models for open multi-agent systems: a review". Artif. Intel. Rev. 40 (1) : 1-25.
[73] Rapoport A. 1967. “Escape from paradox". Scientific American 217 (1) : 50-56.
[74] Rasmusson L., S. Janssen. 1996. “Simulated social control for secure Internet commerce". Proc. ACM New Security Paradigms Workshop, Lake Arrowhead, CA.
[75] Resnick P., R. Zeckhauser, E. Friedman, K. Kuwabara. 2000. “Reputation systems". Comm. ACM 43 (12) : 45-48.
[76] Saavedra S., D. Smith, F. Reed-Tsochas. 2010. “Cooperation under indirect reciprocity and imitative trust". PLoS ONE 5(10): e13475.
[77] Sabater J., C. Sierra. 2001. “REGRET: A reputation model for gregarious societies". Proc. 4th Int. Workshop on Deception, Fraud and Trust in Agent Societies, Montreal, Canada.
[78] Seigneur J.-M. et al. 2004. “End-to-end trust starts with recognition". Springer LNCS 2802 : 130-142.
[79] Selten R. 1998. “Axiomatic characterization of the quadratic scoring rule". Experimental Economics 1(1) : 43-62.
[80] “Software-Defined Networking: the new norm for networks". 2012. White paper, Open Networking Foundation.
[81] Song S., K. Hwang, R. Zhou, Y.-K. Kwok. 2005. “Trusted P2P transactions with fuzzy reputation aggregation". IEEE Internet Computing 9 (6) : 24-34.
[82] Sun Y. L., Wei Yu, Zhu Han, K. J. Ray Liu. 2006. “Information theoretic framework of trust modeling and evaluation for ad hoc networks". IEEE J. Selected Areas in Comm., 24 (2) : 305-317.
[83] Sun Y. L., Y. Liu. 2012. “Security of online reputation systems: the evolution of attacks and defenses". IEEE Signal Proc. Mag. 29 (2) : 87-97.
[84] Teacy W. T. L., J. Patel, N. Jennings, M. Luck. 2006. “Travos: trust and reputation in the context of inaccurate information sources". Autonomous Agents and Multi-Agent Systems 12 (2) :183-198.
[85] Teacy W. T. L., G. Chalkiadakis, A. Rogers, N. R. Jennings. 2008. “Sequential decision making with untrustworthy service providers". Proc. 7th AAMAS, Estoril, Portugal.
[86] Tennenholtz M. 2004. “Program equilibrium". Games and Economic Behavior 49 : 363-373.
[87] Trivers R. L.. 1971. “The evolution of reciprocal altruism". The Quarterly Rev. of Biology 46 (1) : 35-57.
[88] Wang Z., L.Wang, Z.-Y. Yin, C.-Y. Xia. 2012. “Inferring reputation promotes the evolution of cooperation in spatial social dilemma games". PLoS ONE 7 (7) : e40218.
[89] Wei X., M. Chen, C. Tang, H. Bai, G. Zhang, Z.Wang. 2013. “iRep: indirect reciprocity reputation based efficient content delivery in BT-like systems". Telecommun. Syst. 54 : 47-60.
[90] Whitby A., A. Josang, J. Indulska. 2004. “Filtering out unfair ratings in Bayesian reputation systems". Proc. 7th Int. Workshop on Trust in Agent Societies, New York.
[91] Wierzbicki A., R. Nielek. 2011.“Fairness emergence in reputation systems". J. Artificial Societies and Social Simulation 14 (1) : 1-8.
[92] Witkowski J., D. C. Parkes. 2012. “Peer prediction without a common prior". Proc. 13th ACM Conf. on Electronic Commerce, Valencia, Spain.
[93] Xiao L., Y. Chen, W. S. Lin, K. J. R. Liu. 2012. “Indirect reciprocity security game for large-scale wireless networks". IEEE Trans. Information Forensics and Security, 7 (4) : 1368-1380.
[94] Xiong L., Ling Liu. 2003. “A reputation-based trust model for peerto- peer e-commerce communities," Proc. IEEE Int. Conf. on E-Commerce, Newport Beach, CA.
[95] Yang Y., Q. Feng, Y. L. Sun, Y. Dai. 2008. “RepTrap: a novel attack on feedback-based reputation systems". Proc. SecureComm’08, Istanbul, Turkey.
[96] Yu H., Z. Shen, C. Miao, B. An, “Challenges and opportunities for trust management in crowdsourcing". 2012. Proc. IEEE/WIC/ACM Int. Conf. Intell. Agent Technol., Macau, China.
[97] Yu H., Z. Shen, C. Miao, B. An. 2013. “A reputation-aware decisionmaking approach for improving the efficiency of crowdsourcing systems". Proc. 12th AAMAS, Saint Paul, MN.
[98] Yu H., Z. Shen, C. Leung, C. Miao, V. R. Lesser. 2013. “A survey of multi-agent trust management systems," IEEE Access 1 : 35-50.
[99] Zhang J., R. Cohen. 2008. “Evaluating the trustworthiness of advice about seller agents in e-marketplaces: a personalized approach". Electronic Commerce Research and Applications 7 (3) : 330-340.
[100] Zhang L., S. Jiang, Jie Zhang, Wee Keong Ng. 2012. “Robustness of trust models and combinations for handling unfair ratings". IFIP AICT 374 : 36-51.
[101] Zhang J., R. Cohen, K Larson. 2012. “Combining trust modeling and mechanism design for promoting honesty in e-marketplaces". Comput. Intellig. 28 (4) : 549-578.
[102] Zhao H., X. Yang, X. Li. 2012. “An incentive mechanism to reinforce truthful reports in reputation systems". J. Network and Computer Applications 35 : 951-961.
[103] Zhong, S., Li, L. E., Y. G. Liu, Y. R. Yang. 2005. “On designing incentivecompatible routing and forwarding protocols in wireless ad hoc networks". Proc. ACM MobiCom, Cologne, Germany.
[104] Zhou R., K. Hwang. 2007. “PowerTrust: a robust and scalable reputation system for trusted peer-to-peer computing". IEEE Trans. Parallel and Distributed Systems 18 (4) : 460-473.

Jeśli masz wykupiony/przyznany dostęp - zaloguj się. Skorzystaj z naszych propozycji zakupu!

Publikacja


e-Publikacja (format pdf) - nr 100726 "Reputacja i zaufanie w sy..." licencja: Osobista Produkt cyfrowy	10.00 zł

Zeszyt


PRZEGLĄD TELEKOMUNIKACYJNY - e-zeszyt (pdf) 2016-8-9 licencja: Osobista Produkt cyfrowy	30.50 zł

Prenumerata

PRZEGLĄD TELEKOMUNIKACYJNY - prenumerata cyfrowa
licencja: Osobista

Produkt cyfrowy
Nowość

300.00 zł

PRZEGLĄD TELEKOMUNIKACYJNY - papierowa prenumerata roczna + wysyłka
licencja: Osobista

Szczegóły pakietu

Nazwa
PRZEGLĄD TELEKOMUNIKACYJNY - papierowa prenumerata roczna	348.00 zł brutto 322.22 zł netto 25.78 zł VAT (stawka VAT 8%)
PRZEGLĄD TELEKOMUNIKACYJNY - pakowanie i wysyłka	21.00 zł brutto 17.07 zł netto 3.93 zł VAT (stawka VAT 23%)

369.00 zł

PRZEGLĄD TELEKOMUNIKACYJNY - PAKIET prenumerata PLUS
licencja: Osobista

Szczegóły pakietu

Nazwa
PRZEGLĄD TELEKOMUNIKACYJNY - PAKIET prenumerata PLUS (Prenumerata papierowa + dostęp do portalu sigma-not.pl + e-prenumerata)	450.00 zł brutto 416.67 zł netto 33.33 zł VAT (stawka VAT 8%)

450.00 zł

Zeszyt

2016-8-9

Twój Koszyk

Publikacja

Zeszyt

Prenumerata

Zeszyt

Czasopisma