Skip navigation

DSpace

機構典藏 DSpace 系統致力於保存各式數位資料(如:文字、圖片、PDF)並使其易於取用。

點此認識 DSpace
DSpace logo
English
中文
  • 瀏覽論文
    • 校院系所
    • 出版年
    • 作者
    • 標題
    • 關鍵字
    • 指導教授
  • 搜尋 TDR
  • 授權 Q&A
    • 我的頁面
    • 接受 E-mail 通知
    • 編輯個人資料
  1. NTU Theses and Dissertations Repository
  2. 電機資訊學院
  3. 電信工程學研究所
請用此 Handle URI 來引用此文件: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/66688
完整後設資料紀錄
DC 欄位值語言
dc.contributor.advisor陳光禎
dc.contributor.authorChia-Ying Shenen
dc.contributor.author沈佳瑩zh_TW
dc.date.accessioned2021-06-17T00:51:21Z-
dc.date.available2017-01-17
dc.date.copyright2012-01-17
dc.date.issued2011
dc.date.submitted2011-11-14
dc.identifier.citation[1] H. Rheingold, 'The Virtual Community: Homesteading in the Electronic Frontier.,' Addison-Wesley Publishing Company, Reading, MA.
[2] F. F. L. Lee, D. Vogel, and M. Limayem, 'Virtual community informatics: A review and research agenda,' Journal of Information Technology Theory and Application, vol. 5, no. 1, pp. 47–61, 2003.
[3] H. Inaltekin, N. E. Ozgencil, H. Xu, M. Chiang, and H. V. Poor, 'Online content trading: Sharing Mart System and Auction experiments,' IEEE ICC Workshop on Social Networks, pp. 1-6, May 2010.
[4] Z. X. Wu and P. Holme, 'Local interaction scale controls the existence of a nontrivial optimal critical mass in opinion spreading,' Phys. Rev. E, vol. 82, Issue 2, no. 4, Aug. 2010.
[5] M. E. J. Newman and D. J. Watts, The structure and dynamics of networks, Albert-László Barabási, Duncan J. Watts Mark E. J. Newman, Ed. Princeton: Princeton University Press, 2006.

[6] M. Nakamarua and S. A. Levinb, 'Spread of two linked social norms on complex interaction networks,' Journal of Theoretical Biology, vol. 230, Issue 1, pp. 57-64, 7 September 2004.
[7] M. A. Nowak and R. M. May, 'Evolutionary games and spatial chaos,' Nature, vol. 359, 29 October 1992.
[8] R. L. Riolo, M. D. Cohen, and R. Axelrod, 'Evolution of cooperation without reciprocity,' Nature, vol. 414, 22 Novenber 2001.
[9] A. L. Barabási, H Jeong, Z. Néda, E. Ravasz, and A. Schuber, 'Evolution of the social network of scientific collaborations,' Physica A: Statistical Mechanics and its Applications, vol. 311, Issues 3-4, 15 , pp. 590-614 , 15 Aug. 2002.
[10] R. Agrawal, A. Evfimievski, and R. Srikant, 'Information sharing across private databases,' Proceedings of the 2003 ACM SIGMOD international conference on Management of data, pp. 86-97, 2003.
[11] C. Castellano, S. Fortunato, and V. Loreto, 'Statistical physics of social dynamics,' REVIEWS OF MODERN PHYSICS, vol. 81, April-June 2009.
[12] S. Milgram, 'The small-world problem,' Psychology Today, vol. 2, pp. 60-67, 1967.
[13] D. J. Watts and S. H. Strogatz, 'Collective dynamics of 'small-world' networks,' Nature, 393, pp. 440-442, 1998.
[14] M. E. J. Newman, 'Phys. Rev. E,' Clustering and preferential attachment in growing networks, vol. 64, Issue 2, Jul. 2001.
[15] Y. Ikeda1, T. Hasegawa, and K. Nemoto, 'Cascade dynamics on clustered network,' Journal of Physics: Conference Series, vol. 221, no. 1, 2010.
[16] M. E. J. Newman, S. H. Strogatz, and D. J. Watts, 'Random graphs with arbitrary degree distributions and their applications,' Phys. Rev. E, vol. 64, Issue 2, Jul. 2001.
[17] D. J. de S. Price, 'Networks of Scientific Papers,' Science 149, pp. 510-515, 1965.
[18] P. Mahadevan, D. Krioukov, K. Fall, and A. Vahdat, 'Systematic Topology Analysis and Generation,' SIGCOMM Comput. Commun. Rev., vol. 36, Issue 4, Aug. 2006.
[19] J.P. Allen, 'Knowledge-Sharing Successes in Web 2.0 Communities,' Technology and Society Magazine, IEEE , vol. 29, Issue 1 , pp. 58 - 64 , 2010.
[20] A. Bleicher. (2011, January) Social Networking: Friended-IEEE Spectrum. [Online]. http://spectrum.ieee.org/computing/networks/social-networking-friended
[21] Y. Y. Ahn, S. Han, H. Kwak, S. Moon, and H. Jeong, 'Analysis of topological characteristics of huge online social networking services,' WWW '07: Proceedings of the 16th international conference on World Wide Web., pp. 835-844, 2007.
[22] A. Mislove, B. Viswanath, K. P. Gummadi, and P. Druschel, 'You Are Who You Know: Inferring User Profiles in Online Social Networks,' Proceedings of the third ACM international conference on Web search and data mining , Feb. 2010.
[23] A. Albrechtslund, 'Online Social Networking as Participatory Surveillance,' First Monday, vol. 13, no. 3, March 2008.
[24] D. M. Boyd and N. B. Ellison, 'Social Network Sites: Definition, History, and Scholarship,' Journal of Computer-Mediated Communication, vol. 13, pp. 210-230, October 2007.
[25] D. Wilkinson, and B. A. Huberman S. Golder, 'Rhythms of Social Interaction: Messaging within a Massive Online Network,' International Conference on Communities and Technologies, pp. 41-66, June 2007.
[26] D. Liben-Nowell, J. Novak, R. Kumar, P. Raghavan, and A. Tomkins, 'Geographic routing in social networks,' Proceedings of the National Academy of Sciences of the United States of America, Augest 2005.
[27] L. Backstorm, D. Huttenlocher, J. Kleinberg, and X. Lan, 'Group formation in large social networks: membership, growth, and evolution,' KDD '06 Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 44-54, 2006.
[28] E. Spertus, M. Sahami, and O. Buyukkokten, 'Evaluating similarity measures: A large-scale study in the Orkut social network,' KDD '05 Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, pp. 678-684, 2005.
[29] 'Data, data everywhere,' The Economist, Feb. 2010.
[30] G. Hardin, 'The Tragedy of the Commons,' Science 162 (3859), pp. 1243–1248, 13 December 1968.
[31] B. A. Huberman and R. M. Lukose, 'Social Dilemmas and Internet Congestion,' Science 277, 535, 1997.
[32] H. A. Simon, Administrative Behavior: A study of decision-making processes in adminstrative organization. New York: The Macmillan Co, 1947.
[33] A. Iriberri and G. Leroy, 'A life-cycle perspective on online community success,' ACM Computing Surveys, vol. 41, no. 2, Feb. 2009.
[34] M. Parameswaran and A. B. Whinston, 'Social computing: An overview,' Communications of the Association for Information Systems, vol. 19, pp. 762-780, 2007.
[35] C. Carver, 'Building a virtual community for a tele-learning environment,' IEEE Commun. Mag., vol. 37, no. 3, pp. 114-118, March 1999.
[36] S. Turkle, 'Life on the Screen: Identity in the Age of the Internet. Simon and Shuster,' 1995.
[37] B. Wellman, J. Salaff, D. Dimitrova, L. Garton, and C. Haythornwaite, 'Computer networks as social networks: Collaborative work, telework, and virtual community,' Ann. Rev. Soc, vol. 22, pp. 213-238, Aug 1996.
[38] K. N. Hampton, 'Grieving for a lost network: Collective action in a wired suburb,' Inform. Soc., vol. 19, no. 5, pp. 417-428, Nov.-Dec. 2003.
[39] R. E. Kraut et al., 'Internet paradox: A social technology that reduces social involvement and psychological well being?,' Amer. Psych., vol. 53, no. 9, pp. 1017-1031, Sep. 1998.
[40] A. Armstrong and J. Hagel, Net Gain: Expanding Markets through Virtual Communities.: Harvard Business School Press.
[41] E. Wegner, R. Mcdermott, and W. Snyder. (2002) Cultivating Communities of Practice: A Guide to Managing Knowledge. Harvard Business School Press.
[42] A. L. Blanchard and M. L. Markus, 'The experienced “sense”of a virtual community: Characteristics and processes,' ACM SIGMIS Data Base, vol. 35, no. 1, pp. 65-79, Winter 2004.
[43] J. Preece, Online Communities: Designing Usability, Supporting Sociability..: Wiley, 2000.
[44] J. M. Leimeister and H. Krcmar, 'Engineering virtual communities in heath care: The case of www.krebsgemeinschaft.de,' Electron. J. Organizat. Virtual, vol. 5, no. 3.
[45] D. C. Andrews, J. Preece, and M. Turoff, 'A conceptual framework for demographic groups resistant to online community interaction,' Procs. of the 34th Hawaii International Conference on System Sciences, 2001.
[46] S. Wasserman and K. Faust, Social Network Analysis: Methods and Application. Cambridge: Cambridge University Press, 1994.
[47] J. Scott, Social Network Analysis: A Handbook, 2nd ed. London: SAGE Publications, 2000.
[48] A. Bavelas, 'A mathematical model for group structures,' Human Organization, vol. 7, pp. 16-30, 1948.
[49] P. Bonacich, 'Power and Centrality: A Family of Measures,' The American Journal of Sociology, vol. 92, no. 5, pp. 1170-1182, March 1987.
[50] D. Centola, 'The Spread of Behavior in an Online Social Network Experiment,' Science, vol. 329, 3 Sep. 2010.
[51] D. J. Watts, P. S. Dodds, and M. E. J. Newman, 'Identity and Search in Social Networks,' Science 17 , vol. 296, no. 5571, pp. 1302-1305 , May 2002.
[52] R. Gross and A. Acquisti, 'Information revelation and privacy in online social networks,' Proc. ACM workshop on Privacy in the electronic society, pp. 71-80, 2005.
[53] S. B. Barnes, 'A privacy paradox: Social networking in the United States,' First Monday, vol. 11, no. 9.
[54] D. Rosenblum, 'What Anyone Can Know: The Privacy Risks of Social Networking Sites,' IEEE Security & Privacy, vol. 5, no. 3, pp. 40-49, May-June 2007.
[55] N. A. Johnson, M. Jakobsson, and F. Menczer T. N. Jagatic, 'Social phishing,' Communications of the ACM, vol. 50, no. 10, pp. 94-100, Oct. 2007.
[56] A. Lenhart and M. Madden, 'Social Networking Websites and Teens: An Overview,' Pew Internet & American Life Project, 2007.
[57] C. Dwyer, S. R. Hiltz, and K. Passerini, 'Trust and privacy concern within social networking sites: A comparison of Facebook and MySpace,' Proc. AMCIS, 2007.
[58] L. Xiong and L. Liu, 'PeerTrust: Supporting Reputation-Based Trust for Peer-to-Peer Electronic Communities,' IEEE Transactions on Knowledge and Data Engineering, vol. 16, Issue 7 , pp. 843 - 857, Jul. 2004.
[59] W. Stallings, Cryptography and Network Security, 4th ed.: Prentice-Hall, 2006.
[60] L. Xie and S. Zhu, 'Message Dropping Attacks in Overlay Networks: Attack Detection and Attacker Identification,' ACM Transactions on Information and Systems Security, vol. 11, no. 3, March 2008.
[61] V. Shmatikov and C. Talcott, 'Reputation-Based Trust Management,' Workshop on Issues in the Theory of Security (WITS), 2003.
[62] 'Computers at Risk: Safe Computing in the Information Age,' National Research Council, 1991.
[63] L. Lamport, R. Shostak, and M. Pease, 'The Byzantine Generals Problem,' ACM Transactions on Programming Languages and Systems (TOPLAS), vol. 4 Issue 3, July 1982.
[64] D. Dolev, 'The Byzantine generals strike again,' Stanford University Stanford, CA, USA, Technical Report 1981.
[65] D. Dolev, N. A. Lynch, S. S. Pinter, E. W. Stark, and W. E. Weihl, 'Reaching approximate agreement in the presence of faults,' Journal of the ACM (JACM), vol. 33 Issue 3, July 1986.
[66] M. O. Jackson, Social and Economic Networks. Princeton: Princeton University Press, 2008.
[67] R. Albert and A. L. Baraba´si, 'Statistical mechanics of complex networks,' REVIEWS OF MODERN PHYSICS, vol. 74, January 2002.
[68] M. E. J. Newman, 'The Structure and Function of Complex Networks,' SIAM Review, vol. 45, no. 2, pp. 167-256, 2003.
[69] K. Christensen, R. Donangelo, B. Koiller, and K. Sneppen, 'Evolution of Random Networks,' Phys. Rev. Lett., vol. 81, no. 11, pp. 2380 - 2383, Sep. 1998.
[70] A. L. Baraba´si and E. Bonabeau, 'Scale-Free Networks,' Scientific American, May 2003.
[71] T. Vicsek and F. Family, 'Dynamic Scaling for Aggregation of Clusters,' Phys. Rev. Lett., vol. 52, no. 19, pp. 1669 - 1672, May 1984.
[72] S. Boccaletti, M. Ivanchenko, V. Latora, A. Pluchino, and A. Rapisarda, 'Detecting complex network modularity by dynamical clustering,' Phys. Rev. E, vol. 75, Apr. 2007.
[73] G. Palla, I. Derényi, I. Farkas, and T. Vicsek, 'Uncovering the overlapping community structure of complex networks in nature and society,' Nature 435, pp. 814-818, 9 June 2005.
[74] A. A. Selcuk, E. Uzun, and M.R. Pariente, 'A reputation-based trust management system for P2P networks,' Cluster Computing and the Grid, 2004. CCGrid 2004. IEEE International Symposium on, pp. 251- 258, 19-22, April 2004.
[75] L. Lai, H. E. Gamal, H. Jiang, and H. V. Poor, 'Optimal medium access protocols for cognitive radio networks,' Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks and Workshops, 2008. WiOPT 2008. 6th International Symposium on, pp. 1-3, April 2008.
[76] A. Wald, 'sequential tests of statistical hypotheses,' The Annals of Mathematical Statistics, vol. 16, no. 2, pp. 117-186, June 1945.
[77] H. V. Poor, An Introduction to Signal Detection and Estimation, 2nd ed.: Birkhäuser, 1994.
[78] S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, 'Randomized Gossip Algorithms,' IEEE Transactions on Information Theory, vol. 52, no. 6, June 2006.
[79] B. Zhang, S. Jamin, and L. Zhang, 'Host multicast: a framework for delivering multicast to end users,' INFOCOM 2002. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE, vol. 3, pp. 1366-1375, 2002.
[80] J. Leskovec. (2009) Stanford Network Analysis Project.
[Online]. http://snap.stanford.edu/index.html
[81] F. Chierichetti, S. Lattanzi, and A. Panconesi, 'Rumor Spreading in Social Networks,' in Automata, Languages and Programming.: Springer Berlin / Heidelberg, 2009, pp. 375 - 386.
[82] D. Shah and T. Zaman, 'Rumors in a Network: Who's the Culprit?,' IEEE Transactions on Information Theory , vol. 57, Issue 8 , pp. 5163 - 5181 , Aug. 2011.
[83] K. Kawachi et al., 'A rumor transmission model with various contact interactions,' Journal of Theoretical Biology, vol. 253, Issue 1, pp. 55-60, 7 July 2008.
[84] C. Carmack. HowSuffWorks.
[Online]. http://computer.howstuffworks.com/bittorrent1.htm
dc.identifier.urihttp://tdr.lib.ntu.edu.tw/jspui/handle/123456789/66688-
dc.description.abstract在社群網站中,許多人無時無刻地透過發佈訊息在分享生活,無論彼此陌生或認識;訊息具有渲染的作用,決策時會受到身邊的人影響,且因為使用者會樂於彼此分享感興趣的話題,而造成訊息傳播;理性行為者(公平的使用者)會根據自由意志,在所能掌握的資訊中對訊息做出決策,並與他人分享討論,以極大化自己的效用(聽到事實的機率)。但是在訊息傳播的過程中,若遇到使用者蓄意地竄改、變造訊息原本的意思,而造成訊息竄改,並將其刻意地傳播出去,則可能造成眾說紛紜而形成意見競爭。為了要遏止訊息竄改而造成錯誤集體決策所帶來的網路安全威脅,需要揪出這類惡意竄改訊息的竄改者,以阻止他們持續散佈不實消息。
首先,我們設計系統模型來描述社群網站和解釋訊息的屬性,定義意見競爭的現象以解釋惡意節點所發動訊息偽造攻擊的是意見競爭的造成原因之一。訊息偽造攻擊發生時,我們嘗試模擬使用者行為進行訊息交換和傳播以偵測訊息偽造攻擊。再來,我們需要消息的防偽檢測和消息偽造識透過聲譽管理,連續檢測和八卦演算法設計來提供解決偽造攻擊的因應方案如偽造者辨識。我們希望系統遭受訊息偽造攻擊後能不被干擾,足以對訊息偽造的威脅提供保護,為了避免惡意使用者干擾訊息的傳播,我們將設計演算法使得訊息傳播的過程中不會受到惡意使用者的干擾,進而維持系統的強固性。
zh_TW
dc.description.abstractOn social networking sites, opinion competition occurs when a message source wants to broadcast the message to all the users but there exist malicious users counterfeit the message to compete. The malicious users for the particular purposes intentionally counterfeit the message to create a difference message with source message; such as sales make exaggerating promotion, politicians make empty promises to win victory, etc. When message source want to broadcast the message to all the users, each user will receive the message from the friends. But, he has to make a decision to determine a consistency from the received message. If user received the same messages, he just spread this message. Else if user receives the different messages, he meets opinion competition and do not know how to make decisions. In order to avoid the malicious user interfere with broadcasted message source, we will design an algorithm to protect the determination of message against the interference of malicious user and keep the system robust.
First, we design a system model to describe social networking sites and the properties of message, defining the phenomenon of opinion competition to explain opinion competition is one of resulting reason from the message counterfeiting attack by malicious nodes. We try to model the users’ behaviors for message exchange and spread when message counterfeiting attack occurred. Hence, the second is that we need to design a solution for message counterfeiting detection and message counterfeiter identification by reputation management, sequential detection and gossip algorithm. We want to recover the system suffered from message counterfeiting attack occurred. On the purpose of providing protection against threats of message counterfeiter, we regard message counterfeiting as attack so called message counterfeiting attack and hope to reach agreement in order to win most of all the recognition for any particular purpose.
en
dc.description.provenanceMade available in DSpace on 2021-06-17T00:51:21Z (GMT). No. of bitstreams: 1
ntu-100-R97942138-1.pdf: 2566307 bytes, checksum: 457677a55408a478e462cd862974f1c2 (MD5)
Previous issue date: 2011
en
dc.description.tableofcontents誌謝 i
中文摘要 iii
ABSTRACT iv
CONTENTS vi
LIST OF FIGURES viii
LIST OF TABLES xii
Chapter 1 Introduction 1
1.1 Social Networks 1
1.1.1 Social Networking Sites (SNSs) 3
1.1.2 Challenges on SNSs 5
1.2 Phenomenon of Opinion Competition 8
1.3 Organization 11
Chapter 2 Opinion Competition – Related Work 12
2.1 Social Networking Sites involving Opinion Competition 13
2.1.1 Social Network Security: Privacy & Trust 14
2.1.2 Message Counterfeiting 18
2.2 Comparisons for Message Counterfeiting 21
2.2.1 Message Dropping Attack[60] 21
2.2.2 Byzantine Generals Problem (BGP) 23
2.3 Opinion competition for message counterfeiting 24
Chapter 3 System Model 27
3.1 Network Model for SNSs 27
3.2 Network topology 32
3.3 Message Counterfeiting for SNSs 35
Chapter 4 Counterfeiting Detection and Identification 39
4.1 Message Counterfeiting Attack Model 40
4.2 Message Counterfeiting Detection 43
4.3 Potential Solutions for Message Counterfeiting Attack 46
4.4 Message Counterfeiter Identification 49
Chapter 5 Performance Evaluation 58
5.1 Modified SI Model for Message Spread 58
5.2 The process of forming Faith 60
5.3 Simulation Result Analysis for MCD and MCI 70
5.4 Numerical Results for Message Counterfeiting Attack by Twitter 77
Chapter 6 Applications 84
6.1 Rumor Spreading in Social Networks 84
6.2 Distributed System for Reaching Agreement in the Presence of Faults 85
Chapter 7 Conclusions and Future Works 88
Bibliography 91
dc.language.isoen
dc.subject訊息偽造zh_TW
dc.subject意見競爭zh_TW
dc.subject社群網路zh_TW
dc.subject訊息偽造偵測與偽造者辨識zh_TW
dc.subjectOpinion Competitionen
dc.subjectSocial Networking Sitesen
dc.subjectMessage Counterfeitingen
dc.subjectand Message Counterfeiting Detection and Counterfeiter Identificationen
dc.title社群網路之訊息偽造偵測與偽造者辨識zh_TW
dc.titleMessage Counterfeiting Detection and Counterfeiter Identification for Social Networking Sitesen
dc.typeThesis
dc.date.schoolyear100-1
dc.description.degree碩士
dc.contributor.oralexamcommittee鄭瑞光,鄧德雋,林春成
dc.subject.keyword社群網路,意見競爭,訊息偽造,訊息偽造偵測與偽造者辨識,zh_TW
dc.subject.keywordSocial Networking Sites,Opinion Competition,Message Counterfeiting,and Message Counterfeiting Detection and Counterfeiter Identification,en
dc.relation.page100
dc.rights.note有償授權
dc.date.accepted2011-11-15
dc.contributor.author-college電機資訊學院zh_TW
dc.contributor.author-dept電信工程學研究所zh_TW
顯示於系所單位:電信工程學研究所

文件中的檔案:
檔案 大小格式 
ntu-100-1.pdf
  未授權公開取用
2.51 MBAdobe PDF
顯示文件簡單紀錄


系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。

社群連結
聯絡資訊
10617臺北市大安區羅斯福路四段1號
No.1 Sec.4, Roosevelt Rd., Taipei, Taiwan, R.O.C. 106
Tel: (02)33662353
Email: ntuetds@ntu.edu.tw
意見箱
相關連結
館藏目錄
國內圖書館整合查詢 MetaCat
臺大學術典藏 NTU Scholars
臺大圖書館數位典藏館
本站聲明
© NTU Library All Rights Reserved