Research on the Secure Seeking for the Underground Parties in Internet of Things

With the developing of Internet of things, security has become a significant issue for researchers. This paper proposes the concept of underground party in internet of things or sensor networks and mainly discusses the secured problem of seeking underground party node using secure multiparty computation and information hiding technology. Based on wireless sensor network model assumption, we adopted the information hiding algorithm combined with (m, N) oblivious transfer protocol and dynamic union-find set to realize the above mentioned seeking process, and then it compares the time efficiency between optimization to the trust relationship pairs and non-optimization to that. Thereafter, we analyzed the merits and demerits of “on demand seeking” and “real time seeking”. At last, based on attacker interference probability model, we discussed the impact on secure seeking from inaccurate decision owed to false positive or negative rate.