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/43949
完整後設資料紀錄
DC 欄位值語言
dc.contributor.advisor雷欽隆
dc.contributor.authorChien-Shen Laien
dc.contributor.author賴建伸zh_TW
dc.date.accessioned2021-06-15T02:33:50Z-
dc.date.available2009-08-19
dc.date.copyright2009-08-19
dc.date.issued2009
dc.date.submitted2009-08-14
dc.identifier.citation[1] Barth, D. Boneh, and B. Waters, “Privacy in encrypted content distribution using private broadcast encryption,” In Financial Cryptography ’06, pages 52–64, 2006.
[2] J. Bethencourt, A. Sahai, and B. Waters, “Ciphertext-Policy Attribute-Based Encryption,” Proceedings of the 28th IEEE Symposium on Security and Privacy (Oakland), 2007.
[3] D. Boneh, C. Gentry, B. Waters, “Collusion resistant broadcast encryption with
short ciphertexts and private keys,” Lecture Notes in Computer Science 3621 (2005) Advances in Crytology – CRYPTO’05.
[4] R. Canetti, J. Garay, G. Itkis, D. Micciancio, M. Naor, B. Pinkas, I. Center, and Y. Heights, “Multicast security: a taxonomy and some efficient constructions,” INFOCOM’99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies
[5] R. Canetti, T. Malkin, and K. Nissim, “Efficient Communication-Storage Tradeoffs for Multicast Encryption, Advances in Cryptology-Eurocrypt99,” Lecture Notes in Computer Science, vol. 1592, pp. 459–474, 1999.
[6] I. Chang, R. Engel, D. Kandlur, D. Pendarakis, D. Saha, I. Center, and Y. Heights, “Key management for secure Internet multicast using Boolean function minimization techniques,” INFOCOM’99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE, vol. 2, 1999.
[7] L. Cheung, J. Cooley, R. Khazan, and C. Newport, “Collusion-Resistant Group Key Management Using Attribute-Based Encryption,”Cryptology ePrint Archive Report 2007/161, 2007. http://eprint.iacr.org, Tech. Rep.
[8] L. Cheung and C. Newport. Provably secure ciphertext policy abe. In CCS ’07, pages 456–465, 2007.
[9] D. Hankerson, S. Vanstone, and A. Menezes, Guide to Elliptic Curve Cryptography. Springer, 2004.
[10] S. Ilango, J. Thomas, “ Group key management utilizing Huffman and Petrick based approaches,” In Proc. of the Int. Conf. on Information Technology: Coding and Computing (ITCC’04). (2004)
[11] M. Moyer, J. Rao, and P. Rohatgi, “A survey of security issues in multicast communications,” Network, IEEE, vol. 13, no. 6, pp. 12–23, 1999.
[12] D. Naor, M. Naor, and J. Lotspiech. Revocation and tracing schemes for stateless receivers. In CRYPTO ’01, pages 41–62, 2001.
[13] B. C. Neuman, “Proxy-based authorization and accounting for distributed systems,” in Proc. 13th Int. Conf. Distributed Computing Systems, May 1993, pp. 283–291.
[14] Perrig, D. Song, and J. Tygar, “ELK, A New Protocol for Efficient Large-Group Key Distribution,” IEEE SYMPOSIUM ON SECURITY AND PRIVACY, pp. 247–262, 2001.
[15] T. Sasao, “Bounds on the average number of products in the minimum sum-of-products expressions for multiple-value input two-valued output functions,”, IEEE Transactions on Computers, vol. 40, no. 5, pp. 645–651, May 1991.
[16] Shamir, “How to share a secret,” Communications of the ACM, vol. 22, no. 11, pp. 612–613, 1979.
[17] A. Sherman and D. McGrew, “Key Establishment in Large Dynamic Groups Using One-Way Function Trees,” IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, pp. 444–458, 2003.
[18] J. Snoeyink, S. Suri, and G. Varghese, “A lower bound for multicast key distribution,” Computer Networks, vol. 47, no. 3, pp. 429–441, 2005
[19] T. Srinivasan, S. Sathish, R.V. Kumar, M. Vijayender, ”A hybrid scalable group
key management approach for large dynamic multicast networks,” In Proc. of the
Sixth IEEE Int. Conf. on Computer and Information Technology (CIT’06). (2006)
[20] S. Rafaeli and D. Hutchison, “A survey of key management for secure group communication,” ACM Computing Surveys (CSUR), vol. 35, no. 3, pp. 309–329, 2003.
[21] Ramachandran, Z. Zhou, and D. Huang, “Computing Cryptographic Algorithms in Portable and Embedded Devices,” Portable Information Devices, 2007. PORTABLE07. IEEE International Conference on, vol. 25-29, pp. 1–7, 2007.
[22] M. Waldvogel, G. Caronni, D. Sun, N. Weiler, and B. Plattner, “The VersaKey Framework: Versatile Group Key Management,” IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, vol. 17, no. 9, 1999.
[23] Wong, M. Gouda, and S. Lam, “Secure group communications using key graphs,”, IEEE/ACM Transactions on Networking, vol. 8, no. 1, pp. 16–30, 2000.
[24] S. Yu, K. Ren, and W. Lou, “Attribute-based on-demand multicast group setup with membership anonymity,” in Proc. Securecomm, Istanbul,Turkey, 2008.
[25] Z. Zhou and D. Huang, “ID-GC: An Efficient Identity-based Group Key Management Scheme” Cryptology ePrint Archive Report 2009/010, 2009. http://eprint.iacr.org, Tech. Rep.
[26] Quine-mccluskey logic simplifier. (http://sourceforge.net/projects/qmls/)
dc.identifier.urihttp://tdr.lib.ntu.edu.tw/jspui/handle/123456789/43949-
dc.description.abstract中文摘要
這篇論文描述一個高效率之團體金鑰管理方法,這方法是採用密文策略屬性加密的方式來進行。我們修改了由Bethencourt, Sahai and Waters提出的密文策略屬性加密法而提高效率。另一方面因為FT方法在團體金鑰管理議題上的儲存空間、計算和通訊負擔上都有很好的表現,所以我們就利用FT方法的概念去建築我們的團體金鑰管理架構。跟以往不同的是,我們利用FT所建立的團體金鑰管理架構是能抵抗共謀攻擊的。我們的方法和Cheung et al所提出的方法相比,在效率上有較佳的表現,因為我們的方法使用的雙線性配對只有O(1)而Cheung et al則使用了O(N)。N代表的是接觸結構上的屬性集合大小。
zh_TW
dc.description.abstractIn this thesis, we propose an efficient collusion resistant group key management scheme using ciphertext-policy attribute-based encryption. We modify the CP-ABE scheme of Bethencourt, Sahai and Waters to get more efficiency. Because of the Flat table (FT) scheme achieves high efficiency in terms of storage, computation and communication overheads, we use the idea of the flat table scheme to construct our key management scheme. Unlike past implementations of flat table, the proposed scheme is collusion-resistant. Our scheme outperform Cheung et al. in efficiency because the number of pairing operations in our scheme is O(1) and it is O(N) in Cheung et al.’s scheme where N denotes the size of attribute set in access structure.en
dc.description.provenanceMade available in DSpace on 2021-06-15T02:33:50Z (GMT). No. of bitstreams: 1
ntu-98-R96921064-1.pdf: 658215 bytes, checksum: 6e6853db46a72eef0e343f0d59f17835 (MD5)
Previous issue date: 2009
en
dc.description.tableofcontentsList of Figures II
List of Tables III
Chapter 1 Introduction 1
Chapter 2 Related Works 4
2.1 Flat Table Key Management 6
2.1.1 Dynamic Group Environment 6
2.1.2 Weakness of Flap Table Key Management 8
2.2 BSW CP-ABE 9
2.2.1 Access Structure of BSW CP-ABE 9
2.2.2 Algorithm of BSW CP-ABE Scheme 10
Chapter 3 Proposed Scheme 13
3.1 Bilinear Maps 13
3.2 Background Construction 14
3.3 Preliminaries 16
3.4 Algorithm 17
3.5 Dynamic Group Membership 21
3.6 Discussion of Dynamic Membership Policy 24
Chapter 4 Scheme Evaluation 25
4.1 Security Analysis 25
4.2 Performance Evaluation 27
Chapter 5 Conclusion 32
References 34
dc.language.isozh-TW
dc.subject屬性加密zh_TW
dc.subject共謀抵抗zh_TW
dc.subject扁平表單金鑰管理zh_TW
dc.subject密文策略zh_TW
dc.subject團體金鑰zh_TW
dc.subjectgroup key managementen
dc.subjectcollusion-resistanten
dc.subjectflat table key managementen
dc.subjectciphertext-policyen
dc.subjectattribute-based encryptionen
dc.title利用密文策略屬性加密之高效率團體金鑰管理zh_TW
dc.titleEfficient Collusion-Resistant Group Key Management Using CipherText-Policy Attribute-Based Encryptionen
dc.typeThesis
dc.date.schoolyear97-2
dc.description.degree碩士
dc.contributor.oralexamcommittee莊文勝,顏嗣鈞,郭斯彥,黃秋煌
dc.subject.keyword共謀抵抗,屬性加密,團體金鑰,密文策略,扁平表單金鑰管理,zh_TW
dc.subject.keywordcollusion-resistant,attribute-based encryption,group key management,ciphertext-policy,flat table key management,en
dc.relation.page36
dc.rights.note有償授權
dc.date.accepted2009-08-14
dc.contributor.author-college電機資訊學院zh_TW
dc.contributor.author-dept電機工程學研究所zh_TW
顯示於系所單位:電機工程學系

文件中的檔案:
檔案 大小格式 
ntu-98-1.pdf
  未授權公開取用
642.79 kBAdobe 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