A Secure Authentication-Driven Protected Data Collection Protocol in Internet of Things

• URL: http://arxiv.org/abs/2510.07462v1
• Date: Wed, 08 Oct 2025 19:10:42 GMT
• Title: A Secure Authentication-Driven Protected Data Collection Protocol in Internet of Things
• Authors: Maryam Ataei Nezhad, Hamid Barati, Ali Barati,
• Abstract summary: The Internet of Things enables humans to remotely manage and control the objects they use with the Internet infrastructure.<n>Privacy and information security are the biggest concern after the advent of the Internet of Things.<n>The proposed method consists of three phases.<n>Results showed that the proposed method has improved in terms of energy consumption, end-to-end delay, flexibility, packet delivery rate, and the number of alive nodes compared to other methods.
• Score: 1.5803208833562954
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Internet of Things means connecting different devices through the Internet. The Internet of things enables humans to remotely manage and control the objects they use with the Internet infrastructure. After the advent of the Internet of Things in homes, organizations, and private companies, privacy and information security are the biggest concern. This issue has challenged the spread of the Internet of things as news of the users theft of information by hackers intensified. The proposed method in this paper consists of three phases. In the first phase, a star structure is constructed within each cluster, and a unique key is shared between each child and parent to encrypt and secure subsequent communications. The second phase is for intracluster communications, in which members of the cluster send their data to the cluster head in a multi hop manner. Also, in this phase, the data is encrypted with different keys in each hop, and at the end of each connection, the keys are updated to ensure data security. The third phase is to improve the security of inter cluster communications using an authentication protocol. In this way, the cluster heads are authenticated before send- ing information to prevent malicious nodes in the network. The proposed method is also simulated using NS2 software. The results showed that the proposed method has improved in terms of energy consumption, end-to-end delay, flexibility, packet delivery rate, and the number of alive nodes compared to other methods.

Related papers

• Enhancing Distributed Authorization With Lagrange Interpolation And Attribute-Based Encryption [0.7829352305480287]
  In todays security landscape, every user wants to access large amounts of data with confidentiality and authorization.<n>To access secure data, researchers use access control lists to grant authentication and provide authorization.<n>To cope with these two problems, we proposed multiparty execution on the server.
  arXiv  Detail & Related papers  (2025-12-25T06:26:14Z)
• Information-Theoretic Decentralized Secure Aggregation with Collusion Resilience [95.33295072401832]
  We study the problem of decentralized secure aggregation (DSA) from an information-theoretic perspective.<n>We characterize the optimal rate region, which specifies the minimum achievable communication and secret key rates for DSA.<n>Our results establish the fundamental performance limits of DSA, providing insights for the design of provably secure and communication-efficient protocols.
  arXiv  Detail & Related papers  (2025-08-01T12:51:37Z)
• Privacy-Preserving Federated Learning via Homomorphic Adversarial Networks [19.876110109857635]
  Homomorphic Adversarial Networks (HANs) are robust against privacy attacks.<n>HANs increase encryption aggregation speed by 6,075 times while incurring a 29.2 times increase in communication overhead.<n>Compared to traditional MK-HE schemes, HANs increase encryption aggregation speed by 6,075 times while incurring a 29.2 times increase in communication overhead.
  arXiv  Detail & Related papers  (2024-12-02T15:59:35Z)
• Collaborative Inference over Wireless Channels with Feature Differential Privacy [57.68286389879283]
  Collaborative inference among multiple wireless edge devices has the potential to significantly enhance Artificial Intelligence (AI) applications. transmitting extracted features poses a significant privacy risk, as sensitive personal data can be exposed during the process. We propose a novel privacy-preserving collaborative inference mechanism, wherein each edge device in the network secures the privacy of extracted features before transmitting them to a central server for inference.
  arXiv  Detail & Related papers  (2024-10-25T18:11:02Z)
• Uncovering Attacks and Defenses in Secure Aggregation for Federated Deep Learning [17.45950557331482]
  Federated learning enables the collaborative learning of a global model on diverse data, preserving data locality and eliminating the need to transfer user data to a central server. Secure aggregation protocols are designed to mask/encrypt user updates and enable a central server to aggregate the masked information. MicroSecAgg (PoPETS 2024) proposes a single server secure aggregation protocol that aims to mitigate the high communication complexity of the existing approaches.
  arXiv  Detail & Related papers  (2024-10-13T00:06:03Z)
• Differentiated Security Architecture for Secure and Efficient Infotainment Data Communication in IoV Networks [55.340315838742015]
  Negligence on the security of infotainment data communication in IoV networks can unintentionally open an easy access point for social engineering attacks. In particular, we first classify data communication in the IoV network, examine the security focus of each data communication, and then develop a differentiated security architecture to provide security protection on a file-to-file basis.
  arXiv  Detail & Related papers  (2024-03-29T12:01:31Z)
• Multi-perspective Memory Enhanced Network for Identifying Key Nodes in Social Networks [51.54002032659713]
  We propose a novel Multi-perspective Memory Enhanced Network (MMEN) for identifying key nodes in social networks. MMEN mines key nodes from multiple perspectives and utilizes memory networks to store historical information. Our method significantly outperforms previous methods.
  arXiv  Detail & Related papers  (2024-03-22T14:29:03Z)
• An Efficient and Multi-private Key Secure Aggregation for Federated Learning [41.29971745967693]
  We propose an efficient and multi-private key secure aggregation scheme for federated learning. Specifically, we skillfully modify the variant ElGamal encryption technique to achieve homomorphic addition operation. For the high dimensional deep model parameter, we introduce a super-increasing sequence to compress multi-dimensional data into 1-D.
  arXiv  Detail & Related papers  (2023-06-15T09:05:36Z)
• Establishing shared secret keys on quantum line networks: protocol and security [0.0]
  We show the security of multi-user key establishment on a single line of quantum communication. We consider a quantum communication architecture where qubit generation and measurement happen at the two ends of the line.
  arXiv  Detail & Related papers  (2023-04-04T15:35:23Z)
• Two-Bit Aggregation for Communication Efficient and Differentially Private Federated Learning [79.66767935077925]
  In federated learning (FL), a machine learning model is trained on multiple nodes in a decentralized manner, while keeping the data local and not shared with other nodes. The information sent from the nodes to the server may reveal some details about each node's local data, thus raising privacy concerns. A novel two-bit aggregation algorithm is proposed with guaranteed differential privacy and reduced uplink communication overhead.
  arXiv  Detail & Related papers  (2021-10-06T19:03:58Z)
• Secure Byzantine-Robust Machine Learning [61.03711813598128]
  We propose a secure two-server protocol that offers both input privacy and Byzantine-robustness. In addition, this protocol is communication-efficient, fault-tolerant and enjoys local differential privacy.
  arXiv  Detail & Related papers  (2020-06-08T16:55:15Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.