LCP-CAS: Lattice-Based Conditional Privacy-Preserving Certificateless Aggregation Signature Scheme for Industrial IoT

Aiming at the challenge that traditional signature schemes struggle to simultaneously achieve efficiency, resistance to quantum attacks, and privacy protection, this paper proposes a lattice-based conditional privacy-preserving certificateless aggregate signature method (LCP-CAS). The scheme adopts an unordered aggregation algorithm to compress multiple signatures, in arbitrary order, into a single fixed-length aggregate signature, thereby achieving linear scalability in verification complexity. Its security is based on the hardness of the Ring Short Integer Solution (RSIS) problem, ensuring post-quantum resistance. By incorporating a conditional privacy-preserving mechanism, the scheme realizes device anonymity while supporting identity traceability, thus balancing privacy protection with regulatory requirements. Security analysis shows that the scheme meets the security requirements, including integrity, non-repudiation, conditional privacy preservation, and resistance to collusion attacks. Compared with existing related schemes, LCP-CAS achieves reduces aggregation and verification overhead while maintaining practicality in large-scale settings such as industrial IoT and device monitoring.

Authors

Institutions

Publication Details

Journal
Entropy
Published
2026-02-26
DOI
https://doi.org/10.3390/e28030258
Primary Topic
Cryptography and Data Security
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

LCP-CAS: Lattice-Based Conditional Privacy-Preserving Certificateless Aggregation Signature Scheme for Industrial IoT

Lin Shi, Ziyi Chen, Ping Chen, Liquan Chen et al.
Entropy
Cryptography and Data Security
article

LCP-CAS: Lattice-Based Conditional Privacy-Preserving Certificateless Aggregation Signature Scheme for Industrial IoT

Lin Shi, Ziyi Chen, Ping Chen, Liquan Chen, Ziyan Zhang
article en

Abstract

Aiming at the challenge that traditional signature schemes struggle to simultaneously achieve efficiency, resistance to quantum attacks, and privacy protection, this paper proposes a lattice-based conditional privacy-preserving certificateless aggregate signature method (LCP-CAS). The scheme adopts an unordered aggregation algorithm to compress multiple signatures, in arbitrary order, into a single fixed-length aggregate signature, thereby achieving linear scalability in verification complexity. Its security is based on the hardness of the Ring Short Integer Solution (RSIS) problem, ensuring post-quantum resistance. By incorporating a conditional privacy-preserving mechanism, the scheme realizes device anonymity while supporting identity traceability, thus balancing privacy protection with regulatory requirements. Security analysis shows that the scheme meets the security requirements, including integrity, non-repudiation, conditional privacy preservation, and resistance to collusion attacks. Compared with existing related schemes, LCP-CAS achieves reduces aggregation and verification overhead while maintaining practicality in large-scale settings such as industrial IoT and device monitoring.

EntropyVol. 28(3)
Southeast University (CN)
National Natural Science Foundation of China, Southeast University
Peace, Justice and strong institutions
Openalex Percentile: Top 46%
Cryptography and Data Security
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.