EDBT 2026 Demo / reviewers in the wild / expert
Yansen Su
dblp:137/0996 · also Yan-Sen Su
· DBLP profile ↗
4ranked-venue papers in the field
2as first author
3since 2021 · last 2022
0000-0002-3855-7133ORCID · verified
Domains — venue-derived; a paper can count in several
Knowledge Engineering, Semantic Web & Information Systems · 3 (2 first)Other / Interdisciplinary · 1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Learning user sentiment orientation in social networks for sentiment analysis
Jie Chen 0025, Nan Song, Yansen Su, Shu Zhao 0005, Yanping Zhang 0001 |
Inf. Sci. | 3 |
| 2021 | An approach of covert communication based on the Ethereum whisper protocol in blockchainabstractThe traditional covert communication that relies on a central node is vulnerable to detection and attack. Applying blockchain to covert communication can improve the channel's anti-interference and antitampering. Whisper is the communication protocol of Ethereum, which mainly relies on payload to store information and padding to expand. These two fields can store a large amount of information, creating conditions for the realization of covert communication. In this paper, we propose a covert communication method based on the whisper protocol to covertly transfer information in the blockchain. To implement this method, we use payload to store the carrier information, matching it with the secret message. The generated index is recorded in the padding field. To improve the concealment of communication, we simulate the default filling rules of the protocol to maintain the message size. A new topic–key pair interaction method is also proposed to improve the security of the model. Moreover, the anti-interference, antitampering and antidetection of the newly proposed model are verified through theoretical analysis and experiment. The experimental findings show that the amount of information in the proposed method is 4.7 times that of the traditional time-based covert communication. The time consumption of information transmission is reduced to 52.25% under the same settings and even less in actual use. The cost of the new topic–key pair interaction is reduced by nearly 50% compared with the original method. Lejun Zhang, Zilong Jin, Yansen Su |
Int. J. Intell. Syst. | 4 |
| 2021 | A parallel multi-objective evolutionary algorithm for community detection in large-scale complex networks
Yansen Su, Kefei Zhou, Xingyi Zhang 0001, Ran Cheng 0004, Chun-Hou Zheng 0001 |
Inf. Sci. | 1 |
| 2020 | A non-revisiting genetic algorithm based on a novel binary space partition tree
Yansen Su, Neng Guo, Ye Tian 0009, Xingyi Zhang 0001 |
Inf. Sci. | 1 |