Zijian Zhou

Zijian Zhou

Auto-generated profile, based on publicly available information

Zijian Zhou

Department of Mathematics, National University of Defense Technology, Changsha, China

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
19 July 2023 in IEEE Access
Verified
Journal Article
Open access
CWCaimei Wang
Caimei Wang
JLJianhao Lu
Jianhao Lu
XLXinlu Li
Xinlu Li
PCPei Cao
Pei Cao
ZZZijian Zhou
Zijian Zhou
QWQilue Wen
Qilue Wen
With the frequent occurrence of private data breaches, it is now more necessary than ever to address how to protect private data. The combination of Ciphertext-Policy Attribute-Based Encryption (CP-ABE) and blockchain typically enables secure storage and sharing of data. However, in high-dimensional attribute domains, that is, the number of attributes is large, these schemes have issues such as low security of data protection, high computational overhead, and high cost of attribute revocation. This paper proposes a personal privacy data protection scheme for encryption and revocation of high-dimensional attribute domains to address these issues. The proposed scheme is made up of three components. Firstly, Fast High-dimensional Attribute Domain-based Message Encryption (HAD-FME) is proposed to improve data security and reduce computational cost. Secondly, an Attribute Revocation Mechanism Based on Sentry Mode (SM-ARM) is designed in combination with smart contracts. Lastly, a Blockchain-based Model for Personal Privacy Data Protection (BC-PPDP) is proposed by integrating HAD-FME with SM-ARM. The security analysis results show that HAD-FME proposed in this paper is secure under the DLIN assumption, and the attribute revocation satisfies both forward and backward security. Experiments show that HAD-FME has higher computational efficiency than existing schemes in the high-dimensional attribute domains, SM-ARM has lower revocation cost than existing attribute revocation mechanisms, and smart contracts and blockchain work well.

29 May 2023 in Designs, Codes and Cryptography
Verified
Journal Article
Closed access
PDF file
YDYu Dai
Yu Dai
KLKaizhan Lin
Kaizhan Lin
CZChang-An Zhao
Chang-An Zhao
ZZZijian Zhou
Zijian Zhou

1 May 2022 in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Verified
Journal Article
Closed access
PDF file
YDYu Dai
Yu Dai
ZZZijian Zhou
Zijian Zhou
FZFangguo Zhang
Fangguo Zhang
CZChang-An Zhao
Chang-An Zhao
Pairing computations on elliptic curves with odd prime degrees are rarely studied as low efficiency. Recently, Clarisse, Duquesne and Sanders proposed two new curves with odd prime embedding degrees: BW13-P310 and BW19-P286, which are suitable for some special cryptographic schemes. In this paper, we propose efficient methods to compute the optimal ate pairing on this types of curves, instantiated by the BW13-P310 curve. We first extend the technique of lazy reduction into the finite field arithmetic. Then, we present a new method to execute Miller's algorithm. Compared with the standard Miller iteration formulas, the new ones provide a more efficient software implementation of pairing computations. At last, we also give a fast formula to perform the final exponentiation. Our implementation results indicate that it can be computed efficiently, while it is slower than that over the BLS-446 curve at the same security level.

1 April 2020 in Rocky Mountain Journal of Mathematics
Verified
Journal Article
Closed access
PDF file
ZZZijian Zhou
Zijian Zhou
Project Euclid - mathematics and statistics online

1 February 2022 in Finite Fields and Their Applications
Verified
Journal Article
Closed access
ZHZhi Hu
Zhi Hu
ZLZhe Liu
Zhe Liu
LWLin Wang
Lin Wang
ZZZijian Zhou
Zijian Zhou

24 October 2018 in Rendiconti del Circolo Matematico di Palermo Series 2
Verified
Journal Article
Open access
PDF file
ZZZijian Zhou
Zijian Zhou
Ekedahl showed that the genus of a curve in characteristic $$p>0$$ p > 0 with zero Cartier operator is bounded by $$p(p-1)/2$$ p ( p - 1 ) / 2 . We show the bound $$p+p(p-1)/2$$ p + p ( p - 1 ) / 2 in case the rank of the Cartier operator is 1, improving a result of Re.