Careful Whisper: Attestation for peer-to-peer Confidential Computing networks

• URL: http://arxiv.org/abs/2507.14796v1
• Date: Sun, 20 Jul 2025 02:57:34 GMT
• Title: Careful Whisper: Attestation for peer-to-peer Confidential Computing networks
• Authors: Ceren Kocaoğullar, Gustavo Petri, Dominic P. Mulligan, Derek Miller, Hugo J. M. Vincent, Shale Xiong, Alastair R. Beresford,
• Abstract summary: TEEs enable secure data processing and sharing in peer-to-peer networks, such as vehicular ad hoc networks of autonomous vehicles.<n>A naive peer-to-peer attestation approach, where every TEE directly attests every other TEE, results in quadratic communication overhead.<n>We present Careful Whisper, a gossip-based protocol that disseminates trust efficiently, reducing complexity under ideal conditions.
• Score: 4.502223155420236
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Trusted Execution Environments (TEEs) are designed to protect the privacy and integrity of data in use. They enable secure data processing and sharing in peer-to-peer networks, such as vehicular ad hoc networks of autonomous vehicles, without compromising confidentiality. In these networks, nodes must establish mutual trust to collaborate securely. TEEs can achieve this through remote attestation, where a prover presents evidence of its trustworthiness to a verifier, which then decides whether or not to trust the prover. However, a naive peer-to-peer attestation approach, where every TEE directly attests every other TEE, results in quadratic communication overhead. This is inefficient in dynamic environments, where nodes frequently join and leave the network. To address this, we present Careful Whisper, a gossip-based protocol that disseminates trust efficiently, reducing attestation overhead to linear complexity under ideal conditions. It enables interoperability by enabling transitive trust across heterogeneous networks, and supports trust establishment with offline nodes via relayed attestations. Using a custom discrete-event simulator, we show that Careful Whisper propagates trust both faster and more widely than naive approaches across various network topologies. Our results demonstrate that our protocol is resource efficient, sending ~21.5 KiB and requiring 0.158 seconds per round in a 200-node network, and that our protocol is resilient to attestation failures across various network topologies.

Related papers

• Towards Trustworthy Federated Learning with Untrusted Participants [7.278033100480175]
  This paper shows that a significantly weaker assumption suffices: each pair of participants shares a randomness seed unknown to others.<n>We propose CafCor, an algorithm that integrates robust gradient aggregation with correlated noise injection.<n>We prove that CafCor achieves strong privacy-utility trade-offs, significantly outperforming local differential privacy methods.
  arXiv  Detail & Related papers  (2025-05-03T17:35:47Z)
• Privacy Preserving Semi-Decentralized Mean Estimation over Intermittently-Connected Networks [59.43433767253956]
  We consider the problem of privately estimating the mean of vectors distributed across different nodes of an unreliable wireless network. In a semi-decentralized setup, nodes can collaborate with their neighbors to compute a local consensus, which they relay to a central server. We study the tradeoff between collaborative relaying and privacy leakage due to the data sharing among nodes.
  arXiv  Detail & Related papers  (2024-06-06T06:12:15Z)
• KGTrust: Evaluating Trustworthiness of SIoT via Knowledge Enhanced Graph Neural Networks [63.531790269009704]
  Social Internet of Things (SIoT) is a promising and emerging paradigm that injects the notion of social networking into smart objects (i.e., things) Due to the risks and uncertainty, a crucial and urgent problem to be settled is establishing reliable relationships within SIoT, that is, trust evaluation. We propose a novel knowledge-enhanced graph neural network (KGTrust) for better trust evaluation in SIoT.
  arXiv  Detail & Related papers  (2023-02-22T14:24:45Z)
• Distributed Information-theoretical Secure Protocols for Quantum Key Distribution Networks against Malicious Nodes [15.200383830307915]
  Quantum key distribution (QKD) networks are expected to enable information-theoretical secure (ITS) communication over a large-scale network. Current research on QKD networks primarily addresses passive attacks conducted by malicious nodes such as eavesdropping. We suggest a novel paradigm, inspired by distributed systems, to address the active attack by collaborate malicious nodes in QKD networks.
  arXiv  Detail & Related papers  (2023-02-14T11:53:22Z)
• Private and Reliable Neural Network Inference [6.7386666699567845]
  We present the first system which enables privacy-preserving inference on reliable NNs. We employ these building blocks to enable privacy-preserving NN inference with robustness and fairness guarantees in a system called Phoenix.
  arXiv  Detail & Related papers  (2022-10-27T16:58:45Z)
• Generative Adversarial Learning for Trusted and Secure Clustering in Industrial Wireless Sensor Networks [11.56611183738877]
  This paper presents a generative adversarial network (GAN) based trust management mechanism for Industrial Wireless Sensor Networks (IWSNs) It achieves a high detection rate up to 96%, as well as a low false positive rate below 8%.
  arXiv  Detail & Related papers  (2022-10-14T11:20:08Z)
• Sound and Complete Verification of Polynomial Networks [55.9260539566555]
  Polynomial Networks (PNs) have demonstrated promising performance on face and image recognition recently. Existing verification algorithms on ReLU neural networks (NNs) based on branch and bound (BaB) techniques cannot be trivially applied to PN verification. We devise a new bounding method, equipped with BaB for global convergence guarantees, called VPN.
  arXiv  Detail & Related papers  (2022-09-15T11:50:43Z)
• An Evolutionary Game based Secure Clustering Protocol with Fuzzy Trust Evaluation and Outlier Detection for Wireless Sensor Networks [8.611020067829509]
  A fuzzy trust evaluation method is presented to transform the transmission evidences into trust values. A K-Means based outlier detection scheme is proposed to further analyze plenty of trust values. An evolutionary game based secure clustering protocol is presented to achieve a trade-off between security assurance and energy saving.
  arXiv  Detail & Related papers  (2022-07-21T03:24:35Z)
• TrustGNN: Graph Neural Network based Trust Evaluation via Learnable Propagative and Composable Nature [63.78619502896071]
  Trust evaluation is critical for many applications such as cyber security, social communication and recommender systems. We propose a new GNN based trust evaluation method named TrustGNN, which integrates smartly the propagative and composable nature of trust graphs. Specifically, TrustGNN designs specific propagative patterns for different propagative processes of trust, and distinguishes the contribution of different propagative processes to create new trust.
  arXiv  Detail & Related papers  (2022-05-25T13:57:03Z)
• Uncertainty-Aware Deep Calibrated Salient Object Detection [74.58153220370527]
  Existing deep neural network based salient object detection (SOD) methods mainly focus on pursuing high network accuracy. These methods overlook the gap between network accuracy and prediction confidence, known as the confidence uncalibration problem. We introduce an uncertaintyaware deep SOD network, and propose two strategies to prevent deep SOD networks from being overconfident.
  arXiv  Detail & Related papers  (2020-12-10T23:28:36Z)
• Enabling certification of verification-agnostic networks via memory-efficient semidefinite programming [97.40955121478716]
  We propose a first-order dual SDP algorithm that requires memory only linear in the total number of network activations. We significantly improve L-inf verified robust accuracy from 1% to 88% and 6% to 40% respectively. We also demonstrate tight verification of a quadratic stability specification for the decoder of a variational autoencoder.
  arXiv  Detail & Related papers  (2020-10-22T12:32:29Z)

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.