Please use this identifier to cite or link to this item:
標題: 基於隨機化可搜尋加密法之私密握手協定
A Secret Handshake Protocol Based on Randomized Searchable Encryption
作者: 施依君
Shih, Yi-Chun
關鍵字: 私密握手;Secret Handshakes;可搜尋加密法;暗門;撤銷;Searchable Encryption;Trapdoor;Revocation
出版社: 資訊科學與工程學系所
引用: [1] G. Ateniese, M. Blanton, and J. Kirsch. Secret handshakes with dynamic and fuzzy matching. In Network and Distributed System Security Symposuim, pages 159–177. The Internet Society, 02 2007. CERIAS TR 2007-24. [2] J. Baek, R. Safavi-Naini and W. Susilo: Public key encryption with keyword search revisited. In: Gervasi, O., Murgante, B., Lagan`a, A., Taniar, D., Mun, Y., Gavrilova, M.L. (eds.) ICCSA 2008, Part I. LNCS, vol. 5072, pp. 1249–1259. Springer, Heidelberg , 2008. [3] D. Balfanz, G. Durfee, N. Shankar, D.K. Smetters, J. Staddon, and H.C. Wong: Secret handshakes from pairing-based key agreements. In IEEE Symposium on Security and Privacy, 2003. [4] M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In ACM conference on Computer and Communications Security (ACM CCS), pages 62–73, 1993. [5] D. Boneh, G.D. Crescenzo, R. Ostrovsky, and G. Persiano: Public-Key Encryption with Keyword Search. In Advances in Cryptology – Eurocrypt, volume 3027 of LNCS, pages 506–522.Springer, 2004. [6] C. Castellucia, S. Jarecki and G. Tsudik: Secret Handshake from CA-Oblivious Encryption. In Asiacrypt ’04, LNCS 3329, pp. 293–307, Springer-Verlag, 2004. [7] Y. Chang and M. Mitzenmacher: Privacy preserving keyword searches on remote encrypted data. In: J. Ioannidis, A. Keromytis, M. Yung (eds.), ACNS 2005. LNCS, vol. 3531, pp. 442–455. Springer, Heidelberg , 2005. [8] D.E. Denning and G.M. Sacco: Timestamps in key distribution protocols. Comm. ACM 24, pp. 533-536, 1981. [9] H. Huang and Z. Cao: A novel and efficient unlinkable secret handshakes scheme. In IEEE Commun. Lett., vol. 13, no. 5, pp. 363-365, 2009. [10] S. Jarecki, J. Kim and G. Tsudik: Beyond secret handshakes: affiliation-hiding authenticated key agreement. In: Malkin, T.G. (ed.) CT-RSA 2008. LNCS, vol. 4964, pp. 352–369. Springer, Heidelberg, 2008. [11] S. Jarecki, J. Kim and G. Tsudik: Group secret handshakes or affiliation-hiding authenticated group key agreement. In: Abe,M. (ed.) CT-RSA 2007. LNCS, vol. 4377, pp. 287–308. Springer, Heidelberg , 2006. [12] S. Jarecki and X. Liu: Unlinkable secret handshakes and key-private group key management schemes. In: J. Katz, M. Yung (eds.) ACNS 2007. LNCS, vol. 4521, pp. 270–287. Springer, Heidelberg , 2007. [13] Y Kawai and N Kunihiro: Secret handshake scheme with request-based-revealing. Computers & Mathematics with Applications, 2012 [14] Y. Kawai, K. Yoneyama and K. Ohta: Secret Handshake: Strong Anonymity Definition and Construction. In: F. Bao, H. Li, G. Wang (eds.) ISPEC 2009. LNCS, vol. 5451, pp. 219–229. Springer, Heidelberg , 2009 [15] B. LaMacchia, K. Lauter and A. Mityagin: Stronger security of authenticated key exchange. ProvSec 2007, LNCS, vol. 4784, pp. 1–16, Preliminary version available at, 2007. [16] S. Nasserian and G. Tsudik: Revisiting oblivious signature-based envelopes: new constructs and properties. Proc. of FC 2006, Auguilla, British West Indies, LNCS 4107, pp.221-235, Springer-Verlag, 2006. [17] D. Park, K. Kim and P. Lee: Public key encryption with conjunctive field keyword search. In: Lim, C.H., Yung, M. (eds.) WISA 2004. LNCS, vol. 3325, pp. 73–86. Springer, Heidelberg , 2005. [18] D.X. Song, D. Wagner, and A. Perrig: Practical techniques for searches on encrypted data. In IEEE Symposium on Security and Privacy, pages 44-55, 2000 [19] A. Sorniotti and R. Molva: Secret handshakes with revocation support. In: Lee, D.,Hong, S. (eds.) ICISC 2009. LNCS, vol. 5984, pp. 274–299. Springer, Heidelberg, 2010. [20] R. Su: On the security of a novel and efficient unlinkable secret handshakes scheme. In IEEE Commun. Lett., pp. 712-713, 2009. [21] D. Vergnaud. RSA-based secret handshakes. In International Workshop on Coding and Cryptography (WCC’05), volume 3969 of LNCS, pages 252–274, 2006. [22] Y. Wen and F. Zhang: A new revocable secret handshake scheme with backward unlinkability. In: EUROPKI 2010, LNCS 6711. Springer-Verlag; 2011. p. 17–30 [23] Y. Wen, F. Zhang and L. Xu: Secret handshakes from ID-based message recovery signatures: A new generic approach. Computers and electrical engineering, Volume 38, Issue 1, Pages 96–104, 2012. [24] Y. Wen, F. Zhang and L. Xu: Unlinkable secret handshakes from message recovery signature. Chinese Journal of Electron 2010;19(4):705–9 [25] C Xu, Z Li, Y Mu, H Guo and T Guo: Affiliation-Hiding Authenticated Asymmetric Group Key Agreement. Computer Journal, Volume 55, Number 10, pp. 1180-1191, 2012. [26] S. Xu and M. Yung: k-anonymous secret handshakes with reusable credentials. In ACM Conference on Computer and Communications Security, 2004. [27] N. Yamashita and K. Tanaka: Secret handshake with multiple groups. In: Lee, J.K., O. Yi, M. Yung (eds.) WISA 2006. LNCS, vol. 4298, pp. 339–348. Springer, Heidelberg, 2007. [28] Yanjiang Yang, Haibing Lu, Jian Weng, Xuhua Ding and Jianying Zhou: A Generic Approach for Providing Revocation Support in Secret Handshake. Information and Communications Security Lecture Notes in Computer Science Volume 7618, pp 276-284, 2012. [29] B. Zhang and F. Zhang: An efficient public key encryption with conjunctive-subset keywords search. J. Netw. Comput. Appl., 34, 262-267, 2011. [30] L. Zhou, W. Susilo and Y. Mu: Three-round secret handshakes based on Elgamal and DSA. Proc. of ISPEC 2006, Hangzhou, China, LNCS 3903, pp.332-342, Springer-Verlag, 2006.
  私密握手協定(secret handshakes)是一種兩人相互認證的協定,它允許各自擁有憑證的兩個人在彼此隱藏所屬單位及身分的條件下,做相互認證;亦即,任一個人要向另一個人證明他擁有有效的憑證,但此證明會隱藏此人的身分及所屬單位,如果執行握手的雙方分別屬於相異的群體,則另一個人將無法取得他的身分及所屬單位之相關資訊。傳統的私密握手協定皆須進行驗證的雙方幾個回合(round)的來回溝通,以便產生會談金鑰(session key)進行下一步訊息交換,然而,越多次訊息傳遞易致使惡意使用者有越多攻擊的機會,以及增加遺失通訊資料的機率。本文利用可搜尋加密法(searchable encryption)與私密握手協定之間的對應關係,將可搜尋加密法應用到私密握手協定上,如此一來,根據可搜尋加密法的特性,我們便能將溝通回合數控制在一個回合,降低了被攻擊的機會;另一方面我們也考慮了群體管理者(group authority)撤銷(revoke)不忠實使用者,讓群體管理者不再需要額外空間儲存撤銷清單。

A secret handshake scheme is a mutual authentication protocol. It allows two members with credentials to authenticate each other by hiding their identities and affiliations. If the two participants executing secret handshake belong to different groups, anyone would have no idea that who the other participant is or which group the other participant belongs to. Traditional secret handshake protocols need several rounds of communications to generate a session key, which is used for the following communications. However, the more message transmissions, the more chances for malicious users to attack and more likely for increasing the probability of losing communication data. Thus, we use the correspondence of searchable encryptions and secret handshake protocols to apply searchable encryptions to secret handshake protocols. As a result, according to the characteristic of searchable encryptions, we can reduce the communication round of secret handshake protocols to one round, and lower the probability of being attacked. On the other hand, we also consider the revocations of dishonest users. In the proposed scheme, the group authority does not need additional space to store a revocation list.
其他識別: U0005-2907201317162700
Appears in Collections:資訊科學與工程學系所

Show full item record

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.