Secure Query in Wireless Sensor Network Using Underground Parties

Abstract

<p class="Abstract"><span lang="EN-US">Recently, secure query has become a significant issue for researchers. It proposes the concept of secure multi-party query in Internet of things or sensor networks making use of &ldquo;underground parties&rdquo; to guarantee network security. Based on a novel network model assumption, it adopts homomorphic privacy and secure multi-party computation techniques to realize the above mentioned secure query, and then it puts forward the horizontal and vertical query algorithm in the top-k query through cooperation of underground parties. Thereafter, by the simulation tests it compares the time efficiency of the proposed algorithm with other typical sort algorithms under different top-k scenarios. At last, it analyzes the relationship between query time and number of underground party nodes.</span></p