A Threshold Homomorphic Blockchain Architecture for Secure and Scalable IoT Sensor Data Aggregation

• URL: http://arxiv.org/abs/2608.23396v1
• Date: Mon, 24 Aug 2026 15:41:18 GMT
• Title: A Threshold Homomorphic Blockchain Architecture for Secure and Scalable IoT Sensor Data Aggregation
• Abstract summary: This work introduces Phi-PHE-BC, a topology-aware homomorphic blockchain architecture for secure and privacy-preserving IoT sensor data aggregation.<n>Results across topology scaling, validator sensitivity, threshold decryption, and Byzantine-load experiments indicate that Phi-PHE-BC is a practical architecture for secure, privacy-preserving, and topology-aware IoT sensor aggregation.
• Score: 0.9059656093018312
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Homomorphic-encryption blockchain frameworks for IoT sensor aggregation generally rely on classical cryptographic hardness assumptions and seldom account for network topology in liveness and performance analysis. This work introduces Phi-PHE-BC, a topology-aware homomorphic blockchain architecture for secure and privacy-preserving IoT sensor data aggregation. The framework combines threshold Paillier decryption with graph-parameterized security and performance analysis, linking protocol behavior to the validator graph. On-chain Paillier ciphertexts support homomorphic aggregation while providing IND-CPA confidentiality under the Decisional Composite Residuosity assumption, and authentication signatures provide EUF-CMA transaction integrity. Threshold partial-decryption shares are protected by a noise-flooding wrapper that provides information-theoretic privacy under the configured statistical-hiding condition. Under partial synchrony and Byzantine fault-tolerance assumptions, liveness requires validator connectivity kappa(Gv) >= f+1. We derive topology-dependent throughput bounds for tree, star, mesh, and scale-free networks, together with a per-block communication-cost model. A game-theoretic analysis shows that honest validator participation is a dominant strategy under the stated utility model, yielding an all-honest Nash equilibrium. Experiments on Hyperledger Fabric 2.5 show lower end-to-end latency than the selected traditional PHE-blockchain baseline while maintaining controllable threshold-decryption overhead. Results across topology scaling, validator sensitivity, threshold decryption, and Byzantine-load experiments indicate that Phi-PHE-BC is a practical architecture for secure, privacy-preserving, and topology-aware IoT sensor aggregation.

Related papers

• Distributed Physical Layer Authentication and Collaborative RSMA in Non-Terrestrial Networks via Graph Reinforcement Learning [2.0965265618008315]
  passive, location-aware, static eavesdroppers without access to legitimate channel state information (CSI)<n>We propose secure adaptive authentication for multi-zone systems (SAFA-MZ) that maximizes secrecy spectral efficiency (SSE)<n>Results under both colluding and non-colluding eavesdroppers show that the proposed method improves average SSE by up to 135% over single-connect transmission and 21% over the scheme without AN.
  arXiv  Detail & Related papers  (2026-09-08T21:46:12Z)
• Pushing Forward Multi-Secret-Key Homomorphic Encryption for Private Average Aggregation [45.381652768314375]
  Homomorphic Encryption naturally fits the client--aggregator communication pattern of Federated Learning.<n>We propose lightweight multi-secret-key protocols for private average aggregation based on RLWE-based Homomorphic Encryption.<n>Our results show that the proposed approach substantially reduces ciphertext expansion and online cost, while preserving practical homomorphic aggregation performance.
  arXiv  Detail & Related papers  (2026-09-01T23:21:48Z)
• Keyed Provenance Watermarking with Complementary Lattice-Based Secure Aggregation for Federated Learning [9.487248784690612]
  We propose an FL framework that couples keyed context-provenance watermarking with verifiable lattice-based secure aggregation.<n>To our knowledge, no prior verification workflow has jointly evaluated both layers in a hybrid, end-to-end trustworthy FL framework.
  arXiv  Detail & Related papers  (2026-08-20T21:26:31Z)
• MOSAIC-FL, a micro-service based privacy-preserving framework with application to genomics [0.39803081804190255]
  Security and privacy are primordial requirements for Federated Learning.<n>Our framework is designed to address these challenges while proposing a modular, flexible and micro-service architecture.<n>We demonstrate the framework's effectiveness through diverse use cases, ranging from standard image recognition (EMNIST) to complex genomic classification.
  arXiv  Detail & Related papers  (2026-07-27T22:09:46Z)
• Privacy-Preserving Robustness Verification for Neural Networks [8.136747065885006]
  We introduce SecureCROWN, the first framework for privacy-preserving neural network verification.<n>Our framework enables a model owner and a data owner to jointly compute certified robustness bounds.<n>We show that SecureCROWN strictly matches verification results, while completing in 0.1--200s across varied model sizes.
  arXiv  Detail & Related papers  (2026-07-06T15:59:17Z)
• GoAT-X: A Graph of Auditing Thoughts for Securing Token Transactions in Cross-Chain Contracts [52.51342355102833]
  Cross-chain bridges, the critical infrastructure of the multi-chain ecosystem, have become a primary target for attackers.<n>Existing defenses, such as bytecode-level static analysis, are ill-equipped to handle the semantic complexity of cross-chain interactions.<n>We propose GoAT-X, a framework that shifts automated cross-chain smart contracts auditing from pattern matching toward systematic first-principles verification.
  arXiv  Detail & Related papers  (2026-04-27T11:34:21Z)
• Scalable and Verifiable Federated Learning for Cross-Institution Financial Fraud Detection [0.0]
  We propose Dynamic Sharded Learning (DSFL), a verifiable secure aggregation framework for fraud detection.<n>DSFL replaces topologies with Dynamic Sharding, reducing complexity from O(N2) to m(N2)<n>To mitigate insider threats, we introduce Linear Integrity Tags, an additive-homomorphic commitment mechanism.
  arXiv  Detail & Related papers  (2026-04-25T20:49:22Z)
• RAIN: Secure and Robust Aggregation under Shuffle Model of Differential Privacy [46.52109845749167]
  We present Robust Aggregation in Noise (RAIN), a framework that reconciles privacy, robustness, and verifiability under Shuffle-DP.<n>RAIN adopts sign-space aggregation to robustly measure update consistency and limit malicious influence under noise and anonymization.<n>We show that RAIN maintains strong privacy guarantees under Shuffle-DP and remains robust to poisoning attacks with negligible degradation in accuracy and convergence.
  arXiv  Detail & Related papers  (2026-03-03T15:41:54Z)
• A Critical Look into Threshold Homomorphic Encryption for Private Average Aggregation [45.381652768314375]
  Threshold Homomorphic Encryption (Threshold HE) is a good fit for implementing private federated average aggregation.<n>Recent studies have shown that threshold schemes can introduce unexpected security vulnerabilities if an adversary has access to a restricted decryption oracle.
  arXiv  Detail & Related papers  (2026-02-25T15:45:27Z)
• Safe Low Bandwidth SPV: A Formal Treatment of Simplified Payment Verification Protocols and Security Bounds [0.0]
  We show that SPV is not only secure under bounded adversarial assumptions but strictly optimal for digital cash systems requiring scalable and verifiable transaction inclusion.<n>This document serves both as a blueprint for secure SPV implementation and a rebuttal of common misconceptions surrounding non-validating clients.
  arXiv  Detail & Related papers  (2025-07-01T13:44:48Z)
• Trusted Compute Units: A Framework for Chained Verifiable Computations [41.94295877935867]
  This paper introduces the Trusted Compute Unit (TCU), a unifying framework that enables composable and interoperable computations across heterogeneous technologies.<n>By enabling secure off-chain interactions without incurring on-chain confirmation delays or gas fees, TCUs significantly improve system performance and scalability.
  arXiv  Detail & Related papers  (2025-04-22T09:01:55Z)
• A Label-Free Heterophily-Guided Approach for Unsupervised Graph Fraud Detection [60.09453163562244]
  We propose a Heterophily-guided Unsupervised Graph fraud dEtection approach (HUGE) for unsupervised GFD.<n>In the estimation module, we design a novel label-free heterophily metric called HALO, which captures the critical graph properties for GFD.<n>In the alignment-based fraud detection module, we develop a joint-GNN architecture with ranking loss and asymmetric alignment loss.
  arXiv  Detail & Related papers  (2025-02-18T22:07:36Z)
• ScionFL: Efficient and Robust Secure Quantized Aggregation [36.668162197302365]
  We introduce ScionFL, the first secure aggregation framework for federated learning. It operates efficiently on quantized inputs and simultaneously provides robustness against malicious clients. We show that with no overhead for clients and moderate overhead for the server, we obtain comparable accuracy for standard FL benchmarks.
  arXiv  Detail & Related papers  (2022-10-13T21:46:55Z)
• Is Vertical Logistic Regression Privacy-Preserving? A Comprehensive Privacy Analysis and Beyond [57.10914865054868]
  We consider vertical logistic regression (VLR) trained with mini-batch descent gradient. We provide a comprehensive and rigorous privacy analysis of VLR in a class of open-source Federated Learning frameworks.
  arXiv  Detail & Related papers  (2022-07-19T05:47:30Z)

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.