Shaojun Yang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Shaojun Yang has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
Wei Wu
3 shared publicationsXinyi Huang
2 shared publicationsYong Zhao
Fujian Normal University
2 shared publications- Yong Zhao
Putian Univ, Fujian Key Lab Financial Informat Proc, Putian, Peoples R China
2 shared publications Cheng-Jun Lin
Fujian Normal University
1 shared publication- Chong Shen
School of Mathematical Sciences, Beijing University of Posts and Telecommunications, Beijing, People’s Republic of China
1 shared publication
Latest Publications
- 1 December 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (23) , 59800-59810
One-Time Secure Tags and Dual Backup for Quantum Provable Data Possession Protocol
- 1 December 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (23) , 59800-59810
One-Time Secure Tags and Dual Backup for Quantum Provable Data Possession Protocol
- 20 November 2023
- Published by Elsevier in Computer Standards & Interfaces
- Vol. 89
Lattice-based dynamic universal accumulator: Design and application
- 20 November 2023
- Published by Elsevier in Computer Standards & Interfaces
- Vol. 89
Lattice-based dynamic universal accumulator: Design and application
- 2 May 2023
- Published by Elsevier in Computer Standards & Interfaces
- Vol. 87
Inner product encryption from Middle-Product Learning With Errors
- 2 May 2023
- Published by Elsevier in Computer Standards & Interfaces
- Vol. 87
Inner product encryption from Middle-Product Learning With Errors
- 7 December 2022
- Published by Springer Nature
- p. 667-683
A Combination Reduction Algorithm and Its Application
- 7 December 2022
- Published by Springer Nature
- p. 667-683
A Combination Reduction Algorithm and Its Application
- 26 October 2022
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 66 (12) , 2961-2973
A Lattice-Based Redactable Signature Scheme using Cryptographic Accumulators for Trees
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.
- 26 October 2022
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 66 (12) , 2961-2973
A Lattice-Based Redactable Signature Scheme using Cryptographic Accumulators for Trees
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.
- 28 June 2019
- Published by Springer Nature in Algebra universalis
- Vol. 80 (3) , 26
Lattice-equivalence of convex spaces
- 28 June 2019
- Published by Springer Nature in Algebra universalis
- Vol. 80 (3) , 26
Lattice-equivalence of convex spaces
- 8 December 2017
- Published by Springer Nature
- p. 375-390
Linearly Homomorphic Signatures with Designated Entities
- 8 December 2017
- Published by Springer Nature
- p. 375-390
Linearly Homomorphic Signatures with Designated Entities
- 1 June 2017
- Vol. 14 (3) , 139-149
M-FUZZIFYING MATROIDS INDUCED BY M-FUZZIFYING CLOSURE OPERATORS
- 5 January 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Fuzzy Systems
- Vol. 26 (1) , 239-245
Some Results of the Fuzzy Relation Inequalities With Addition–Min Composition
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.
- 5 January 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Fuzzy Systems
- Vol. 26 (1) , 239-245
Some Results of the Fuzzy Relation Inequalities With Addition–Min Composition
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.