Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Dongyi Yang

dblp:19/10146 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Blockchain and cryptocurrency security · 67% Network security · 33%
Computer networks
1 paper
Internet of things and sensor networks · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Blockchain and cryptocurrency security
incentive mechanism
0.612022
DE-Sword: Incentivized Verifiable Tag Path Query in RFID-Enabled Supply Chain Systems · IEEE Trans. Dependable Secur. Comput. 2022
Blockchain and cryptocurrency security › incentive mechanism
reputation incentive
0.612022
DE-Sword: Incentivized Verifiable Tag Path Query in RFID-Enabled Supply Chain Systems · IEEE Trans. Dependable Secur. Comput. 2022
Network security › wireless network security
RFID security
0.612022
DE-Sword: Incentivized Verifiable Tag Path Query in RFID-Enabled Supply Chain Systems · IEEE Trans. Dependable Secur. Comput. 2022

Methods — techniques the papers use, named apart from their topics

game theory · 1.1cryptographic primitives · 1.1
YearPublicationVenuePosition
2022 DE-Sword: Incentivized Verifiable Tag Path Query in RFID-Enabled Supply Chain Systems
abstract
In this article, we propose Double Edged (DE)-Sword, an incentivized verifiable tag path query scheme. DE-Sword queries tag records stored across a path of participants within an RFID-enabled supply chain in a verifiable way. Different with previous works, DE-Sword works in a dishonest-data owner model in which participants are the owners of tag records and may be dishonest. DE-Sword introduces a novel double-edged reputation incentive mechanism to encourage participants to behave honestly; and couples it with cryptographic primitives to ensure query verifiability. We evaluate DE-Sword through game theory, security analysis, and performance evaluation. The game theory and security analysis shows that DE-Sword guarantees query verifiability. The evaluation results show that DE-Sword incurs low overhead in supply chain systems.
Saiyu Qi, Yuanqing Zheng, Yue Li 0060, Xiaofeng Chen 0001, Jianfeng Ma 0001, Dongyi Yang, Yong Qi 0001
IEEE Trans. Dependable Secur. Comput.6