適用於多種設備的可否認鑑別協定之設計

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：15

、訪客IP：18.118.9.7

姓名

莊友豪(Yu-hao Chuang) 查詢紙本館藏

畢業系所

資訊管理學系

論文名稱

適用於多種設備的可否認鑑別協定之設計
(Design of Deniable Authentication Protocols for Multiple Device Types)

相關論文

★ 針對提昇資料倉儲資料庫執行效能之知識管理與相關系統設計	★ 以破壞性創新理論分析中國山寨產業--以手機產業為例
★ 初探線上遊戲對未來領導力的影響	★ 研究機構之開放創新模式－以工研院為例
★ 以關聯規則探勘為基礎，探討詐騙車手提領型態互動之研究	★ 影響個人在虛擬社群環境中知識分享因素之探討
★ Wiki使用者與使用行為之研究	★ 醫療院所科技化服務創新與組織能力關係之研究
★ 社會網路服務網站的利益—以Facebook為例	★ 協同寫作工具對寫作成效的影響
★ 部落格之網路口碑評比機制平台管理與應用	★ 虛擬貨幣交易平台之實現
★ 數位匯流創新經營模式研究 - 以台灣電信業者為例	★ SNS遊戲影響社會網路服務持續使用之探討
★ 網路團體購物之使用者行為分析	★ 探討微網誌使用者持續使用意圖之研究

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

至系統瀏覽論文 ( 永不開放)

摘要(中)

隨著資訊科技不斷進步，網路應用之快速發展下，個人隱私權的安全防護儼然成為在開放式的網路通訊媒介下必須思考且重視的議題。傳統的終端使用者與主機的身分鑑別機制已不符現今安全的需求，無法確保使用者在身分鑑別的過程中，個人私密資料不會外洩，或被惡意的服務終端管理者盜用做為額外商業用途。因此，本論文將提出安全且具可否認的身分鑑別協定機制，使其達到：
1. 使用者可以向特定驗證者提出身分證明的正確性、合法性。
2. 驗證者無法將使用者的身分資料向第三者提出證明，即使提出相關證明文件，第三者仍不會相信。
同時為了滿足現今的公開金鑰基礎建設環境，本論文提出下列二種可否認的身分鑑別協定機制：1) 植基於解離散對數的可否認鑑別協定，此協定能與目前實務上多數的溝通協定相結合，降低建置成本；2) 植基於橢圓曲線計算的可否認鑑別協定，此協定僅需較低的計算量，適合資源有限的行動裝置設備。
公開金鑰基礎建設環境下，使用者持有的公開金鑰須透過憑證中心所發行的憑證驗證其正確性、合法性。為了克服此缺點，本論文進一步提出自我驗證公開金鑰系統下的可否認身分鑑別協定機制，藉由自我驗證公開金鑰系統演算法，使用者不需再額外的憑證來驗證公開金鑰的正確性、合法性，以節省計算與傳送成本；同時，自我驗證公開金鑰系統相對於公開金鑰系統，更能提供較佳的安全防護。因此，本論文根據自我驗證公開金鑰系統的架構提出二種可否認身分鑑別協定機制，分別是：1) 植基於解離散對數的可否認鑑別協定；2) 植基於橢圓曲線計算的可否認鑑別協定。
本論文提出的四種可否認身分鑑別協定機制，皆能滿足以下安全需求：1) 身分鑑別；2) 可否認性。同時，本論文提出的可否認身分鑑別協定皆為非交互溝通機制，與先前研究學者提出的方法比較，具有較佳的執行效率。實務方面，本論文透過實驗設計法對社交網路使用者的行為意圖進行分析，結果顯示安全、可靠的使用者身分登入鑑別機制會增進使用者對於網站的信任度，進而正面影響使用者的使用意圖。因此本論文將提出的可否認鑑別協定應用於社交網路服務架構，藉由提供更安全、可靠的使用者身分登入鑑別機制，使社交網路服務使用者的隱私權獲得更完善的防護，進而增進使用者的使用意圖。

摘要(英)

Since the information technology continues to grow and the network applications are getting popular, protecting the privacy of Internet users on the open network becomes a necessary concern. The traditional authentication protocol is not suitable for the requirements of internet security nowadays. That is, it cannot assure that the private information not be revealed during the authentication operation, or be used by malicious terminal service managers for their personal gain in some other business opportunities. Hence, in this dissertation, we propose secure and deniable authentication protocols to fulfill the following security requirements.
1. Each user can prove his/her legitimacy to the designated verifier.
2. The designated verifier cannot prove the identity of the user to the third party even though the verifier provides the testimonials.
In the dissertation, we first propose two types of deniable authentication protocols to satisfy the security requirements of the current public key infrastructure (PKI). The first is based on discrete logarithm problem (DLP), which is suitable to be integrated with the most current communication protocols and the advantage of setting costs reduction; the second is based on elliptic curve cryptography (ECC), which is suitable for the mobile devices since it only needs limited computation resources.
However, in PKI, all public keys for users need the certificates to be issued from the certification authority (CA) to assure the validity and legitimacy of the public keys. To overcome this complexity, we further propose another variant of the deniable authentication protocol based on self-certified public key systems. In such a protocol, it needs no extra certificates to validate the validity and legitimacy of public keys so that to reduce computational complexities and communicational costs. In addition, such self-certified-based protocols can provide superior security protections than certificated-based protocols in PKI. Accordingly, two types of deniable authentication protocols with self-certified public key systems are proposed: DLP-based deniable authentication protocol and ECC-based deniable authentication protocol.
All proposed deniable authentication protocols can not only satisfy the security requirements of user authentication and deniability, but also achieve performance efficiency since they are non-interactive. In practice, using a randomized control group pretest-posttest experimental design, we analyze the user’s behavior in social network services (SNSs). Our tests demonstrate that high security and reliability mechanisms of user’s authentication during logging on online systems will enhance the trust of user toward using the website which positively impact the user’s intention of using the website. In this dissertation, we apply the proposed deniable authentication protocols in SNSs to provide high security and reliability requirements of user’s authentication during logging on online systems. With that, the user who can obtain individual privacy protections impeccably when he logins the systems of SNSs and further enhance his intention toward using the social websites.

關鍵字(中)

★ 可否認的身分鑑別
★ 隱私權
★ 公開金鑰基礎建設
★ 行動裝置
★ 自我驗證公開金鑰系統
★ 離散對數
★ 橢圓曲線
★ 實驗設計法
★ 使用意圖
★ 信任
★ 社交網路

關鍵字(英)

★ deniable authentication protocol
★ privacy
★ public key infrastructure
★ mobile device
★ self-certified public key system
★ discrete logarithm problem
★ elliptic curve cryptography
★ experimental design
★ user intention
★ trust
★ social network services

論文目次

Chapter I Introduction ............................................................................................................. 1
1.1 Research motivations ................................................................................................ 1
1.2 Research purposes and issues ................................................................................... 3
Chapter II Literature Review ................................................................................................... 6
2.1 Diffie-Hellman key exchange protocol .................................................................... 6
2.2 Digital signature algorithm ....................................................................................... 8
2.3 ElGamal digital signature scheme ............................................................................ 9
2.4 Elliptic curve cryptography .................................................................................... 10
2.5 Cryptographic assumptions .................................................................................... 13
Chapter III Design of Deniable Authentication Protocols with Certificates ......................... 15
3.1 Preliminaries ........................................................................................................... 15
3.2 Deniable authentication protocol with certificates based on DLP ......................... 17
3.2.1 The proposed protocol based on DLP .................................................................. 17
3.2.2 Security analysis ................................................................................................... 19
3.3 Deniable authentication protocol with certificates based on ECC ......................... 21
3.3.1 The proposed protocol based on ECC .................................................................. 21
3.3.2 Security analysis ................................................................................................... 22
Chapter IV Design of Certificateless Deniable Authentication Protocols ............................ 24
4.1 Preliminaries ........................................................................................................... 24
4.2 Certificateless deniable authentication protocol based on DLP ............................. 25
4.2.1 The proposed protocol based on DLP .................................................................. 25
4.2.2 Security analysis ................................................................................................... 28
4.3 Certificateless deniable authentication protocol based on ECC ............................. 29
4.3.1 The proposed protocol based on ECC .................................................................. 30
4.3.2 Security analysis ................................................................................................... 31
Chapter V Applications in Social Network Services............................................................. 33
5.1 Preliminaries ........................................................................................................... 33
5.2 Hypotheses ............................................................................................................. 36
5.2.1 Meeting new friends ............................................................................................. 36
5.2.2 Entertainment ....................................................................................................... 37
5.2.3 Maintaining relationships ..................................................................................... 37
5.2.4 Understanding and learning .................................................................................. 37
5.2.5 Searching for friends ............................................................................................ 37
5.2.6 Social involvement ............................................................................................... 38
5.2.7 Trust in websites ................................................................................................... 38
5.2.8 Trust in other members ......................................................................................... 38
5.2.9 Information searching ........................................................................................... 38
5.2.10 Costs ................................................................................................................. 39
5.2.11 Quality of friends .............................................................................................. 39
5.2.12 Attitudes ........................................................................................................... 40
5.3 Research methodology & hypotheses..................................................................... 41
5.3.1 Within-group hypotheses ...................................................................................... 42
5.3.2 Between-group hypotheses ................................................................................... 43
5.4 Questionnaire construction and procedure ............................................................. 44
5.4.1 First stage: pretest ................................................................................................. 44
5.4.2 Experimental design and pretests ......................................................................... 46
5.4.3 Posttest .................................................................................................................. 48
5.5 Data analysis ........................................................................................................... 48
5.5.1 Pretest comparisons of the experimental and control groups ............................... 48
5.5.2 Pretest-posttest comparisons of the experimental group ...................................... 49
5.5.3 Posttest comparisons of the experimental and control groups ............................. 50
5.5.4 Data results ........................................................................................................... 51
5.6 Deniable authentication protocol with certificates for 6SNS site .......................... 54
Chapter VI Discussions and Conclusions .............................................................................. 56
6.1 Discussions ............................................................................................................. 56
6.2 Conclusions ............................................................................................................ 57
References ............................................................................................................................... 58
Publication List ......................................................................................................................... 69

參考文獻

[1] Alexa, “Top Sites,” retrieved from: http://www.alexa.com/topsites, 2012.
[2] ANSI X9.63, “Public key cryptography for the financial service industry – key agreement and key transport using elliptic curve cryptography,” 2001.
[3] Y. Aumann and M. Rabin, “Efficient deniable authentication of long message,” Int. Conf. on Theoretical Computer Science in Honor of Professor Manuel Blum’s 60th birthday, retrieved from: http://www.cs.cityu.edu.hk/dept/video. html, 1998.
[4] AppleDaily, “超離譜網售東森購物8千筆個資,” retrieved from: http://tw.nextmedia.com/applenews/article/art_id/31700290/IssueID/20090611, 2009.
[5] J. A. Bargh, K. Y. A. McKenna and G. M. Fitzsimons, “Can you see the real me? activation and expression of the true self on the internet,” Journal of Social Issues, Vol. 58, No. 1, pp. 33-48, 2002.
[6] J. A. Barnes, “Class and committees in a Norwegian island parish,” Human Relation, Vol. 7, No. 1, pp. 39-58, 1954.
[7] L. Berkman and S. L. Syme, “Social networks, host resistance and mortality: a nine-year follow up study of Alameda county residents,” American Journal of Epidemiology, Vol. 109, No. 2, pp. 186-204, 1979.
[8] 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, 2007.
[9] D. T. Campbell and J. C. Stanley, “Experimental and quasi-experimental designs for research,” Boston: Houghton Mifflin Company, 1963.
[10] J. Cassidy, “Me media,” The New Yorker, pp. 50–59, 2006.
[11] CheckFacebook.com, retrieved from: http://www.checkfacebook.com/, 2010.
[12] P. Chiaramonte and E. Martinez, “Jerks in space in the New York post,” 2006.
[13] Y. H. Chuang, W. Shu, K. C. Hsu and C. L. Hsu, “A secure non-interactive deniable authentication protocol based on discrete logarithms,” ICIC Express Letters , PartB: Applications. (In press)
[14] S. Cohen and S. L. Syme, “Social support and health,” New York: Academic Press, 1985.
[15] N. Coppola, S. R. Hiltz and N. Rotter, “Building trust in virtual teams,” IEEE Transactions on Professional Communication, Vol. 47, No. 2, pp. 95-104, 2004.
[16] J. Cummings, B. Butler and R. Kraut, “The quality of online social relationships,” Communication of the ACM, Vol. 45, No. 7, pp. 103-108, 2002.
[17] F. D. Davis, “Perceived usefulness, perceived ease of use, and user acceptance of information technology,” MIS Quarterly, Vol. 13, No. 3, pp. 319-335, 1989.
[18] X. Deng, C. H. Lee and H. Zhu, “Deniable authentication protocols,” IEE Proceeding of Computer and Digital Techniques, Vol. 148, No. 2, pp. 101-104, 2001.
[19] W. Diffie and M. E. Hellman, “New directions in cryptography,” IEEE Transactions on Information Theory, Vol. IT-22, No. 6, pp. 644-654, 1976.
[20] J. Donath and D. Boyd, “Public displays of connection,” BT Technology Journal, Vol. 22, No. 4, pp. 71-82, 2004.
[21] C. Dwork, M. Naor and A. Sahai, “Concurrent zero-knowledge,” Conference Proceedings of the Annual ACM Symposium on Theory of Computing, pp. 409-418, 1998.
[22] C. Dwyer, “Digital relationships in the ’MySpace’ generation: results from a qualitative study,” Proceedings of the 40th Hawaii International Conference on System Sciences (HICSS), Hawaii, 2007.
[23] T. ElGamal, “A public key cryptosystem and a signature scheme based on discrete logarithms,” IEEE Transactions on Information Theory, Vol. IT-31, No. 4, pp. 469–472, 1985.
[24] N. Ellison, R. Heino and J. Gibbs, “Managing impressions online: self-presentation processes in the online dating environment,” Journal of Computer-Mediated Communication, Vol. 11, No. 2, pp. 415-441, 2006.
[25] N. Ellison, C. Steinfield and C. Lampe, “The benefits of Facebook ‘friends’: exploring the relationship between college students’ use of online social networks and social capital,” Journal of Computer Mediated Communication, Vol. 12, No. 4, pp. 1143-1168, 2007.
[26] E. Ericksen and V. Yancey, “Class, sector and income determination,” Unpublished Manuscript, Temple University, 1980.
[27] L. Fan, C. X. Xu and J. H. Li, “Deniable authentication protocol based on Diffie-Hellman algorithm,” Electronics Letters, Vol. 38, No. 4, pp. 705-706, 2002.
[28] C. S. Fischer, “To dwell among friends: personal networks in town and city,” Chicago: Chicago University Press, 1982.
[29] M. Fishbein and I. Ajzen, “Beliefs, attitude, intention and behavior: an introduction to theory and research,” MA: Addison-Wesley Publishing Company, 1975.
[30] A. J. Flanging, “IM online: instant messaging use among college students,” Communication Research Reports, Vol. 22, No. 3, pp. 175-187, 2005.
[31] C. Fornell and D. F. Larcker, “Evaluating structural equation models with unobservable variables and measurement error,” Journal of Marketing Research, Vol. 18, No. 1, pp. 39-50, 1981.
[32] F. Fukuyama, “Trust: the social virtues and the creation of prosperity,” Simon & Schuster Inc, New York, 1996.
[33] M. Girault, “Self-certified public key”, Advances in Cryptology – EUROCRYPT’91, pp. 491-497, 1991.
[34] M. Granovetter, “The strength of weak ties,” The American Journal of Sociology, Vol. 78, No. 6, pp. 1360-1380, 1973.
[35] R. Gross and A. Acquisti, “Information revelation and privacy in online social networks,” Workshop on Privacy in the Electronic Society, Alexandria, Virgin, 2005.
[36] J. P. Guilford, “Fundamental statistics in psychology and education (4-ed),” N.Y.: McGraw-Hill, 1965.
[37] M. Hammer, “Core and extended social networks in relation to health and illness,” Social Science and Medicine, Vol. 17, No. 7, pp. 405-411, 1983.
[38] M. T. Hansen, “The search-transfer problem: the role of weak ties in sharing knowledge across organization subunits,” Administrative Science Quarterly, Vol. 44, No. 1, pp. 82-111, 1999.
[39] M. T. Hansen, M. L. Mors and B. LØVÅS, “Knowledge sharing in organizations: multiple networks, multiple phases,” The Academy of Management Journal, Vol. 48, No. 5, pp. 776-793, 2005.
[40] M. Haspels, “Will you be my Facebook friend,” Paper presented at the Proceedings of the 4Th Annual GRASP Symposium, Wichita State University, 2008.
[41] C. Haythornthwaite, “Social networks and internet connectivity effects,” Information, Communication, & Society, Vol. 8, No. 2, pp. 125-147, 2005.
[42] G. C. Homans, “Social behavior as exchange,” The American Journal of Sociology, Vol. 63, No. 6, pp. 597-606, 1958.
[43] C. L. Hsu and T. S. Wu, “Efficient proxy signature schemes using self-certified public keys”, Applied Mathematics and Computation, Vol. 152, No. 3, pp. 807-820, 2004.
[44] H. Huang and Z. Cao, “An ID-based authenticated key exchange protocol based on bilinear Diffie-Hellman problem,” ASIACCS ’09: Proceedings of the 4th International Symposium on Information, Computer, and Communications Security, 2009.
[45] Institute of Electrical and Electronics Engineers, IEEE P1363 Standard Specifications for Public Key Cryptography, 2000.
[46] ISO/IEC 9594-8, “Information technology – open systems in interconnection – the directory: authentication framework,” International Organization for Standardization, 1995 (equivalent to ITU-t Rec. X. 509, 1993).
[47] ISO/IEC 14888-3, “Information technology – security techniques – digital signature with appendix – part 3: certificate-based mechanisms,” International Organization for Standardization, 1998.
[48] ISO/IEC 11770-3, “Information technology – security techniques – key management – part 3: mechanisms using asymmetric techniques,” 1999.
[49] ISO/IEC 15946-1, “Information technology – security techniques – cryptographic techniques based on elliptic curves – part 1: general,” 2002.
[50] ISO/IEC 15946-2, “Information technology – security techniques – cryptographic techniques based on elliptic curves – part 2: digital signatures,” 2002.
[51] ISO/IEC 15946-3, “Information technology – security techniques – cryptographic techniques based on elliptic curves – part 3: key establishment,” 2002.
[52] S. Jarvenpaa and D. Leidner, “Communication and trust in global virtual teams,” Journal of Computer-Mediated Communication, 1998.
[53] E. A. Jun, J. D. Ji, J. Lim and S. W. Jung, “Improved remote user authentication scheme using bilinear pairings,” ICHIT ’09: Proceedings of the 2009 International Conference on Hybrid Information Technology, 2009.
[54] H. F. Kaiser, “An index of factorial simplicity,” Psychometrika, Vol. 39, No.1, pp. 31-36, 1974.
[55] J. Kar and B. Majhi, “A novel deniable authentication protocol based on Diffie-Hellman algor ithm using pairing technique,” ICCCS ’11: Proceedings of the 2011 International Conference on Communication, Computing & Security, 2011.
[56] F. Karinthy, “Everything is different,” 1929.
[57] J. Kohl and C. Neuman, “The Kerberos authentication service (v5),” Internet RFC 1510, 1993.
[58] N. Koblitz, “Elliptic curve cryptosystems,” Mathematics of Computation, Vol. 48, No. 177, pp. 203-209, 1987.
[59] R. Kraut, M. Patterson, V. Lundmark, S. Kiesler, W. Mukopadhyay and W. Sherlis, “Internet paradox: a social technology that reduces social involvement and psychological well-being,” American Psychologist, Vol. 53, No. 9, pp. 1017-1031, 1998.
[60] C. Lampe, N. Ellison and C. Steinfield, “A Facebook in the crowd: social searching vs. social browsing,” Paper presented at the Proceedings of the 2006 20th Anniversary Conference on Computer Supported Cooperative Work, Canada, pp. 167-170, 2006.
[61] R. Larose and M. Eastin, “A social cognitive theory of internet uses and gratifications: toward a new model of media attendance,” Journal of Broadcasting & Electronic Media, Vol. 48, No. 3, pp. 358-377, 2004.
[62] A. Lenhart and M. Madden, “Teens, privacy, & online social networks,” Pew Internet and American Life Project Report, 2007.
[63] J. Leskovec and E. Horvitz, “Planetary-scale views on a large instant-messaging network,” Paper presented at the Proceeding of the 17th International Conference on World Wide Web, Beijing, China, pp. 915-924, 2008.
[64] L. Lessig, “The architecture of privacy,” 1998.
[65] D. Z. Levin and R. Cross, “The strength of weak ties you can trust: the mediating role of trust in effective knowledge transfer,” Management Science, Vol. 50, No. 11, pp. 1477-1490, 2004.
[66] J. D. Lewis and A. Weigert, “Trust as a social reality,” Social Forces, Vol. 63, No. 4, pp. 967-985, 1985.
[67] C. Li and J. Bernoff, “Groundswell,” Cambridge, MA: Harvard Business Press, 2008.
[68] C. Liu, J. Marchewka, J. Lu and C. Yu, “Beyond concern: a privacy-trust-behavioral intention model of electronic commerce,” Information & Management, Vol. 42, No. 1, pp. 127-142, 2004
[69] R. Lu and Z. Cao, “A new deniable authentication protocol from bilinear pairings,” Applied Mathematics and Computation, Vol. 168, No. 2, pp. 954-961, 2005.
[70] R. Lu, X. Lin, Z. Cao, L. Qin and X. Liang, “A simple deniable authentication protocol based on the Diffie-Hellman algorithm,” International Journal of Computer Mathematics, Vol. 22, No. 3, pp. 1-9, 2007.
[71] G. Lowe, “Some new attacks upon security protocols,” 9th IEEE Computer Security Foundations Workshop, IEEE Computer, Society Press, pp.162-169, 1996.
[72] A. Mcafee, “The impact of information technology on businesses and their leaders,” 2007.
[73] K. Y. A. McKenna and A. S. Green, “Virtual group dynamics,” Group Dynamics: Theory, Research, and Practice, Vol. 6, No. 1, pp. 116-127, 2002.
[74] A. J. Menezes, P. C. Oorschot and S. A. Vanstone, “Handbook of Applied Cryptography,” CRC Press Inc., 1997.
[75] G. Mesch and I. Talmud, “The quality of online and offline relationships: the role of multiplexity and duration of social relationships,” The Information Society, Vol. 22, No. 3, pp. 137-148, 2006.
[76] S. Milgram, “The small world problem,” Psychology Today, pp. 60-67, 1967.
[77] V. Miller, “Short programs for functions on curve,” retrieved from: http://tcs.uj.edu.pl/~mistar/pdf/Miller1986ShortPrograms.pdf, 1986.
[78] G. Milne and M. Culnan, “Strategies for reducing online privacy risks: Why consumers read (or don’t read) online privacy notices,” Journal of Interactive Marketing, Vol. 18, No. 3, pp. 15-29, 2004.
[79] G. E. Moore, “Cramming more components onto integrated circuits,” Electronics, Vol. 38, No. 8, pp. 114-117, 1965.
[80] N. H. Nie and L. Erbing, “Internet and society: a preliminary report,” Paper presented at the CA: Stanford Instituted for the Quantitative Study of Society, 2000.
[81] NIST, “The digital signature standard,” Communications of the ACM, Vol. 35, No. 7, 1992.
[82] NIST, “Digital signature standard”, FIPS Publication 186-2, 2000.
[83] Nownews, “賣個資給壹週刊熊世芬只是下游還有規模驚人大盤,” retrieved from: http://www.nownews.com/2008/04/26/10844-2266735.htm, 2008.
[84] J. Owyang, “Teleconference strategy for Facebook, a ready-made marketing platform,” Forester Research, Inc, 2008.
[85] Z. Papacharissi and A. Rubin, “Predictors of internet use,” Journal of Broadcasting & Electronic Media, Vol. 44, No. 2, pp. 175-196, 2000.
[86] M. R. Parks and K. Floyd, “Making friends in cyberspace,” Journal of Communication, Vol. 46, No. 1, pp. 80-97, 1996.
[87] E. Paul and S. Brier, “Friendsickness in the transition to college: precollege predictors and college adjustment correlates,” Journal of Counseling and Development, Vol. 79, No. 1, pp. 77-89, 2001.
[88] C. S. Pereira and A. L. Soares, “Improving the quality of collaboration requirements for information management through social networks analysis,” International Journal of Information Management, Vol. 27, No. 2, pp. 86-103, 2007.
[89] T. A Pierce, “X-posed on Myspace: a content analysis of MySpace social networking sites,” Journal of Media Psychology, Vol. 12 No. 1, 2007.
[90] l. D. S. Pool and M. Kochen, “Contacts and influence,” Social Networks, Vol. 1, pp. 5-51, 1978.
[91] R. D. Putnam, “Bowling alone: the collapse and revival of American community,” 2000.
[92] M. D. Raimondo, R. Gennaro and H. Krawczyk, “Deniable authentication and key exchange,” CCS ’06: Proceedings of the 13th ACM conference on Computer and communications security, 2006.
[93] Q. Ren, Y. Mu and W. Susilo, “Mitigating phishing with ID-based online/offline authentication,” AISC ’08: Proceedings of the sixth Australasian conference on Information security, 2008.
[94] R. Rivest, A. Shamir and L. Adleman, “A method for obtaining digital signature and public-key cryptosystem,” Communications of the ACM, Vol. 21, No. 2, pp. 120-126, 1978.
[95] D. Schoenbachler and G. Gordon, “Trust and consumer willingness to provide information in database-driven relationship marketing,” Journal of interactive marketing, Vol. 16, No. 3, pp. 2-16, 2002.
[96] A. H. Segars, “Assessing the unidimensionality of measurement: a paradigm and illustration within the context of information system research,” Omega, Vol. 25, No. 1, pp. 107-121, 1996.
[97] Z. Shao, “Efficient deniable authentication protocol based on generalized ElGamal signature scheme,” Computer Standards & Interfaces, Vol. 26, No. 5, pp. 449-454, 2004.
[98] Y. Shi and J. Li, “Identity-Based deniable authentication protocol,” Electronics Letters, Vol. 41, No. 5, 2005.
[99] W. G. Shieh and W. B. Horng, “Security analysis and improvement of remote user authentication scheme without using smart cards,” ICIC Express Letters: An International Journal of Research and Surveys, Vol. 4, No. 6, pp. 2431-2436, 2010.
[100] W. G. Shieh and W. B. Horng, “Cryptanalysis and improvement of Wen et al.’s provably secure authentication key exchange protocols for low power computing devices,” ICIC Express Letters: An International Journal of Research and Surveys, Vol. 5, No. 11, pp. 4027-4032, 2011.
[101] W. Shu and Y. H. Chuang, “Why people share knowledge in virtual communities,” Social Behavior and Personality, Vol. 39, No. 5, pp. 671-690, 2011.
[102] W. Shu and Y. H. Chuang, “The perceived benefits of 6-degree-separation social network service,” Internet Research, Vol. 12, No. 1, pp. 26-45, 2011.
[103] L. Sproull and S. Faraj, “Public access to the internet,” 1995.
[104] J. Sundén, “Material virtualities,” Paper presented at the New York: Peter Lang, 2003.
[105] P. Thoits, “Conceptual, methodological and theoretical problems in studying social support as a buffer against life stress,” Journal of Health and Social Behavior, Vol. 23, No. 2, pp. 145-159, 1982.
[106] M. Van der Poel, “Delineating personal support networks,” Social Networks, Vol. 15, No.1, pp. 49-70, 1993.
[107] D. Q. Viet, A. Yamamura and H. Tanaka, “Anonymous password-based authentication key exchange,” Advances in Cryptology－INDOCRYPT’05, pp. 244-257, 2005.
[108] Y. Wang, J. Li and L. Tie, “A simple protocol for deniable authentication based on ElGamal cryptography,” 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 45, No. 4, pp.193-194, 2005.
[109] Wikipeida, “Facebook,” retrieved from: http://zh.wikipedia.org/zh-tw/Facebook, 2010.
[110] Wikipeida, “Diffie–Hellman key exchange,” retrieved from: http://en.wikipedia.org/wiki/Diffie-Hellman-Merkle, 2012.
[111] B. Wellman, “The community question: the intimate networks of east Yorkers,” American Journal of Sociology, Vol. 84, No. 5, pp. 1201-1231, 1979.
[112] B. Wellman, “Computer networks as social networks: collaborative work, telework and virtual community,” Annual Review of Sociology, Vol. 22, pp. 211-238, 1996.
[113] B. Wellman, A. Q. Haase, J. Witte and K. Hampton, “Does the internet increase, decrease, or supplement social capital? social networks, participation, and community commitment,” American Behavioral Scientist, Vol. 45, No. 3, pp. 436-455, 2001.
[114] T. Wills, “Supportive functions of interpersonal relationships,” In Social Support and Health, edited by S. Cohen and S.L. Syme. Orlando: Academic Press, 1985.
[115] S. C. Yang and C. K. Farn, “Social capital, behavioural control, and tacit knowledge sharing — a multi-informant design,” International Journal of Information Management, Vol. 29, No. 3, pp. 210-218, 2009.
[116] E. J. Yoon, W. S. Lee and K. Y. Yoo, “Secure remote user authentication scheme using bilinear pairings,” WISTP’07: Proceedings of the 1st IFIP TC6/WG8.8 /WG11.2 international conference on Information security theory and practices: smart cards, mobile and ubiquitous computing systems, pp. 102-114, 2007.
[117] E. J. Yoon, E. K. Ryu, and K. Y. Yoo, “Improvement of Fan et al.’s deniable authentication protocol based on Diffie-Hellman algorithm,” Applied Mathematics and Computation, Vol. 167, No. 1, pp. 274-280, 2005.

指導教授

粟四維、許智誠
(Wesley Shu、Kevin C. Hsu)

審核日期

2012-11-23

推文