Shaojun Yang

Prof. Shaojun Yang


Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
5 January 2017 in IEEE Transactions on Fuzzy Systems
Verified
Journal Article
Closed access
SYShaojun Yang
Shaojun Yang
In this paper, some results of the fuzzy relation inequalities with addition-min composition are given. First, the uniqueness of minimal solutions of this system is discussed. Then, the relation between this system and the corresponding equations' system is introduced. The definition of the critical set is presented, and an algorithm of the critical system is obtained. Finally, an algorithm for the fuzzy relation inequalities is presented.

28 June 2019 in Algebra universalis
Verified
Journal Article
Closed access
PDF file
CSChong Shen
Chong Shen
SYShaojun Yang
Shaojun Yang
DZDongsheng Zhao
Dongsheng Zhao
Fu-Gui ShiFu-Gui Shi
Fu-Gui Shi

20 November 2023 in Computer Standards & Interfaces
Verified
Journal Article
Closed access
YZYong Zhao
Yong Zhao
SYShaojun Yang
Shaojun Yang
XHXinyi Huang
Xinyi Huang

8 December 2017
Verified
Book Chapter
Closed access
PDF file
CLCheng-Jun Lin
Cheng-Jun Lin
XHXinyi Huang
Xinyi Huang
SLShitang Li
Shitang Li
WWWei Wu
Wei Wu
SYShaojun Yang
Shaojun Yang

26 October 2022 in The Computer Journal
Verified
Journal Article
Closed access
PDF file
YZYong Zhao
Yong Zhao
SYShaojun Yang
Shaojun Yang
WWWei Wu
Wei Wu
XHXinyi Huang
Xinyi Huang
Redactable signatures allow the signature holder to remove admissible data blocks in the signed data while generating valid signatures about different redacted data without communicating with the primary signer. Now, this sort of signature has attracted widespread attention due to its many application scenarios such as electronic medical records, smart grids and XML files. However, there are rarely redactable signature schemes that can resist quantum attacks so far. In the wake of quantum calculation era, it is essential to blossom more quantum-resistant redactable signatures for different data structures. Moreover, it is popular to use accumulators to design redactable signature schemes. Unfortunately, the existing accumulators do not support tree data structures. Therefore, this paper first gives the definition of accumulator schemes for trees, and designs a lattice-based accumulator scheme for trees. Our accumulator scheme features shorter accumulator values and a faster witness generation algorithm than existing lattice trapdoor accumulators. Second, this paper resorts to approximate trapdoors and the preimage sampleable technique, and presents a lattice-based redactable signature scheme for trees using our accumulator scheme. Meanwhile, this scheme fulfills unforgeability, transparency and privacy under adaptive chosen-message attacks. Furthermore, the experiment results show that the redactable signature scheme meets actual revision requirements well.

2 May 2023 in Computer Standards & Interfaces
Verified
Journal Article
Closed access
NYNiao Yang
Niao Yang
SYShaojun Yang
Shaojun Yang
YZYong Zhao
Yong Zhao
WWWei Wu
Wei Wu
XWXuewei Wang
Xuewei Wang