(3.226.72.118) 您好!臺灣時間:2021/05/13 08:12
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果

詳目顯示:::

: 
twitterline
研究生:溫玎薈
研究生(外文):Ting-Hui Wen
論文名稱:支援關鍵字搜尋的身分識別廣播加密方法
論文名稱(外文):Identity-Based Broadcast Encryption Scheme with Keyword Search
指導教授:丁培毅丁培毅引用關係
指導教授(外文):Pei-Yih Ting
學位類別:碩士
校院名稱:國立臺灣海洋大學
系所名稱:資訊工程學系
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2010
畢業學年度:98
語文別:中文
論文頁數:56
中文關鍵詞:基於身分識別的加密關鍵字搜尋廣播加密標準模型
外文關鍵詞:Identity-based encryptionkeyword searchbroadcast encryptionstandard model
相關次數:
  • 被引用被引用:0
  • 點閱點閱:227
  • 評分評分:系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔
  • 下載下載:20
  • 收藏至我的研究室書目清單書目收藏:0
本論文提出一個基於身分識別、支援關鍵字搜尋的廣播加密系統。修改Boneh和Hamburg在2008年提出的“廣義的廣播加密系統”,加入支援關鍵字搜尋的機制,此系統可運用在成員眾多、須要動態指定存取權限的資料庫系統中,其中被指定的成員才可進行搜尋和解密此密文,而密文的長度不會因可解密的成員變多而變長。其次定義此可搜尋的廣播加密系統的密文不可分辨安全性,
本文在標準模型(Standard Model)下證明此系統的安全性。
1 緒論 1
1.1 支援關鍵字搜尋的公開金鑰加密系統. . . . . . . . . . . . . 1
1.2 基於身分識別的加密系統. . . . . . . . . . . . . . . . . 4
1.3 廣播加密系統 . . . . . . . . . . . . . . . . . . . . . 5
1.4 研究動機 . . . . . . . . . . . . . . . . . . . . . . . 7
1.5 主要貢獻 . . . . . . . . . . . . . . . . . . . . . . . 8
1.6 章節介紹 . . . . . . . . . . . . . . . . . . . . . . . 8

2 背景知識 9
2.1 雙線性配對 . . . . . . . . . . . . . . . . . . . . . . 9
2.2 基本定義與假設 . . . . . . . . . . . . . . . . . . . . 9
2.3 廣義身分識別加密系統 . . . . . . . . . . . . . . . . . 10
2.4 空間加密系統. . . . . . . . . . . . . . . . . . . . . 13
2.5 支援關鍵字搜尋的公開金鑰加密系統 . . . . . . . . . . . . 17

3 支援關鍵字搜尋的身分識別廣播加密方法 19
3.1 安全性定義. . . . . . . . . . . . . . . . . . . . . . 22
3.2 系統架構. . . . . . . . . . . . . . . . . . . . . . . 24

4 安全性證明 31
4.1 安全性證明. . . . . . . . . . . . . . . . . . . . . . 31
4.2 討論 . . . . . . . . . . . . . . . . . . . . . . . . 41

5 結論與未來工作 43
5.1 結論 . . . . . . . . . . . . . . . . . . . . . . . . 43
5.2 未來工作 . . . . . . . . . . . . . . . . . . . . . . 43

附錄A 52
[1] J. Anzai, N. Matsuzaki, and T. Matsumoto, “A quick group key distribution scheme with ‘entity revocation’,” Advances in Cryptology - ASIACRYPT’99, LNCS, vol. 1716, pages 333–347, 1999.

[2] N. Attrapadung, J. Furukawa, and H. Imai, “Forward-secure and searchable broadcast encryption with short ciphertexts and private keys,” Advances in Cryptology - ASIACRYPT’06, LNCS, vol. 4284, pages 161–177, 2006.

[3] N. Attrapadung and H. Imai, “Graph-decomposition-based frameworks for subset-cover broadcast encryption and efficient instantiations,” Advances in Cryptology - ASIACRYPT’05, LNCS, vol. 3788, pages 100–120, 2005.

[4] N. Attrapadung, K. Kobara, and H. Imai, “Broadcast encryption with short keys and transmissions,” ACM workshop on Digital Rights Management Workshop, DRM’03, pages 55–66, 2003.

[5] J. Baek, R. Safavi-Naini, and W. Susilo, “On the integration of public key data encryption and public key encryption with keyword search,” Information Security Conference, ISC’06, LNCS, vol. 4176, pages 217–232, 2006.

[6] J. Baek, R. Safavi-Naini, and W. Susilo, “Public key encryption with keyword search revisited,” International Conference on Computational Science and Applications, ICCSA’08, LNCS, vol. 5072, pages 1249–1259, 2008.

[7] M. Bellare and P. Rogaway, “Random oracles are practical: a paradigm for designing efficient protocols,” Computer and Communications Security, CCS’93, pages 62–73, 1993.

[8] S. Berkovits, “How to broadcast a secret,” Advances in Cryptology - EUROCRYPT’91, LNCS, vol. 547, pages 535–541, 1991.

[9] D. Boneh and X. Boyen, “Efficient selective-ID secure identity based encryption without random oracles,” Advances in Cryptology - EUROCRYPT’04, LNCS, vol. 3027, pages 223–238, 2004.

[10] D. Boneh and X. Boyen, “Secure identity based encryption without Random Oracles,” Advances in Cryptology - CRYPTO’04, LNCS, vol. 3152, pages 197–206, 2004.

[11] D. Boneh and X. Boyen, “Anonymous hierarchical identity-based encryption (without random oracles),” Advances in Cryptology - CRYPTO’06, LNCS, vol. 4117, pages 290–307, 2006.

[12] D. Boneh, X. Boyen, and E. Goh, “Hierarchical identity based encryption with constant size ciphertext,” Advances in Cryptology - EUROCRYPT’05, LNCS, vol. 3494, pages 440–456, 2005.

[13] D. Boneh, G. D. Crescenzo, R. Ostrovsky, and G. Persiano, “Public key encryption with keyword search,” Advances in Cryptology - EUROCRYPT’04, LNCS, vol. 3027, pages 506–522, 2004.

[14] D. Boneh and M. K. Franklin, “Identity based encryption from the Weil pairing,” Advances in Cryptology - CRYPTO’01, LNCS, vol. 2139, pages 213–229, 2001.

[15] D. Boneh and M. K. Franklin, “Identity based encryption from the Weil pairing,” SIAM Journal on Computing, vol. 32, no. 3, pages 586–615, 2003.

[16] D. Boneh, C. Gentry, and B. Waters, “Collusion resistant broadcast encryption with short ciphertexts and private keys,” Advances in Cryptology - CRYPTO’05, LNCS, vol. 3621, pages 258–275, 2005.

[17] D. Boneh and M. Hamburg, “Generalized identity based and broadcast encryption schemes,” Advances in Cryptology -
ASIACRYPT’08, LNCS, vol. 5350, pages 455–470, 2008.

[18] S. W. Chang, “Generalized anonymous broadcast encryption scheme,” Master thesis, Departmet of Computer Science and Engineering, National Taiwan Ocean University, 2009, available at http://140.121.140.23/cgi-bin/cdrfb3/gsweb.cgi?o=dstdcdr.

[19] C. Delerabl´ee, “Identity-based broadcast encryption with constant size ciphertexts and Private Keys,” Advances in Cryptology - ASIACRYPT’07, LNCS, vol. 4833, pages 200–215, 2007.

[20] C. Delerabl´ee, P. Paillier, and D. Pointcheval, “Fully collusion secure dynamic broadcast encryption with constant-size ciphertexts or decryption keys,” Pairing’07,, LNCS, vol. 4575, pages 39–59, 2007.

[21] A. Fiat and M. Naor, “Broadcast encryption,” Advances in Cryptology - CRYPTO’93, LNCS, vol. 773, pages 480–491, 1994.

[22] C. Gentry and A. Silverberg, “Hierarchical ID-based cryptography,” Advances in Cryptology - ASIACRYPT’02, LNCS, vol. 2501, pages 548–566, 2002.

[23] C. Gentry and B. Waters, “Adaptive security in broadcast encryption systems,” Advances in Cryptology - EUROCRYPT’09, LNCS, vol. 5479, pages 171–188, 2009.

[24] M. T. Goldrich, J. Z. Sun, and R. Tamassia, “Efficient tree-based revocation in groups of low-state devices,” Advances in Cryptology - CRYPTO’04, LNCS, vol. 3152, pages 511–527, 2004.

[25] P. Golle, J. Staddon, and B. Waters, “Secure conjunctive keyword search over encrypted data,” Applied Cryptography and Network Security, ACNS’04, LNCS, vol. 3089, pages 31–45, 2004.

[26] D. Halevy and A. Shamir, “The LSD broadcast encryption scheme,” Advances in Cryptology - CRYPTO’02, LNCS, vol. 2442, pages 47–60, 2002.

[27] S. Hohenberger and B. Waters, “Constructing Verifiable Random Functions with Large Input Spaces,” Advances in Cryptology - EUROCRYPT’10, LNCS, vol. 6110, pages 656–672, 2010.

[28] J. Horwitz and B. Lynn, “Towards hierarchical identity-based encryption,” Advances in Cryptology - EUROCRYPT’02, LNCS, vol. 2332, pages 466–481, 2002.

[29] Y. H. Hwang and P. J. Lee, “Public key encryption with conjunctive keyword search and its extension to a multi-user system,” Pairing’07, LNCS, vol. 4575, pages 2–22, 2007.

[30] D. Naor, M. Naor, and J. Lotspiech, “Revocation and tracing schemes for stateless receivers,” Advances in Cryptology - CRYPTO’01, LNCS, vol. 2139, pages 41–62, 2001.

[31] M. Naor and B. Pinkas, “Efficient trace and revoke schemes,” Financial Cryptography, FC’00, pages 1–20, 2000.

[32] M. Naor and O. Reingold, “Number-theoretic constructions of efficient pseudo-random functions,” Journal of the ACM, vol. 51, no. 2, pages 231–262, 2004.

[33] D. J. Park, K. Kim, and P. J. Lee, “Public key encryption with conjunctive field keyword search,” Workshop on Information Security Applications, WISA’04, LNCS, vol. 3325, pages 73–86, 2004.

[34] R. Sakai and J. Furukawa, “Identity-based broadcast encryption,” Cryptology eprint Archive, Report 2007/217, available at http://eprint.iacr.org/2007/217.

[35] A. Shamir, “Identity-based cryptosystems and signature schemes,” Advances in Cryptology - CRYPTO’84, LNCS, vol. 196, pages 47–53, 1984.

[36] P. Wang, H. Wang, and J. Pieprzyk, “Keyword field-free conjunctive keyword searches on encrypted data and extension for dynamic groups,” Cryptology and Network Security, CANS’08, LNCS, vol. 5339, pages 178–195, 2008.

[37] B. R. Waters, “Efficient identity-based encryption without random oracles,” Advances in Cryptology - EUROCRYPT’05, LNCS, vol. 3494, pages 114–127, 2005.

[38] M. Zhou and Z. Cao, “Spatial encryption under simpler assumption,” Provable Security, ProvSec’09, LNCS, vol. 5848, pages 19–31, 2009.
連結至畢業學校之論文網頁點我開啟連結
註: 此連結為研究生畢業學校所提供,不一定有電子全文可供下載,若連結有誤,請點選上方之〝勘誤回報〞功能,我們會盡快修正,謝謝!
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
系統版面圖檔 系統版面圖檔