Chuang Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Chuang Wang has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Wenlong Yi
School of Software, Jiangxi Agricultural University, Nanchang 330045, China
3 shared publications - Igor V. Gerasimov
Faculty of Computer Science and Technology, Saint Petersburg Electrotechnical University “LETI”, Saint Petersburg 197022, Russia
1 shared publication - Jie Chen
School of Software, Jiangxi Agricultural University, Nanchang 330045, China
1 shared publication - Jing Jia
School of Software, Jiangxi Agricultural University, Nanchang 330045, China
1 shared publication - Liming Weng
School of Software, Jiangxi Agricultural University, Nanchang 330045, China
1 shared publication - Qiliang Xie
School of Software, Jiangxi Agricultural University, Nanchang 330045, China
1 shared publication
Latest Publications
- Open Access
- 28 January 2025
- Published by St. Petersburg Electrotechnical University LETI in Computer tools in education
- No. 4,p. 70-81
Design and Implementation of a Blockchain-based Self-Directed Learning Process Evaluation Traceability Platform
This study proposes a blockchain-based self-directed learning process evaluation traceability platform to address issues in current self-directed learning evaluation systems, including insufficient transparency, single evaluation subjects, low student participation, and nonstandardized evaluation criteria. The platform, designed based on a self-directed learning ability influence factor model, utilizes blockchain’s immutability to achieve secure storage, transparent recording, and trusted sharing of learning data. Comprising blockchain and application layers, the platform enables users to monitor the entire learning process and trace data through its interface. Multi-dimensional test results demonstrate the platform’s usability and reliability in high-concurrency scenarios. This study enriches self-directed learning evaluation and learning analytics theories. It provides new possibilities for integrating blockchain technology with digital education, significantly promoting educational evaluation reform and high-quality education development.
- 28 January 2025
- Published by St. Petersburg Electrotechnical University LETI in Computer tools in education
- No. 4,p. 70-81
Open AccessDesign and Implementation of a Blockchain-based Self-Directed Learning Process Evaluation Traceability Platform
This study proposes a blockchain-based self-directed learning process evaluation traceability platform to address issues in current self-directed learning evaluation systems, including insufficient transparency, single evaluation subjects, low student participation, and nonstandardized evaluation criteria. The platform, designed based on a self-directed learning ability influence factor model, utilizes blockchain’s immutability to achieve secure storage, transparent recording, and trusted sharing of learning data. Comprising blockchain and application layers, the platform enables users to monitor the entire learning process and trace data through its interface. Multi-dimensional test results demonstrate the platform’s usability and reliability in high-concurrency scenarios. This study enriches self-directed learning evaluation and learning analytics theories. It provides new possibilities for integrating blockchain technology with digital education, significantly promoting educational evaluation reform and high-quality education development.
- Open Access
Weighted Attribute-Based Proxy Re-Encryption Scheme with Distributed Multi-Authority Attributes
Existing attribute-based proxy re-encryption schemes suffer from issues like complex access policies, large ciphertext storage space consumption, and an excessive authority of the authorization center, leading to weak security and controllability of data sharing in cloud storage. This study proposes a Weighted Attribute Authority Multi-Authority Proxy Re-Encryption (WAMA-PRE) scheme that introduces attribute weights to elevate the expression of access policies from binary to multi-valued, simplifying policies and reducing ciphertext storage space. Simultaneously, the multiple attribute authorities and the authorization center construct a joint key, reducing reliance on a single authorization center. The proposed distributed attribute authority network enhances the anti-attack capability of cloud storage. Experimental results show that introducing attribute weights can reduce ciphertext storage space by 50%, proxy re-encryption saves 63% time compared to repeated encryption, and the joint key construction time is only 1% of the benchmark scheme. Security analysis proves that WAMA-PRE achieves CPA security under the decisional q-parallel BDHE assumption in the random oracle model. This study provides an effective solution for secure data sharing in cloud storage.
Open AccessWeighted Attribute-Based Proxy Re-Encryption Scheme with Distributed Multi-Authority Attributes
Existing attribute-based proxy re-encryption schemes suffer from issues like complex access policies, large ciphertext storage space consumption, and an excessive authority of the authorization center, leading to weak security and controllability of data sharing in cloud storage. This study proposes a Weighted Attribute Authority Multi-Authority Proxy Re-Encryption (WAMA-PRE) scheme that introduces attribute weights to elevate the expression of access policies from binary to multi-valued, simplifying policies and reducing ciphertext storage space. Simultaneously, the multiple attribute authorities and the authorization center construct a joint key, reducing reliance on a single authorization center. The proposed distributed attribute authority network enhances the anti-attack capability of cloud storage. Experimental results show that introducing attribute weights can reduce ciphertext storage space by 50%, proxy re-encryption saves 63% time compared to repeated encryption, and the joint key construction time is only 1% of the benchmark scheme. Security analysis proves that WAMA-PRE achieves CPA security under the decisional q-parallel BDHE assumption in the random oracle model. This study provides an effective solution for secure data sharing in cloud storage.
- Open Access
PSBF: p-adic Integer Scalable Bloom Filter
Given the challenges associated with the dynamic expansion of the conventional bloom filter’s capacity, the prevalence of false positives, and the subpar access performance, this study employs the algebraic and topological characteristics of p-adic integers to introduce an innovative approach for dynamically expanding the p-adic Integer Scalable Bloom Filter (PSBF). The proposed method involves converting the target element into an integer using a string hash function, followed by the conversion of said integer into a p-adic integer through algebraic properties. This process automatically establishes the topological tree access structure of the PSBF. The experiment involved a comparison of access performance among the standard bloom filter, dynamic bloom filter, and scalable bloom filter. The findings indicate that the PSBF offers advantages such as avoidance of a linear storage structure, enhanced efficiency in element insertion and query, improved storage space utilization, and reduced likelihood of false positives. Consequently, the PSBF presents a novel approach to the dynamic extensibility of bloom filters.
Open AccessPSBF: p-adic Integer Scalable Bloom Filter
Given the challenges associated with the dynamic expansion of the conventional bloom filter’s capacity, the prevalence of false positives, and the subpar access performance, this study employs the algebraic and topological characteristics of p-adic integers to introduce an innovative approach for dynamically expanding the p-adic Integer Scalable Bloom Filter (PSBF). The proposed method involves converting the target element into an integer using a string hash function, followed by the conversion of said integer into a p-adic integer through algebraic properties. This process automatically establishes the topological tree access structure of the PSBF. The experiment involved a comparison of access performance among the standard bloom filter, dynamic bloom filter, and scalable bloom filter. The findings indicate that the PSBF offers advantages such as avoidance of a linear storage structure, enhanced efficiency in element insertion and query, improved storage space utilization, and reduced likelihood of false positives. Consequently, the PSBF presents a novel approach to the dynamic extensibility of bloom filters.