Empirical Evaluation of Memory-Erasure Protocols

• URL: http://arxiv.org/abs/2509.10224v1
• Date: Fri, 12 Sep 2025 13:16:02 GMT
• Title: Empirical Evaluation of Memory-Erasure Protocols
• Authors: Reynaldo Gil-Pons, Sjouke Mauw, Rolando Trujillo-Rasua,
• Abstract summary: We report on the first empirical analysis of software-based memory-erasure protocols with respect to their security, erasure guarantees, and performance.<n>Our results indicate that existing software-based memory-erasure protocols are feasible, although slow devices may take several seconds to erase their memory and generate a proof of erasure.<n>We found that no protocol dominates across all empirical settings, defined by the computational power and memory size of the device, the network speed, and the required level of security.
• Score: 1.254120224317171
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Software-based memory-erasure protocols are two-party communication protocols where a verifier instructs a computational device to erase its memory and send a proof of erasure. They aim at guaranteeing that low-cost IoT devices are free of malware by putting them back into a safe state without requiring secure hardware or physical manipulation of the device. Several software-based memory-erasure protocols have been introduced and theoretically analysed. Yet, many of them have not been tested for their feasibility, performance and security on real devices, which hinders their industry adoption. This article reports on the first empirical analysis of software-based memory-erasure protocols with respect to their security, erasure guarantees, and performance. The experimental setup consists of 3 modern IoT devices with different computational capabilities, 7 protocols, 6 hash-function implementations, and various performance and security criteria. Our results indicate that existing software-based memory-erasure protocols are feasible, although slow devices may take several seconds to erase their memory and generate a proof of erasure. We found that no protocol dominates across all empirical settings, defined by the computational power and memory size of the device, the network speed, and the required level of security. Interestingly, network speed and hidden constants within the protocol specification played a more prominent role in the performance of these protocols than anticipated based on the related literature. We provide an evaluation framework that, given a desired level of security, determines which protocols offer the best trade-off between performance and erasure guarantees.

Related papers

• ProtocolLLM: RTL Benchmark for SystemVerilog Generation of Communication Protocols [45.66401695351214]
  We introduce ProtocolLLM, the first benchmark suite specifically targeting widely used SystemVerilog protocols.<n>We observe that most of the models fail to generate SystemVerilog code for communication protocols that follow timing constrains.
  arXiv  Detail & Related papers  (2025-06-09T17:10:47Z)
• Device-independent secure correlations in sequential quantum scenarios [44.99833362998488]
  Device-independent quantum information is attracting significant attention, particularly for its applications in information security.<n>We propose a systematic approach to designing sequential quantum protocols for device-independent security.<n>We analytically prove that, with this systematic construction, the resulting ideal correlations are secure in the sense that they cannot be reproduced as a statistical mixture of other correlations.
  arXiv  Detail & Related papers  (2025-03-18T16:45:20Z)
• ACRIC: Securing Legacy Communication Networks via Authenticated Cyclic Redundancy Integrity Check [98.34702864029796]
  Recent security incidents in safety-critical industries exposed how the lack of proper message authentication enables attackers to inject malicious commands or alter system behavior.<n>These shortcomings have prompted new regulations that emphasize the pressing need to strengthen cybersecurity.<n>We introduce ACRIC, a message authentication solution to secure legacy industrial communications.
  arXiv  Detail & Related papers  (2024-11-21T18:26:05Z)
• A robust and composable device-independent protocol for oblivious transfer using (fully) untrusted quantum devices in the bounded storage model [4.644619667965337]
  We present a device-independent (DI) quantum protocol between two parties for oblivious transfer (OT) using Magic Square devices.<n>After a fixed constant (real-world) time interval, referred to as DELAY, the quantum states decohere completely.<n>Our protocol has negligible (in lambda) correctness and security errors and can be implemented in the NISQ era.
  arXiv  Detail & Related papers  (2024-04-17T11:46:36Z)
• A Survey and Comparative Analysis of Security Properties of CAN Authentication Protocols [92.81385447582882]
  The Controller Area Network (CAN) bus leaves in-vehicle communications inherently non-secure. This paper reviews and compares the 15 most prominent authentication protocols for the CAN bus. We evaluate protocols based on essential operational criteria that contribute to ease of implementation.
  arXiv  Detail & Related papers  (2024-01-19T14:52:04Z)
• Software-Based Memory Erasure with relaxed isolation requirements: Extended Version [1.1044979145231115]
  A Proof of Secure Erasure (PoSE) is a communication protocol where a verifier seeks evidence that a prover has erased its memory. Most software-based PoSE protocols assume that provers are isolated during the protocol execution. We introduce formal models for PoSE protocols playing against provers aided by external conspirators and develop three PoSE protocols that we prove secure in this context.
  arXiv  Detail & Related papers  (2024-01-12T15:19:08Z)
• Attestation with Constrained Relying Party [0.7249731529275341]
  We show that our protocol, including the needed cryptography and message processing, can be implemented with a code size of 6 KB. We show that our protocol, including the needed cryptography and message processing, can be implemented with a code size of 6 KB and validate its security via model checking with the ProVerif tool.
  arXiv  Detail & Related papers  (2023-12-14T13:05:21Z)
• Memory effects in device-dependent and device-independent cryptography [0.0]
  Reuse of devices across multiple protocol instances can introduce a vulnerability against memory attacks. Memory effects across rounds are enough to cause substantial difficulties in applying many existing non-IID proof techniques.
  arXiv  Detail & Related papers  (2023-08-15T16:36:31Z)
• Federated Inference with Reliable Uncertainty Quantification over Wireless Channels via Conformal Prediction [43.36472219160387]
  We study a wireless federated inference scenario in which devices and a server share a pre-trained machine learning model. We introduce a novel protocol, termed wireless federated conformal prediction (WFCP) WFCP is proved to provide formal reliability guarantees in terms of coverage of the predicted set produced by the server.
  arXiv  Detail & Related papers  (2023-08-08T13:03:36Z)
• Single-photon-memory measurement-device-independent quantum secure direct communication [63.75763893884079]
  Quantum secure direct communication (QSDC) uses the quantum channel to transmit information reliably and securely. In order to eliminate the security loopholes resulting from practical detectors, the measurement-device-independent (MDI) QSDC protocol has been proposed. We propose a single-photon-memory MDI QSDC protocol (SPMQC) for dispensing with high-performance quantum memory.
  arXiv  Detail & Related papers  (2022-12-12T02:23:57Z)
• Byzantine-Robust Federated Learning with Optimal Statistical Rates and Privacy Guarantees [123.0401978870009]
  We propose Byzantine-robust federated learning protocols with nearly optimal statistical rates. We benchmark against competing protocols and show the empirical superiority of the proposed protocols. Our protocols with bucketing can be naturally combined with privacy-guaranteeing procedures to introduce security against a semi-honest server.
  arXiv  Detail & Related papers  (2022-05-24T04:03:07Z)
• Remote quantum-safe authentication of entities with physical unclonable functions [0.0]
  We discuss the requirements that an entity authentication protocol has to offer in order to be useful for remote entity authentication in practice. We propose a protocol, which can operate over large distances, and offers security against both classical and quantum adversaries.
  arXiv  Detail & Related papers  (2021-08-01T15:03:23Z)
• Twin-field quantum digital signatures [4.503555294002338]
  Digital signature is a key technique in information security, especially for identity authentications. Quantum digital signatures (QDSs) provide a considerably higher level of security, i.e., information-theoretic security.
  arXiv  Detail & Related papers  (2020-03-25T08:04:59Z)

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.