同儕網路虛擬環境之高效能安全設計

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：63

、訪客IP：18.223.106.100

姓名

詹謨澤(Mo-Che Chan) 查詢紙本館藏

畢業系所

資訊工程學系

論文名稱

同儕網路虛擬環境之高效能安全設計
(Efficient and Secure Designs for Peer-to-Peer Networked Virtual Environments)

相關論文

★ 在雙向一致任意大小的環上之具自我穩定能力之相位同步	★ 在一致的環狀串列上具自我穩定能力之交換配對
★ 低空間需求之分散式最佳同步交互器	★ 以IEEE 802.11為基礎行動隨意無線網路之混合式省電通訊協定
★ 利用區塊人臉特徵為基礎之混合式人臉辨識系統	★ 以范諾圖為基礎的對等式網路虛擬環境相鄰節點一致性研究
★ 行動隨意網路可調適及可延展之位置服務協定	★ 同儕式網路虛擬環境高效率互動範圍群播
★ 巨量多人線上遊戲之同儕網路互動範圍語音交談	★ 基於范諾圖之同儕式網路虛擬環境狀態管理
★ 利用多變量分析之多人線上遊戲信任使用者選擇	★ 無位置資訊無線感測網路之覆蓋及連通維持
★ 同儕網路虛擬環境3D串流同儕選擇策略	★ 一個使用802.11與RFID技術的無所不在導覽系統U-Guide之設計與實作
★ 同儕式三維資料串流	★ IM Finder: 透過即時通訊網路線上使用者找尋解答

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

[檢視]

[下載]

本電子論文使用權限為同意立即開放。
已達開放權限電子全文僅授權使用者為學術研究之目的，進行個人非營利性質之檢索、閱讀、列印。
請遵守中華民國著作權法之相關規定，切勿任意重製、散佈、改作、轉貼、播送，以免觸法。

摘要(中)

網路虛擬環境 (networked virtual environment, NVE) 允許使用者操控代表自己的化身 (avatar)，與其他使用者的化身透過網路連線在虛擬世界中互動。具有 3D 場景的網路虛擬環境有廣泛的應用，例如模擬、訓練、教學、線上遊戲等，這些應用近年來受到熱烈歡迎，吸引成千上萬的使用者同時使用進行互動。為了讓使用者在有限的頻寬之下能有身歷其境的體驗，網路虛擬環境使用大量 3D 串流 (3D streaming) 資料。 3D 串流技術能由頻寬決定所傳送 3D 圖形的細緻程度，讓使用者以漸進的方式下載化身視野範圍 (area of interest, AOI) 內的 3D 資料。另一方面，同儕網路 (peer-to-peer, P2P) 架構相較於傳統的以伺服器為基礎的架構具有較佳的可擴充性，能以低成本管理網路虛擬環境的化身狀態或傳輸龐大的 3D 資料；即便使用者人數增加時，還能維持可接受的效能，這因而引出許多同儕網路虛擬環境的研究。然而，由於同儕網路中，使用者所需要的化身互動訊息及 3D 資料通常經由未受信任的同儕設備下載，因此安全性議題是同儕網路虛擬環境中最重要的研究項目之一。本論文聚焦於同儕網路虛擬環境安全性議題，提出以下三種常見的安全方法：
防作弊方法：在同儕巨量多人線上遊戲 (peer-to-peer massively multiplayer online game, P2P MMOG) 中，為了防止遊戲中的投機者從同儕網路線上遊戲中獲取不當的利益，已有學者以數位簽章技術設計出防作弊方法。然而，此技術通常會耗用大量的計算資源，使得線上遊戲之類的應用失去其互動的即時性。因此我們利用赫序鍊金鑰 (hash-chain keys) 的一次性簽章 (one-time signature)，來設計有效率且安全的防作弊簽章方法，對於大部份的訊息，只須使用兩次赫序函數計算，即可達到不可否認性 (non-repudiation) 及訊息承諾 (message commitment)。因此我們所提的方法能有效率的達成防作弊機制降低執行運算量的目標。我們也提出不必事先產生赫序鍊金鑰的版本，來減少初始化的時間及降低記憶空間使用量。經過分析及實驗之後， EASES 能減少計算量、記憶空間及頻寬的使用量，以適用於同儕巨量多人線上遊戲的環境。
安全 3D 串流資料傳輸方法：對於資料提供者而言，傳送巨量互動 3D 串流資料給數以百萬計的使用者是艱難的任務。雖然同儕網路可以降低成本、而且提高擴充性，但是利用同儕網路傳遞資料對於商業資料供應商而言卻增加了安全上的疑慮。本論文從訂閱者服務的觀點，討論以同儕網路為基礎的非線性 3D 串流互動資料的系統模型，同時也提出資料確認的解決方案，讓使用者可以確認由其他使用者之處所下載得到的資料是正確的。
群體 3D 串流資料傳輸方法：我們提出以群體為基礎的同儕網路 3D 串流資料安全確認方法，對於有相同興趣的群體，先選出一位可被信任的首領，此首領下載 3D 資料後，檢查其來源及完整性，再經由安全管道向其餘群體成員發送 3D 資料的檢查碼 (checksum)，所有的成員即可確認從任何來源下載的 3D 資料的正確性。由於檢查碼的計算及安全通道的加解密過程的計算量遠低於驗證數位簽章，因此能節省大量計算資源。我們評估了使用赫序鍊簽章來驗證漸近式網格 (progressive meshes) 的計算量節省情形，以及評估簽章資料嵌入於 3D 網格座標的最低有效位元 (least significant bits, LSBs) 之後，影像呈現的品質幾乎無法察覺。

摘要(英)

A networked virtual environment (NVE) allows a user to control an avatar interacting with other users’ avatars through network connections in a virtual synthetic world. NVEs with realistic 3D scenes have wide applications, such as simulator, training, academia, online games, and so forth. These applications are becoming more and more popular, and attracting thousands of users to interact with each other simultaneously. 3D streaming schemes are utilized to provide good user experiences with limited network bandwidth. 3D streaming for the NVE is a technique to deliver 3D contents in different level of details according to available bandwidth, so that 3D contents in the avatar’s area of interest (AOI) can be downloaded progressively. Additionally, relative to traditional client-server architectures, the peer-to-peer (P2P) network is highly scalable for distributed computing and content sharing. Some research studies thus proposed P2P-based NVEs, instead of server-based NVEs, to manage a large number of users and to deliver a large amount of 3D contents to users. However, users’ status and 3D contents are usually retrieved from untrusted users. Therefore, to ensure security is essential in P2P NVEs. This dissertation discusses the designs of the following three P2P NVE secure schemes:
Cheat-proof. In order to prevent cheaters to gain unfair advantages in P2P NVEs, several cheat-proof schemes have been proposed by using digital signatures. However, digital signatures generally require a large amount of computations and thus may not be practical for NVEs. Based on the concept of one-time signature, we propose an efficient and secured event signature (EASES) scheme to efficiently sign discrete event messages with hash-chain keys. As most messages need only two hash operations to achieve non-repudiation and event commitment, the amount of computation is greatly reduced. We also describe a dynamic version of EASES that does not require the pre-production of hash-chain keys to reduce key preparation time and memory usage at the expense of a slight delay of message commitment. As shown by both analysis and experiments, the computation, memory, and bandwidth footprints of EASES are low, making it readily applicable to P2P NVEs.
Secured 3D streaming. Delivering massive amounts of interactive 3D contents to millions of potential users brings enormous challenges to content providers. P2P networks have thus been proposed to increase the system scalability in affordable ways. Building content delivery systems based on P2P approaches nevertheless causes security problems for commercial vendors. This dissertation presents a generic system model for subscription-based service providers to use P2P-based, non-linear streaming for interactive contents. We also propose solutions to the issue of content authentication, such that a user can be sure of the authenticity of contents retrieved from other users.
Group 3D streaming. A secure scheme for P2P 3D streaming with secure group communication is proposed to reduce computation overheads of authentication. Users of the same interest first form a group, and one of the users is then elected to be the trusted leader, who is to download 3D contents, to verify their authenticity and integrity, and to send group members a checksum value for each 3D content piece via group secure channels. By the encrypted checksum values, all group members can authenticate 3D contents originated from any source. Since checksum is cheap to compute and transmit, much computation is saved. We have evaluated the computation saving of the proposed scheme for the case of progressive meshes based on the hash chain signature 3D streaming authentication scheme. We have also evaluated the rendering quality when embedding hash chain signatures into the least significant bits (LSBs) of the mesh data to make the signatures imperceptible.

關鍵字(中)

★ 網路虛擬環境
★ 同儕網路
★ 防作弊
★ 3D 串流
★ 數位簽章

關鍵字(英)

★ networked virtual environment
★ peer-to-peer
★ cheat-proof
★ 3D streaming
★ digital signature

論文目次

Contents
摘要. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . i
Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iii
誌謝. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . vii
1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.1 Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.2 Cheat-Proof NVEs . . . . . . . . . . . . . . . . . . . . . . . . 5
1.3 Secure 3D Streaming . . . . . . . . . . . . . . . . . . . . . . . 6
1.4 Group 3D Streaming Authentication . . . . . . . . . . . . . . . 8
1.5 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
2 Related Work . . . . . . . . . . . . . . . . . . . . . . . . . . . 11
2.1 Cheat-Proof Schemes . . . . . . . . . . . . . . . . . . . . . . . 11
2.1.1 Description of NEO . . . . . . . . . . . . . . . . . . . . 13
2.1.2 Description of SEA . . . . . . . . . . . . . . . . . . . . 14
2.2 3D Streaming Schemes . . . . . . . . . . . . . . . . . . . . . . 15
2.2.1 Authenticated 3D Streaming . . . . . . . . . . . . . . . 19
2.2.2 Imperceptible Public 3D Mesh Authentication . . . . . 20
2.3 Secret Key Exchange . . . . . . . . . . . . . . . . . . . . . . . 22
3 Cheat-Proof for Peer-to-Peer Networked Virtual Environments 25
3.1 Message Signing Model . . . . . . . . . . . . . . . . . . . . . . 26
3.2 The EASES Scheme . . . . . . . . . . . . . . . . . . . . . . . 27
3.2.1 Initialization Phase . . . . . . . . . . . . . . . . . . . . 28
3.2.2 Signing Phase . . . . . . . . . . . . . . . . . . . . . . . 28
3.2.3 Verification Phase . . . . . . . . . . . . . . . . . . . . . 29
3.2.4 Re-initialization Phase . . . . . . . . . . . . . . . . . . 30
3.2.5 Late joining . . . . . . . . . . . . . . . . . . . . . . . . 31
3.3 Dynamic EASES . . . . . . . . . . . . . . . . . . . . . . . . . 32
3.3.1 Signing Phase . . . . . . . . . . . . . . . . . . . . . . . 32
3.3.2 Verification Phase . . . . . . . . . . . . . . . . . . . . . 33
3.4 Evaluation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34
3.4.1 Applicability . . . . . . . . . . . . . . . . . . . . . . . 34
3.4.2 Security Analysis . . . . . . . . . . . . . . . . . . . . . 35
3.4.3 Performance analysis and comparisons . . . . . . . . . 37
3.4.4 Experimental Results . . . . . . . . . . . . . . . . . . . 38
3.5 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 40
4 Secure Peer-to-Peer 3D Streaming . . . . . . . . . . . . . . . 43
4.1 System Model for P2P 3D Streaming . . . . . . . . . . . . . . 44
4.1.1 Authentication of 3D Content Streaming . . . . . . . . 46
4.1.2 Content Classifications . . . . . . . . . . . . . . . . . . 47
4.2 Proposed Authentication Schemes . . . . . . . . . . . . . . . . 49
4.2.1 Authenticating the Whole Model . . . . . . . . . . . . 49
4.2.2 Authenticating the Linear Stream . . . . . . . . . . . . 50
4.2.3 Authenticating the Independent Stream . . . . . . . . . 52
4.2.4 Authenticating the Partially Linear Stream . . . . . . . 54
4.3 Evaluation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 55
4.3.1 Security Analysis . . . . . . . . . . . . . . . . . . . . . 55
4.3.2 Performance Analysis . . . . . . . . . . . . . . . . . . . 57
4.4 Extended System Model and Future Topics . . . . . . . . . . . 58
4.5 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61
5 Group Peer-to-Peer 3D Streaming Authentication . . . . . 63
5.1 The Proposed Scheme . . . . . . . . . . . . . . . . . . . . . . 64
5.1.1 Secure Channel Initialization Phase . . . . . . . . . . . 65
5.1.2 Authenticity and Integrity Relay Phase . . . . . . . . . 66
5.1.3 Verification Phase . . . . . . . . . . . . . . . . . . . . . 68
5.2 Security Analysis . . . . . . . . . . . . . . . . . . . . . . . . . 69
5.2.1 The Trust of the Leader . . . . . . . . . . . . . . . . . 69
5.2.2 Authenticity and Integrity Relay . . . . . . . . . . . . 69
5.3 Evaluation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 70
5.3.1 Computation Cost . . . . . . . . . . . . . . . . . . . . 70
5.3.2 Rendering Quality for Imperceptible Authentication . . 72
5.4 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 76
6 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 77
Bibliography . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 79

參考文獻

[1] ANSI/IEEE Standard 754-1985. Standard for binary floating point arithmetic.
[2] Jacob R. Lorch Thomas Moscibroda Jeffrey Pang Srinivasan Seshan Ashwin
Bharambe, John R. Douceur and Xinyu Zhuang. Donnybrook: Enabling
large-scale, high-speed, peer-to-peer games. In Proceedings of SIGCOMM,
2008.
[3] N.E. Baughman and B.N. Levine. Cheat-proof playout for centralized and
distributed online games. In Proceedings of INFOCOM, volume 1, pages
104–113, 2001.
[4] M. Bellare, D. Pointcheval, and P. Rogaway. Authenticated key exchange
secure against dictionary attacks. Eurocrypt 2000 (LNCS 1807), pages
139–155, 2000.
[5] M. Bellare and P. Rogaway. Optimal asymmetric encryption. Eurocrypt’94,
pages 92–111, 1994.
[6] Francesco Bergadano, Davide Cavagnino, and Bruno Crispo. Chained
stream authentication. In Proceedings of the 7th Annual International
Workshop on Selected Areas in Cryptography, volume 2012 of Lecture Notes
In Computer Science, pages 144–157. Springer-Verlag, 2000.
[7] Ashwin Bharambe, Jeffery Pang, and Srinivasan Seshan. Colyseus: a distributed
architecture for online multiplayer games. In Proceedings of the
3rd conference on 3rd Symposium on Networked Systems Design & Implementation,
volume 3, pages 12–12, San Jose, CA, 2006.
[8] Jean Botev, Alexander Hohfeld, Hermann Schloss, Ingo Scholtes, Peter
Sturm, and Markus Esch. The HyperVerse: concepts for a federated and
torrent-based ’3D web’. International Journal of Advanced Media and
Communication, 2(4):331–350, 2008.
[9] David M. Burton. Elementary Number Theory, 6th Edition. ACM Press,
2005.
[10] Romain Cavagna, Christian Bouville, and Jerome Royan. P2P network
for very large virtual environment. In Proceedings of the ACM symposium
on Virtual reality software and technology, pages 269–276, New York, NY,
USA, 2006. ACM.
[11] Mo-Che Chan, Shun-Yun Hu, and Jehn-Ruey Jiang. An efficient and secure
event signature (EASES) protocol for peer-to-peer massively multiplayer
online games. Compututer Networks, 52(9):1838–1845, 2008.
[12] Mo-Che Chan, Shun-Yun Hu, and Jehn-Ruey Jiang. Secure peer-to-peer 3D
streaming. Multimedia Tools and Applications, 45(1-3):369–384, October
2009.
[13] Mo-Che Chan, Jehn-Ruey Jiang, Chao-Wei Hung, and Wei Tsang Ooi.
Group-based peer-to-peer 3D streaming authentication. In Proceedings of
the 15th International Conference on Parallel and Distributed Systems (ICPADS),
pages 685 –691, December 2009.
[14] Chien-nan Chen, Cing-yu Chu, Su-ling Yeh, Hao-hua Chu, and Polly
Huang. Measuring the perceptual quality of skype sources. SIGCOMM
Computer Communication Review, 42(4):521–526, September 2012.
[15] Kuan-Ta Chen, Polly Huang, and Chin-Laung Lei. Game traffic analysis:
An MMORPG perspective. Computer Networks, 50(16):3002–3023,
November 2006.
[16] Wei Cheng and Wei Tsang Ooi. Receiver-driven view-dependent streaming
of progressive mesh. In Proceedings of NOSSDAV, 2008.
[17] Wei Cheng, Wei Tsang Ooi, Sebastien Mondet, Romulus Grigoras, and
Géraldine Morin. An analytical model for progressive mesh streaming.
In Proceedings of the ACM Multimedia 2007, pages 737–746, Augsburg,
Germany, September 2007.
[18] Daniel Cohen, Nick Sevdalis, David Taylor, Karen Kerr, Mick Heys, Keith
Willett, Nicola Batrick, and Ara Darzi. Emergency preparedness in the
21st century: Training and preparation modules in virtual environments.
Resuscitation, 84(1):78 – 84, 2013.
[19] A.B. Corman, S. Douglas, P. Schachte, and V. Teague. A secure event
agreement (SEA) protocol for peer-to-peer games. In Proceedings of the 1st
International Conference on Availability, Reliability and Security, 2006.
[20] E. Cronin, B. Filstrup, and S. Jamin. Cheat-proofing dead reckoned multiplayer
games. In Proceedings of Application and Development of Computer
Games, 2003.
[21] Wei Dai. Crypto++ benchmarks. http://www.cryptopp.com/
benchmarks.html.
[22] Wei Dai. Crypto++ library. http://www.cryptopp.com.
[23] C.G. Dickey, D. Zappala, V. Lo, and J. Marr. Low latency and cheat-proof
event ordering for peer-to-peer games. In Proceedings of ACM International
Workshop on Network and Operating System Support for Digital Audio and
Video (NOSSDAV), Kinsale, County Cork, Ireland, pages 134–139, 2004.
[24] C. Diot and L. Gautier. A distributed architecture for multiplayer interactive
application on the internet. In IEEE Networks, volume 13, July
1999.
[25] Scott Douglas, Egemen Tanin, Aaron Harwood, and Shanika Karunasekera.
Enabling massively multi-player online gaming applications on a P2P
architecture. In Proceedings of the IEEE International Conference on Information
and Automation, pages 7–12, December 2005.
[26] Blizzard Entertainment. World of warcraft. http://us.battle.net/wow/
en/.
[27] Davide Frey, Jérôme Royan, Romain Piegay, Anne marie Kermarrec, Fabrice
Le Fessant, and Emmanuelle Anceaume. Solipsis: A decentralized
architecture for virtual environments. In Proceedings of the 1st International
Workshop on Massively Multiuser Virtual Environments (MMVE),
2008.
[28] C. GauthierDickey, V. Lo, and D. Zappala. Using n-trees for scalable
event ordering in peer-to-peer games. In Proceedings of the international
workshop on Network and operating systems support for digital audio and
video, pages 87–92. ACM Press New York, NY, USA, 2005.
[29] Laurent Gautier, Christophe Diot, and Jim Kurose. End-to-end transmission
control mechanisms for multiparty interactive applications on the
internet. In Proceedings of IEEE INFOCOM, 1999.
[30] Rosario Gennaro and Pankaj Rohatgi. How to sign digital streams. In
Proceedings of the 17th Annual International Cryptology Conference on
Advances in Cryptology, Lecture Notes In Computer Science 1294, pages
180 – 197, 1997.
[31] Yan Gu and Wei Tsang Ooi. Packetization of 3D progressive meshes for
streaming over lossy networks. In Proceedings of the 14th International
Conference on Computer Communications and Networks (ICCCN), San
Diego, CA, October 2005.
[32] Satyandra K. Gupta, Davinder K. Anand, John E. Brough, Maxim
Schwartz, and Robert A. Kavetsky. Training in Virtual Environments:
A Safe, Cost-Effective, and Engaging Approach to Training. EPSC Press,
2008.
[33] Michelle Honey, Kelley Connor, Max Veltman, David Bodily, and Scott Diener.
Teaching with Second Life: Hemorrhage management as an example
of a process for developing simulations for multiuser virtual environments.
Clinical Simulation in Nursing, 8(3):e79 – e85, 2012.
[34] Hugues Hoppe. Progressive meshes. In Proceedings of SIGGRAPH 1996,
pages 99–108, New Orleans, LA, 1996.
[35] Hugues Hoppe. View-dependent refinement of progressive meshes. In
SIGGRAPH ’97: Proceedings of the 24th annual conference on Computer
graphics and interactive techniques, pages 189–198, New York, NY, USA,
1997.
[36] Shun-Yun Hu. A case for 3D streaming on peer-to-peer networks. In
Proceedings of the 11th international conference on 3D web technology,
pages 57–63, 2006.
[37] Shun-Yun Hu, Shao-Chen Chang, and Jehn-Ruey Jiang. Voronoi state
management for peer-to-peer massively multiplayer online games. In Proceedings
of NIME, pages 1134–1138, January 2008.
[38] Shun-Yun Hu, Jui-Fa Chen, and Tsu-Han Chen. VON: a scalable peerto-
peer network for virtual environments. IEEE Network, 20(4):22–31,
July-August 2006.
[39] Shun-Yun Hu, Ting-Hao Huang, Shao-Chen Chang, Wei-Lun Sung, Jehn-
Ruey Jiang, and Bing-Yu Chen. FLoD: A framework for peer-to-peer 3d
streaming. In Proceedings of IEEE INFOCOM 2008. The 27th Conference
on Computer Communications, pages 1373–1381, April 2008.
[40] Guan-Yu Huang, Shun-Yun Hu, and Jehn-Ruey Jiang. Scalable reputation
management for P2P MMOGs. In Proceedings of IEEE Virtual Reality
(IEEE VR) workshop Massively Multiuser Virtual Environment (MMVE),
2008.
[41] IMVU. Instant messaging client. http://www.imvu.com/.
[42] Yan J. Security design in online games. In Proceedings of the 19th Annual
Computer Security Applications Conference, pages 286–295, 2003.
[43] Chris Joslin, Igor S Pandzic, and Nadia Magnenat Thalmann. Trends in
networked collaborative virtual environments. Computer Communications,
26(5):430 – 437, 2003.
[44] M. Kamada. A fair dynamical game over networks. In Proceedings of the
2004 International Conference on Cyberworlds (CW’04), pages 141–146,
2004.
[45] M. Kamada, K. Kurosawa, Y. Ohtaki, and S. Okamoto. A network game
based on fair random numbers. IEICE Transactions on Information and
Systems, 88(5):859–864, 2005.
[46] Ian A. Kash, John K. Lai, Haoqi Zhang, and Aviv Zohar. Economics of
bittorrent communities. In Proceedings of the 21st international conference
on World Wide Web, WWW ’12, pages 221–230, New York, NY, USA,
2012. ACM.
[47] J. Keller and G. Simon. Solipsis: A massively multi-participant virtual
world. In Proceedings of PDPTA, pages 262–268, 2003.
[48] A. Kirmse and C. Kirmse. Security in online games. Game Developer,
4(4):20–8, 1997.
[49] Bjorn Knutsson, Honghui Lu, Wei Xu, and Bryan Hopkins. Peer-to-peer
support for massively multiplayer games. In Proceedings of IEEE IMFOCOM,
2004.
[50] L. Lamport. Password authentication with insecure communication. Communications
of the ACM, 24(11):770–772, 1981.
[51] J. Lee, H. Lee, S. Ihm, T. Gim, and J. Song. Apolo: Ad-hoc peer-to-peer
overlay network for massively multi-player online games. Technical report,
KAIST Technical Report, CS-TR-2005-248, December 2005.
[52] Zhitang Li, Weidong Wang, Yejiang Zhang, and Weiming Li. Source authentication
of media streaming based on chains of iso-hash clusters. In Proceedings
of the Third international conference on Autonomic and Trusted
Computing, ATC’06, pages 398–407, Berlin, Heidelberg, 2006. Springer-
Verlag.
[53] Nien-Shien Lin, Ting-Hao Huang, and Bing-Yu Chen. 3D model streaming
based on jpeg 2000. IEEE TCE, 53(1), 2007.
[54] Virginia Lo, Dayi Zhou, Yuhong Liu, Chris GauthierDickey, , and Jun Li.
Scalable supernode selection in peer-to-peer overlay networks. In Proceedings
HOT-P2P, 2005.
[55] T. Miyoshi, Y. Shinozaki, and O. Fourmaux. A P2P traffic localization
method with additional delay insertion. In Proceedings of the 4th International
Conference on Intelligent Networking and Collaborative Systems
(INCoS), pages 148–154, 2012.
[56] P. Morillo, W. Moncho, J.M. Ordu na, and J. Duato. Providing Full Awareness
to Distributed Virtual Environments Based on Peer-To-Peer Architectures.
Springer Berlin / Heidelberg, June 2006.
[57] L. O’Gorman. Comparing passwords, tokens, and biometrics for user authentication.
In Proceedings of the IEEE, volume 91, pages 2012–2040,
December 2003.
[58] Mark Pauly, Markus Gross, and Leif P. Kobbelt. Efficient simplification of
point-sampled surfaces. In Proceedings of the IEEE Visualization, pages
163–170, 2002.
[59] D. Pittman and C. GauthierDickey. A measurement study of virtual populations
in massively multiplayer online games. In Proceedings of the 6th
ACM SIGCOMM workshop on Network and system support for games,
pages 25–30, 2007.
[60] David Pointcheval and Jacques Stern. Security proofs for signature
schemes. Advances in Cryptology — EUROCRYPT ’96, 1070/1996:387–
398, 1996.
[61] B. Preneel, B. Van Rompay, S. Ors, A. Biryukov, L. Granboulan,
E. Dottax, M. Dichtl, M. Schafheutle, P. Serf, and S. Pyka. Performance
of optimized implementations of the NESSIE primitives, 2003.
http://www.cosic.esat.kuleuven.ac.be/nessie/deliverables/.
[62] Michael O. Rabin. Digitalized signatures and public-key functions as intractable
as factorization. MIT/LCS/TR-212, MIT Laboratory for Computer
Science, 1979.
[63] K.A. Redmill, J.I. Martin, and U. Ozgliner. Virtual environment simulation
for image processing sensor evaluation. In Proceedings of Intelligent
Transportation Systems, pages 64–70, 2000.
[64] Linden Research. Second life. http://secondlife.com/.
[65] Christian Rey and Jean-Luc Dugelay. A survey of watermarking algorithms
for image authentication. EURASIP Journal on Advances in Signal Processing,
2002(1):613–621, January 2002.
[66] Philip Rosedale and Cory Ondrejka. Enabling player-created online worlds
with grid computing and streaming. Gamasutra Resource Guide, 2003.
[67] Bruce Schneier. Applied Cryptography, chapter 7. John Wiley & Sons, 2
edition, 1996.
[68] Sandeep Singhal and Michael Zyda. Networked Virtual Environments: Design
and Implementation. ACM Press, New York, 1999.
[69] Jouni Smed, Timo Kaukoranta, and Harri Hakonen. Aspects of networking
in multiplayer computer games. The Electronic Library, 20(2):87–97, 2002.
[70] Wei-Lun Sung, Shun-Yun Hu, and Jehn-Ruey Jiang. Selection strategies
for peer-to-peer 3D streaming. In Proceedings of the 18th International
Workshop on Network and Operating Systems Support for Digital Audio
and Video, pages 15–20, New York, NY, USA, 2008. ACM.
[71] Hao tain Wu and Yiu ming Cheung. Public authentication of 3D mesh
models. In Proceedings of the IEEE/WIC/ACM International Conference
on Web Intelligence, pages 940–948, 2006.
[72] Eyal Teler and Dani Lischinski. Streaming of complex 3D scenes for remote
walkthroughs. Computer Graphics Forum, 20(3):200–1, 2001.
[73] The MIT Kerberos Team. The network authentication protocol. http:
//web.mit.edu/Kerberos/.
[74] VastPark. Vastpark. http://www.vastpark.com/.
[75] PingWahWong. A public key watermark for image verification and authentication.
In Proceedings of International Conference on Image Processing,
ICIP 98, volume 1, pages 455–459, October 1998.
[76] Hao-Tian Wu and Yiu-Ming Cheung. A fragile watermarking scheme for
3D meshes. In Proceedings of the 7th workshop on Multimedia and security,
pages 117–124, New York, NY, USA, 2005. ACM.
[77] Thomas Zink and Marcel Waldvogel. Efficient bittorrent handshake obfuscation.
In Proceedings of the First Workshop on P2P and Dependability,
pages 2:1–2:5, New York, NY, USA, 2012. ACM.

指導教授

黃興燦、江振瑞
(Shing-Tsaan Huang、Jehn-Ruey Jiang)

審核日期

2013-6-21

推文