在機器對機器通訊中建立機密分享之研究

A Research on Secret Sharing for Machine-to-Machine Communications

洪臣緯(Chen-Wei Hong)

指導教授 ： 張雅芬

國立臺中科技大學/資訊與流通學院/資訊工程系碩士班/碩士(2020年)

摘要

最近，Shen學者等人， 提出了用於機器對機器（M2M）通訊的秘密共享方案。 他們的方案採用拉丁方陣來生成2k個不相交的路徑，並採用Shamir學者的(t, n)門檻秘密共享來生成2k個子密鑰。 這2k個不相交的路徑用於傳輸2k個子密鑰和2k部分密文。 他們聲稱他們的方案可以確保M2M通訊的安全性。 在對Shen學者等人的秘密共享方案進行分析之後，我們發現該方案受到兩個缺陷的影響。 首先，即使已成功計算取得密鑰，目的節點也無法檢索該消息。 其次，任何知道自己私鑰的節點都可以計算得知其他節點的私鑰。在本研究中，首先我們將展示這兩個缺陷如何破壞Shen學者等人的秘密共享方案，並提出改善這些缺失的方法，在詳細分析本論文所提出的方案後 ，確信所提出方法具有強韌性，且可抵擋常見攻擊，如偽造攻擊及重播攻擊。

關鍵字

機器對機器 ； 拉丁方陣 ； 密鑰分享

並列摘要

Recently, Shen et al. proposed a secret sharing scheme for machine-to-machine (M2M) communications. Their scheme adopts Latin square to generate 2k disjoint paths and employs Shamir’s (t, n)-threshold secret sharing to generate 2k sub-keys. These 2k disjoint paths are used to transmit 2k sub-keys and 2k parts of the ciphertext. They claimed that their scheme could ensure the security of M2M communications. After analyzing Shen et al.’s secret sharing scheme, we find that it is vulnerable to two flaws. First, the destination node cannot retrieve the message even if the secret key has been recovered successfully. Second, any node that knows its own private key can obtain other node’s private key. In this study, we first show how these two flaws threaten Shen et al.’s secret sharing scheme, and we also propose an improvement to overcome the found flaws. Thorough analyses show that the proposed scheme ensures robustness, integrity, and origin confirmation, and it can resist common attacks such as forgery attack and replay attack.

並列關鍵字

machine-to-machine (M2M) ； Latin square ； secret sharing

參考文獻

[1] J. Shen, C. Wang, C.-F. Lai, A. Wang, and H.-C. Chao, “Direction density-based secure routing protocol for healthcare data in incompletely predictable networks,” IEEE Access, vol. 4, pp. 9163-9173, 2016.

[2] X. Deng, Z. Tang, L. T. Yang, M. Lin, and B. Wang, “Confident information coverage hole healing in hybrid industrial wireless sensor networks,” IEEE Transactions on Industrial Informatics, vol. 14, no. 5, pp. 2220-2229, 2018.

[3] J. Shen, T. Zhou, C.-F. Lai, J. Li, and X. Li, “Hierarchical trust level evaluation for pervasive social networking,” IEEE Access, vol. 5, pp. 1178-1187, 2017.

[4] Q. Zhang, L. T. Yang, X. Liu, Z. Chen, and P. Li, “A tucker deep computation model for mobile multimedia feature learning,” ACM Transactions on Multimedia Computing, Communications, and Applications, vol. 13, no. 3s, article no. 39, pp. 1-18, 2017, https://doi.org/10.1145/3063593.

[5] I. Chung, “Application of the special Latin squares to the parallel routing algorithm on hypercube,” Journal of Korean Information Science Society, vol. 19, no. 5, pp. 569-578, 1992.