Jinhui Yuan

Ms. Jinhui Yuan


Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications

1 January 2016
Verified
Conference Paper
Open access
PDF file
HZHongwei Zhou
Hongwei Zhou
JYJinhui Yuan
Jinhui Yuan
Since sensor nodes are usually deployed in a hostile environment, it is easy to be physically captured by an adversary. Thus, an adversary is capable of disturbing the entire network. To overcome it, we propose a trusted routing algorithm using subjective logic. In our solution, every node checks the similarity between itself and its neighbor nodes which are denoted as subjective opinion. On the opinion, the node choose its aggregation node in its neighbor nodes. Furthermore, if one aggregation node is compromised by an adversary, its neighbor nodes report the alarm accompanying with a subjective opinion and the routing is adjusted on the fusion reported opinions. Thus, the compromised nodes are circled. Our discussion and partly implementation show that our scheme provides trusted routing and improves the accuracy of sensing data without heavy energy overhead.

1 March 2020 in IOP Conference Series: Materials Science and Engineering
Verified
Conference Paper
Open access
JYJinhui Yuan
Jinhui Yuan
HZHongwei Zhou
Hongwei Zhou
In sensor networks, as the data collection point of nodes in the cluster, cluster head is easy to be the key target of attack. Once the cluster head node is controlled by the attacker, it will have a fatal impact on the security of the network. In order to solve the above problem, this paper proposes a cluster head monitoring nodes secret selection protocol. It uses secret selection algorithm to select the cluster head monitoring node from the neighbor nodes of the cluster head node. Thus, the attacker can not confirm the monitoring node, it results that the cluster head node can not be attacked. The protocol uses the spatio-temporal correlation between cluster head and cluster head monitoring nodes. Once it finds that cluster head node is suspected anomaly, it reports immediately to sink node. The analysis of protocol security shows that the protocol can meet the energy efficiency of sensor network and ensure the security of the system.

1 January 2018 in AIP Conference Proceedings
Verified
Conference Paper
Closed access
PDF file
HZHongwei Zhou
Hongwei Zhou
JYJinhui Yuan
Jinhui Yuan
RXRui Xiao
Rui Xiao
KZKai Zhang
Kai Zhang
JSJingyao Sun
Jingyao Sun
Since current commercial processor is not able to deal with the data in the cipher text, the sensitive data have to be exposed in the memory. It leaves a window for the adversary. To protect the sensitive data, a direct idea is to encrypt the data when the processor does not access them. On the observation, we have developed a lightweight memory encryption, called LeMe, to protect the sensitive data in the application. LeMe marks the sensitive data in the memory with the page table entry, and encrypts the data in their free time. LeMe is built on the Linux with a 3.17.6 kernel, and provides four user interfaces as dynamic link library. Our evaluations show LeMe is effective to protect the sensitive data and incurs an acceptable performance overhead.

8 March 2019 in IOP Conference Series: Earth and Environmental Science
Verified
Conference Paper
Open access
PDF file
JYJinhui Yuan
Jinhui Yuan
HZHongwei Zhou
Hongwei Zhou
ZWZhixin Wang
Zhixin Wang
For the verifier has to identify the attester which introduces more computation, homogenous node is obstacle for remote attestation of sensor nodes. In this paper, we firstly propose node personalization, which means that every node is different from others in the sensor network, to save the computation energy. Then, we discuss the principle of node personalization. Lastly, we present a practical case. More details, we develop node personalization with obfuscated code, and verify code integrity with cascading hashing. Our discussion shows the solution we present is feasible.