The massive growth of data has brought vigorous vitality to Internet-of-Things (IoT). It has also brought new challenges, such as confidentiality privacy protection and redundant data transmission. Concerning this regard, data aggregation serves as an efficient technique to minimize the transmission frequency among massive objects in smart grid(SG). By aggregating a large amount of the same type of data while satisfying the protection of user privacy. With the advent of the post-quantum era, a good aggregation scheme must provide quantum resistance while ensuring the secure aggregation of ciphertext power data. However, the excessive overhead limits anti-quantum algorithms from being widely used in SG where resource devices are limited. Therefore, it is an important part of the current private data security aggregation technology to find a low cost and lightweight inverse quantum algorithm to achieve user data security aggregation. In this paper, we propose an improved NTRU-based cryptosystem with multidimensional coding, referred to as multidimensional coding NTRU (MC-NTRU). and use the lattice batch signature technique, which improves the efficiency of the scheme while satisfying the anti-quantum attack. Based on these, we design the multidimensional auditable lattice-based privacy-preserving data aggregation scheme(MA-PPDA) for privacy data on resource-limited IoT devices such as smart grids. In addition to this, the scheme achieves fault tolerance of the scheme by adding zeros and random numbers to the user data. The comparative study against existing approaches demonstrates that the proposed scheme not only adheres to critical security aspects including user privacy, data confidentiality, integrity, and authenticity, but also decreases both communication and computational burdens on the system. This makes our scheme particularly apt for IoT environments characterized by constrained device resources.

Online social networks (OSN) such as Twitter, Facebook, etc. have an overall user base of more than 5 billion as of today. Traditional centralized OSN users’ data and content are stored in centralized servers, which has the risk of data leakage and privacy violation. Distributed OSN (DOSN) address the single-point-of-failure and user data privacy concerns faced by centralized OSN by enabling the operation of network infrastructures and services without centralized ownership or control. However, DOSN face privacy protection issues. The group key agreement (GKA) is an important method to construct secure channels to protect the secure communication of network group members. Asymmetric GKA methods allow external members to securely communicate with group members without having to join the group. However, it is worth noting that existing AGKA schemes rely on bilinear pairing, resulting in a high computational overhead. Meanwhile, considering scenarios where external users join, or group members leave, we design a dynamic asymmetric group key agreement (DAGKAwP) scheme based on Schnorr batch multi-signature that does not depend on bilinear pairing. During the key generation phase, the members generate self-authenticating public-private key pairs to resist malicious public key attacks. For group key agreement, new hash functions are embedded in Schnorr signatures to generate aggregated public keys, and this scheme supports external member addition and internal member exit. In group message encryption, sender anonymity and message non-repudiation are realized. The security comparison with related DAGKA schemes reveals that the DAGKAwP scheme offers more comprehensive security. Performance evaluations suggest that this scheme offers computational efficiency and lower communication overhead than related Dynamic AGKA schemes.

The smart grid, which is an important component of smart cities, is developing rapidly nowadays, while the confidentiality and integrity of consumption data of customers become significant security issues. Although existing privacy-preserving aggregation schemes reduce the communication overhead and protect the privacy of users’ multidimensional power data, most of them are vulnerable and possess no quantum-resistant properties. In this article, we combine the Chinese remainder theorem (CRT) and the bit decomposition method to provide multibit homomorphic properties for the quantum-resistant algorithm number theory research unit (NTRU), and propose the partial-homomorphic NTRU (PH-NTRU). Then, based on the algorithm, we design the lattice-based multidimensional data privacy-preserving data aggregation scheme named FTCR-LMPPDA, in which the edge devices work as aggregator gateways. Specifically, smart meters participating in the aggregation process share zero-sum numbers to resist collusion attacks. Error retransmission mechanism and random number reconstruction algorithm are introduced to enhance the robustness of this scheme and provide our system with the ability to recover from faults. In addition, security analysis shows our scheme can resist quantum attacks, collusion attacks, and other internal and external attacks as well as keep the security features, such as confidentiality, privacy and integrity of users’ data. Finally, performance evaluation demonstrates that our scheme is more efficient than existing schemes and is more suitable for devices with constrained resources.

In recent years, the Internet of Things (IoT) has gained immense popularity in various aspects of work, learning, and daily life. Within the IoT realm, there is a growing concern regarding communication security issues between users and servers. However, addressing the communication security between servers is equally imperative, which has not received as much attention. To this end, we propose a certificateless anonymous authenticated key agreement (AKA) algorithm based on learning with errors (LWEs) and inhomogeneous small integer solution (ISIS) security assumptions. Our scheme provides strong resistance to quantum attacks and protects the privacy of communication servers. It also has constant communication costs and lower computational requirements than existing lattice-based anonymous AKA algorithms on the broadcast channel. Additionally, the proposed scheme eliminates the resource consumption of managing complex certificates and addresses the security risks associated with key escrow in the key generation center (KGC). Through security and performance analysis, we demonstrate that our approach can enhance the security of IoT-based healthcare systems while significantly improving communication efficiency. Our proposed scheme provides a promising solution to security issues related to server communication in IoT systems.