跳到主要內容

臺灣博碩士論文加值系統

(216.73.216.31) 您好!臺灣時間:2026/10/17 13:59
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:黃子玹
研究生(外文):Tzu-Hsuan Huang
論文名稱:基於社群網路應用之兩種安全機制設計
論文名稱(外文):Secure CARR and CFD Mechanisms based on Social Network Application
指導教授:陳育毅
指導教授(外文):Yu-Yi Chen
口試委員:詹進科、林祝興、李維斌
口試日期:2012-06-15
學位類別:碩士
校院名稱:國立中興大學
系所名稱:資訊管理學系所
學門:電算機學門
學類:電算機一般學類
論文種類:學術論文
論文出版年:2012
畢業學年度:100
語文別:中文
論文頁數:56
中文關鍵詞:社群網路服務、評論取得、找尋共同朋友、資訊安全、社群
外文關鍵詞:social network service、reviews retrieval、common friend discovery、information security、community
相關次數:
  • 被引用被引用:1
  • 點閱點閱:556
  • 評分評分:
  • 下載下載:2
  • 收藏至我的研究室書目清單書目收藏:1
近年來社群網路服務發展了很多應用,其中第三方網站與Facebook結合提供了更好的社群服務,但是在平台整合的情況下,衍生了許多安全問題,所以本研究提出兩個在這個基礎下發展的安全機制設計: CARR(Conditional-Anonymous Reviews Retrieval)與CFD(Common Friend Discovery)。
CARR是應用於評論型的社群網站之評論管理機制,配合社群網站提供API給評論網站的特性,在保障評論者隱私的前提下,來到網站的瀏覽者能夠知道哪些評論是由朋友所寫的,進而提供可靠的評論防止行銷者從中牟利。
CFD是在第三方社交平台以及行動環境下找尋共同朋友的安全機制,在保護使用者隱私及朋友關係的前提下,利用Diffie-Hellman金鑰交換的安全機制,達到找到共同朋友的目的。


The development of social network service promotes new applications, and the integration of Facebook and third-party sites has provided better social network service. However, the integration also causes many security problems. In this case, two security schemes which are designed for solving the problems are proposed, which are Conditional-Anonymous Reviews Retrieval (CARR) and Common Friend Discovery (CFD).
CARR is a review management scheme, which is applied to comment-type social network site. With the feature that social network sites provide API to review sites, the viewers who come to the review sites can recognize which review was written by viewers’ friends. Reviews become reliable accordingly, and marketers are prevented from making profits as well.
CFD is a security scheme to find common friends at the third-party social platform. CFD makes use of Diffie-Hellman key exchange mechanism to achieve the purpose of finding common friends, and protect users'' privacy and their relationship simultaneously.


摘要 I
ABSTRACT II
目錄 III
圖目錄 V
第一章 緒論 1
1.1 研究背景與動機 1
1.2 研究目的 2
1.3 論文架構 3
第二章 文獻探討 4
2.1 社群網路服務 4
2.1.1 朋友為基礎之社群網站 5
2.1.2特定主題之社群網站 7
2.1.3 社群網路連結服務 10
2.1.4 小結 13
2.2 評論社群網站 13
2.2.1 評論社群網站發展現況 13
2.2.2 評論社群網站面臨的問題 14
第三章 基於社群網路應用之有條件式匿名存取機制設計 16
3.1 簡介 16
3.2 CHIOU協定介紹 16
3.2.1 設置階段 17
3.2.2 評論提交階段 18
3.2.3 評論取得階段 18
3.2.4 Chiou設計解決的部分 20
3.2.5 探討Chiou的設計問題 21
3.3 安全需求 22
3.4 我們的設計 23
3.4.1 符號表 24
3.4.2 初始階段 25
3.4.3 評論提交階段 26
3.4.4 預備存取階段 27
3.4.5 評論取得階段 29
3.4.6 朋友刪除階段 30
3.5 安全性分析 31
3.6 本研究主要貢獻 34
第四章 應用於開放社交環境下之尋找共同朋友協定設計 35
4.1 簡介 35
4.2 共同朋友相關研究 36
4.3 安全需求 39
4.4 我們的設計 40
4.4.1 符號表 40
4.4.2 初始階段 41
4.4.3 找尋共同朋友階段 41
4.5 安全性分析 46
4.6 本研究主要貢獻 48
第五章 結論與未來工作 49
參考文獻 50
附錄-已發表之論文 56



中文網路資源
[1] 黃彥傑,“Facebook API簡介”,國立台灣大學計算機及資訊網路中心電子報,http://www.cc.ntu.edu.tw/chinese/epaper/0016/20110320_1605.html,2011年3月20號。
[2] 異塵行者,“Google+ 社交圈圈人生的九個真相”,電腦玩物,http://playcesor. blogspot.com/2011/07/google.html,2011年7月12日。
[3] 異塵行者,”Google+ Hangouts 視訊聚會外掛擴充,多人協作線上白板”,電腦玩物,http://playpcesor.blogspot.com/2011/09/google-hangouts.html,2011年9月26日。
[4] 呂愛麗,”加入LinkedIn 等著被比爾.蓋茲挖角”,遠見雜誌,http://www.gvm.t w/Boardcontent_16082_2.html,2010年5月。
[5] 夜神Scli,“LinkedIn介紹”,香港矽谷 IT創業日誌,http://www.hksilicon.com
/kb/articles/5450/LinkedIn,2010年6月23日。
[6] Mr.6,“愛爾蘭創業家用Linkedin在八天內對全球募到734萬台幣資金”,http://www.hksilicon.com/kb/articles/3869/Linkedin734,2010年6月27日。
[7] Ron Hung,“Yelp: 利用社群分享的力量賺大錢!”,科技報橘,http://techorange.com/2011/10/24/yelp-story/,2011年10月24日。
[8] Therese Poletti,“訴訟威脅Yelp名譽”,新浪網,http://financenews.sina.com/Mar
ketWatch/000-000-107-108/301/2010-03-18/205264143.html,2010年3月18日。
[9] “社群網站評論影響消費者購買決策”,台灣經貿網,http://www.taiwantrade.com.tw/CH/bizsearchdetail/42526/I,2012年3月29日。
[10] 陳怡如,“導購網站群體智慧力量大”,電子商務時報,http://www.ectimes.or g.tw/shownews.aspx?id=10068,2007年12月3日。
[11] 楊伶雯,“智慧購物成趨勢 「3C導購網」10/17上線”,今日新聞網,http://www.nownews.com/2007/10/17/320-2173755.htm,2007年10月17日。
[12] 鍾函芸,“導購背後的商業邏輯”,電子商務時報,http://www.ectimes.org.tw/ shownews.aspx?id=10066,2007年12月3日。
[13] 賴秀如,“扮顧客上網評商品 美業者受罰”,大紀元新聞網,http://www.epochtimes.com /b5/10/8/28/n3008804p.htm,2010年8月28日。
英文期刊論文
[14] D. M. Boyd and N. B. Ellison, “Social Network Sites: Definition, History, and Scholarship”, Journal of Computer-Mediated Communication, vol. 13, no. 1, pp. 210-230, Oct. 2007.
[15] J. Raacke and J. Bonds-Raacke, “MySpace and Facebook: applying the uses and gratifications theory to exploring friend-networking sites”, Cyberpsychology &Behavior, vol. 11, no. 2, pp. 169-74, Apr. 2008.
[16] G. Kontaxis, M. Polychronakis and E. P. Markatos, “SudoWeb : Minimizing Information Disclosure to Third Parties in Single Sign-On Platforms”, in Proceedings of the 2011 International Conference on Information security (ISC’11), pp. 197-212.
[17] A. Dey and S.Weis, “PseudoID: Enhancing Privacy for Federated Login”, Hot Topics in Privacy Enhancing Technologies, 2010.
[18] M. N. Ko, G. P. Cheek, M. Shehab, and R. Sandhu, “Social-networks connect services”, IEEE Computer Society, vol. 43, no. 8, pp. 37-43, 2010.
[19] P. G. Lange, “Publicly Private and Privately Public: Social Networking on YouTube”, Journal of Computer-Mediated Communication, vol. 13, no. 1, pp. 361-380, 2007.
[20] U. Gretzel and K. H. Yoo, “Use and impact of online travel reviews”, Information and communication technologies in tourism, pp. 35–46, 2008.
[21] S. Y. Chiou, S. Y. Chang, G. Mezzour, A. Perrig, and H. M. Sun, “A Trustable Reputation Scheme Based on Private Relationships”, in Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining, pp.19-24.
[22] X. Fang, J. Zhan, N. Koceja, and K. Williams, “Integrating Online Social Networks for Enhancing Reputation Systems of E-Commerce”, in Proceedings of the 2011 International Conference on Intelligence and Security Informatics (ISI), pp. 384-389.
[23] R. P.Bagozzi, and U. M.Dholakia, “Intentional Social Action in Virtual Communities”, Journal of Interactive Marketing, vol. 16, no. 2, pp. 2-21, 2002.
[24] M. von Arb, M. Bader, M. Kuhn, and R. Wattenhofer, “VENETA: Serverless Friend-of-Friend Detection in Mobile Social Networking”, in Proceedings of the 2008 International Conference on Wireless and Mobile Computing, Networking and Communications, pp. 184-189, 2008.
[25] E. D. Cristofaro, M. Manulis, and B. Poettering “Private Discovery of Common Social Contact”, in Proceedings of the 9th international conference on Applied cryptography and network security, pp.147-165, 2011.
[26] H. Lin, S. Chow, D. Xing, and Y. Fang, “Privacy-Preserving Friend Search over Online Social Networks”, IACR Cryptology ePrint Archive, 2011.
[27] M. J. Freedman and A. Nicolosi, “Efficient Private Techniques for Verifying Social Proximity”, in Proceedings of International Workshop on Peer-to-Peer Systems,2007.
[28] S.-Y. Chiou, S.-Y. Chang and H.-M. Sun, “Common Friends Discovery with Privacy and Authenticity”, in Proceedings of the Fifth International Conference on Information Assurance and Security, pp. 337-340, 2009.
[29] G. Ateniese, E.De Cristofaro and G. Tsudik, “(If) Size Matters: Size-Hiding Private SetIntersection”, in Proceedings of the14th IACR International Conference on Practice and Theory in Public Key Cryptography (PKC 2011), pp. 156–173,2011.
[30] D. Dachman-Soled, T. Malkin, M. Raykova and M. Yung, “Efficient Robust Private SetIntersection”, in Proceedings of the 7th International Conference on Applied Cryptography and Network Security, pp.125–142, 2009.
[31] M. J. Freedman, K. Nissim and B. Pinkas, “Efficient Private Matching and Set Intersection”, in Proceedings of International Conference on the Theory and Applications of Cryptographic Techniques(EUROCRYPT 2004), pp.1–19, 2004.
[32] C. Hazay and K. Nissim, “Efficient Set Operations in the Presence of Malicious Adversaries”, Public Key Cryptography, pp. 312–331, 2010
[33] S. Jarecki and X. Liu, “Fast Secure Computation of Set Intersection”, Security and Cryptography for Networks, pp. 418–435, 2010.
[34] L. Kissner and D. X. Song, “Privacy-Preserving Set Operations”, CRYPTO, pp. 241–257, 2005.
[35]E. D. Cristofaro, J. Kim and G. Tsudik, “Linear-complexity private set intersection protocols secure in malicious model”, Cryptology-ASIACRYPT, no. 2, pp. 1-16, 2010.
[36] E. De Cristofaro and G. Tsudik, “Practical Private Set Intersection Protocols with Linear Complexity”, Financial Cryptography, pp.143–159, 2010.
英文網路資源
[37] Gregory Lyons, “Facebook to Hit a Billion Users in the Summer”, http://connect.icrossing.co.uk/facebook-hit-billion-users-summer_7709, Jan 11, 2012.
[38] Facebook Now Has 901 MillionUsers, http://mashable.com/2012/04/23/facebook-
now-has-901-million-users/
[39] Facebook developer, https://developers.facebook.com/docs/
[40] The Top Social Networking Sites, http://webtrends.about.com/od/socialnetworking
/a/social_network.htm
[41] Facebook Profile, http://webtrends.about.com/od/profiles/fr/facebook-profile-what-
is-facebook.htm
[42] Federal Trade Commission’s complaint, http://www.ftc.gov/os/caselist/0923199/10
0826reverbcmpt.pdf
[43] Nielsen Global Online Consumer Survey, http://blog.nielsen.com/nielsenwire/cons
-umer/global-advertising-consumers-trust-real-friends-and-virtual-strangers-the-most/
[44] What is Flixster, http://webtrends.about.com/od/profiles/fr/WhatIs-Flixster.htm
[45] Facebook, https://www.facebook.com
[46] myspace, http://www.myspace.com/
[47] google+, https://plus.google.com/
[48] LinkedIn, http://tw.linkedin.com/
[49] Tripadvisor, http://www.tripadvisor.com.tw
[50] Yelp, http://www.yelp.com/
[51] Flixster, http://www.flixster.com/
[52] Fiverr.com, http://fiverr.com/gigs/search?query=review&x=0&y=0




QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top