Please use this identifier to cite or link to this item:
A study of securely associating devices in ubiquitous computing environments
|關鍵字:||ubiquitous computing;無所不在運算;TAP;time of flight;secret sharing;TAP;飛行時間;秘密分享;身分識別||出版社:||資訊科學系所||引用:|| Adi Shamir, “How to Share a Secret,” Comm. ACM Vol.22, pp. 612-613, 1979.  A Lakshminarayanan and Huafei Zhu, “Practical device association protocols for wireless enabled personal devices,” IEEE Wireless Communications and Networking Conference, 2005.  Benjamin Halpert, “Friendly Authentication and Communication Experience (FACE) for Ubiquitous Authentication on Mobile Devices,” International Workshop on Wireless Ad-hoc Network, 2005.  Dave Singelee, and Bart Preneel, “Location Verification using Secure Distance Bounding Protocols,” Mobile Adhoc and Sensor Systems Conference, IEEE International Conference, 2005.  Dirk Balfanz, D.K. Smetters, Paul Stewart, and H. Chi Wong, “Talking to Strangers: Authentication in Ad-Hoc Wireless Networks,” In Proceedings of Network and Distributed System Security Symposium Conference, 2002.  Douglas R. Stinson, “Cryptography Theory and Practice,” pp. 327-329, 2000.  Enrique Soriano Salvador, “SHAD：A Human Centered Security Architecture for Paritionable, Dynamic, and Heterogeneous Distributed Systems.” In Proceedings of the 1st International Doctoral Symposium on Middle, pp. 294-298. New York, NY：ACM Press.  Frank Stajano, and Ross Anderson, “The resurrecting duckling: Security issues for ad-hoc wireless networks,” In 7th Security Protocols Workshop of Lecture Notes in Computer Science, pp. 172-174, 1999.  Frank Stajano, “The resurrecting duckling: next what?” In Security Protocols-8th International Workshop, 2001.  Frank Stajano, “Security for ubiquitous computing,” John Wiley and sons, 2002.  G.eorge Blakley, “Safeguarding Cryptographic Keys,” In Proceedings of the National Computer Conference, pp. 313–317, 1979.  John T. Kohl, “The Evolution of the Kerberos Authentication Service,” In Proceedings of Europen Conference, pp. 295-313, 1991.  K. Leal, F, J. Ballesteros, G. Duardiola, and E. Soriano. Plan B’s personal command module. Commanding user activities in ubiquitous environments. Submitted for publish, also in http://lsub.org/ls/, 204.  Naveen Sastry, Umesh Shankar and David Wagner, “Secure Verification of Location Claims,” In proceedings of ACM workshop on Wireless Security, pp. 1-10, 2003.  Stefan Brands and David Chaum, “Distance-Bounding Protocols” in Advances in Cryptology – EUROCRYPT’ 93, ser. Lecture Notes in Computer Science, LNCS 765. Springer-Verlag, pp. 344-359, 1994  Sye Loong Keoh, and Emil Lupu, “Toward Flexible Credential Verification in Mobile Ad-hoc Network,” In Proceedings of the second ACM international workshop on Principles mobile computing, pp. 76-83, 2002.  Tim Kindberg and Kan Zhank, “Validating and Securing Spontaneous Associations between Wireless Device,” In Proceedings of 6th Information Security conference, 2003.  Tim Kindberg,” Security Spontaneous Interactions,” appear in http://www-dse.ic.ac.uk.  賴溪松、韓亮、張真誠，近代密碼學及其應用，松崗電腦圖書資料股份有限公司，初版2003。||摘要:||
在無所不在運算(ubiquitous computing )環境中存在許多重要的問題，其中之一就是如何在裝置間自動的建立連結，並且達到安全通訊的目的。在這些連結中大致可區分為短程連結(short-term association)與長程連結(long-term association)兩類，而本篇論文所改善的TAP(touch-mediated association protocol)協定即是屬於後者。在TAP協定中存在一個問題：在協定中稱之為Mediator的裝置無法分辨要求建立連結的裝置，在當下是否為使用者所擁有的，因而導致其它屬於使用者的裝置內的秘密資訊被竊取。我們在此篇論文提出了用飛行時間(time of flight)與秘密分享(secret sharing)的概念來解決此種身分認證的問題。
There are many important problems in ubiquitous computing environment. One of them is how to associate between wireless devices spontaneously to achieve secure communication. These associations can be roughly divided into two types: short-term associations and long term associations. The TAP (touch-mediated association protocol) belongs to the latter.
This thesis focuses on TAP scheme and one of its devices, Mediator. One problem of the Mediator is that it can not authenticate the devices belong to legal owners which request to associate with Mediator. This will effectuate the secure information compromised. In this thesis, we propose a scheme which takes advantage of the time of flight and the secret sharing to solve this problem.
|Appears in Collections:||資訊科學與工程學系所|
Show full item record
TAIR Related Article
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.