Papers for
iot device developers
Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.
Information-theoretic threshold digital signatures secure for low-power devices
Information-Theoretic Threshold Designated-Verifier Digital Signatures for Resource-Constrained Devices
Abstract: Digital signatures are synonymous with data integrity and authenticity. Among applications such as e-commerce, software distribution, and instruction processing they play a vital role in the secure communication of data. Within this context and in preparation for quantum adversarial tactics we present three new information-theoretic threshold designated verifier digital signature schemes and prove them secure against \textit{any} adversary under the standard security criterion. The $n$-of-$n$ multi-signature, $t$-of-$n$ threshold with dealer, and $t$-of-$n$ threshold without dealer designated verifier signature schemes can be implemented with simple mathematical constructs and we demonstrate the efficiency of these with evaluation of signature computation ($\lessapprox$ 80\,ms) and verification times ($\lessapprox$ 150\,ms) on the resource constrained platform of Raspberry Pi 4. We find our scheme also has equivalent or improved (2$\times$) performance than a comparable state-of-the-art post-quantum threshold digital signature scheme on both resource constrained devices and the more capable consumer-grade 2025 M5 MacBook Pro.
Time-series models remain reliable despite changes in data sampling rates
Quantifying the Sampling Frequency Invariance of Time-Series Foundation Models for Sensor Data Applications
Abstract: Time-Series Foundation Models (TSFMs) are increasingly used in sensor applications, where sampling frequency (SF) varies across sensors, devices, and operating modes (e.g., power saving). Ideally, TSFMs must remain effective during such SF changes, provided the SF retains task-critical bandwidth. In this paper, we stress-test 4 prominent TSFMs: MOMENT, Chronos-2, Moirai-MoE, and TimesFM, to quantify their SF-invariance and investigate whether their behavior tracks the resulting loss of information bandwidth rather than the SF value itself. Our stress-test probes 3 dimensions: (i) the shift in embeddings, (ii) the degradation in forecasting performance, and (iii) the degradation in downstream performance, quantified by three novel metrics: FSI, FDI, and CDI, respectively. To our knowledge, this is the first study to place SF-invariance at the core of TSFM evaluations. Our results characterize: (i) how SF-invariance depends on the margin between signal's native-SF and the bandwidth its task requires, (ii) how much of that invariance the choice of TSFM explains, and (iii) how much of TSFM's performance degradation under a lower SF reflects information loss rather than a limitation of their abilities. These findings reframe SF-invariance as a measurable, signal-aware property of the (signal X TSFM) pair, and guide practitioners on when TSFMs display SF-invariance.
System protection on risc-v chips improves with bounded dynamic delegation
Reconfiguring System-Level Protection Through Bounded Delegation in RISC-V MCUs
Abstract: MCU-based embedded and cyber-physical systems increasingly require protection policies to change at runtime as resources, software, and system composition evolve. Yet widely used COTS MCU protection mechanisms are still largely designed around statically established policies. While they can restrict which domains modify protection primitives, they generally do not constrain what policy an authorized domain may create. As a result, domains may expand protection rules beyond their intended scope or interfere with boundaries established by other domains. We identify bounded configuration authority as a missing primitive for secure dynamic policy evolution and introduce an ownership-aware model in which explicit ownership and rule containment bound both configuration authority and recursive delegation. Changes to active protection-rule ranges are validated before commit, preserving protection boundaries without extending the normal access-checking datapath. We implement the model in an open-source RISC-V World Checker integrated into a CVA6-based SoC. Our FPGA evaluation shows no degradation in access latency or operating frequency, with 7.1% LUT and 1.2% FF overhead for eight rules. In an OTA update case study, direct reconfiguration under delegated authority reduces policy-transition latency by 89.5% over hypervisor mediation and 94.6% over trusted firmware mediation, while preserving established authority boundaries. All artifacts will be open-sourced to support the evolution of RISC-V specifications and system-level protection designs.
Post quantum cryptography tested for industry use in iot and healthcare
Brief introduction to post-quantum cryptography in industrial applications
Abstract: The development of Post-Quantum Cryptography (PQC) is directly motivated by the necessity to secure information in the face of the quantum threat. This paper provides an overview of recent developments relevant to PQC adoption across several industrial applications, including IoT, healthcare, civil and infrastructure engineering, and defense. We present a brief, self-contained overview of PQC and its market positioning. We perform implementation experiments on selected quantum-safe methods and quantify several aspects, such as the quantum resources required to break common cryptographic schemes, as well as the performance of the most well-known PQC algorithms. We also discuss the resistance of different PQC classes to quantum attacks and the status of PQC implementations in different programming languages. Finally, we present benchmark results on KEMs and signature algorithms to help select the appropriate algorithm for a specific application based on criteria such as algorithm performance, data lifetime, and level of data sensitivity.
Semantic importance guides testing for industrial iot communication
Semantic-Aware Communications in Industrial IoT:What Can Be Tested Today, and What Is Missing?
Abstract: Classical networks treat every bit as equally important, which wastes time and energy in factories and requires extra traffic engineering for critical traffic. Semantic communications send only what a task needs, but how can they be tested under realistic conditions? This paper examines what can be tested today in 6G industrial IoT, that is, networks of factory machines, robots, and sensors, and what is still missing. It introduces semantic importance, a score attached to each message that states how much the message matters, and uses it in a context-driven design to derive eight testing needs. Existing simulators, emulators, testbeds, codecs, and learning frameworks are assessed against these needs, which reveals five gaps. We propose a toolchain of four components built around the ns-3 simulator for simulated and emulated scenarios.
Efficient encryption method protects health data on embedded devices
An Agile Homomorphic Encryption and ML-KEM Scheme for Privacy-Preserving Health Data Processing
Abstract: The storage and processing of health data raise serious privacy concerns; therefore, the data must be encrypted. Fully Homomorphic Encryption (FHE) allows computations on encrypted data, which makes it a very promising technology in this context. However, although the efficiency of FHE algorithms has improved in recent years, they remain very complex. The security of several prominent FHE schemes is based on variants of the Learning With Errors (LWE) problem, which is also the basis of Module-Lattice-Based Key-Encapsulation Mechanism (ML-KEM), the new post-quantum standard for asymmetric encryption. In this paper, we propose an agile cryptographic scheme -combining ML-KEM and BGV -that allows efficient implementations in an embedded use case. We describe the parameter selection for the proposed scheme and show its feasibility with a proof-of-concept implementation.
Power saving and freshness tradeoffs in mobile device reception
Age of Information for Power-Saving Devices with DRX Mechanism
Abstract: Reducing the power consumption of User Equipment (UE) has always been a crucial issue in communication systems. As a result, Discontinuous reception (DRX) is introduced in today's New Radio (NR) networks as a power-saving strategy. In addition, the variety of low latency applications in 6G makes the issue of maintaining data freshness increasingly important. This paper aims to study the relationship between freshness and power-saving. To capture the information freshness, we use Age of Information (AoI) as the performance metric. To our best knowledge, unlike previous studies focusing on power saving and delay trade-offs, this is the first study considering the impact of DRX on AoI. We solve the closed-form solution of the peak average AoI with the DRX mechanism. Moreover, we propose a parameters adjustment strategy. Based on the simulation validation, our proposed strategy can enable the UE to keep the AoI close to the theoretical lower bound AoI while achieving high power-saving efficiency.
Backscatter communication improves reliability with energy-aware retransmission
Energy-Accumulate-Then-Act Backscatter Communications With Retransmission Under Imperfect Feedback Detection
Abstract: In this paper, we propose a threshold-triggered energy-accumulate-then-act backscatter communication system with retransmission under imperfect feedback detection. Under this system, harvested energy is accumulated across transmission blocks, and the backscatter device switches among different operation modes, including energy harvesting, initial transmission, and retransmission, according to its stored energy and decoded feedback. To characterize the resulting dynamics, the joint evolution of the packet-buffer and stored-energy states is modeled, based on which an embedded Markov chain is constructed to derive the steady-state energy distribution at the beginning of each update cycle. Subsequently, the average age of information (AAoI) is derived from the statistics of the inter-update interval and its correlation with the preceding packet system time, while the packet loss rate (PLR) caused by imperfect feedback detection is also obtained. Simulation results validate the analytical results and reveal that retransmission reduces PLR but may either improve or degrade AAoI, depending on packet-generation energy, data transmission rate, and feedback power. Moreover, lower feedback power shrinks the AAoI-favorable region of retransmission at low transmission rate, whereas the opposite trend emerges at higher rate.
Lightweight C code generator speeds up AI on tiny devices
A lightweight C Code Generator for Heterogeneous TinyML Systems
Abstract: Over the past decade, the significant advancements in artificial intelligence have been closely tied to increasingly sophisticated training frameworks and steadily powerful computing hardware. However, the entire ecosystem remains fragmented. On one hand, models are represented with frameworks dependent formats, while on the other hand, new tailored hardware for accelerating novel operators has continued to emerge. To effectively diminish the transfer costs from training to inference, we propose a lightweight C code generator designed for bare-metal heterogeneous systems that incorporate domain-specific accelerators. Through a comprehensive case study on a RISC-V based radar DSP, we demonstrate that by employing an accelerator with ahead-of-time optimizations like weight tuning and bias fusion, our approach achieves a 2.3 times improvement in inference speed and a 20% reduction in binary size compared to the microTVM flow registered with the same accelerator, thus offering another compelling choice for resource-constrained edge devices. The code is open-sourced in Gitlab.
Trust challenges and solutions for offline generative AI on Raspberry Pi 5
Trust Mechanisms for Offline Generative AI at the Edge: A Connectivity-Regime Framework and an Empirical Study on a Raspberry Pi 5
Abstract: Generative AI and large language models (LLMs) are moving into the Internet of Things, yet most deployments assume cloud connectivity, and many IoT settings have intermittent, restricted, or no connectivity. We propose a connectivity-regime framework (C0-C4), a taxonomy of inference-time trust mechanisms, and signed, versioned knowledge packs as the update channel for disconnected regimes, and evaluate them on a Raspberry Pi 5 running fully local retrieval-augmented generation under network isolation, with three Qwen2.5 model sizes, three context sizes, and 300 SQuAD 2.0 questions. An empirically calibrated retrieval-score gate detects knowledge gaps almost perfectly (AUROC 0.97) but in-topic unanswerable questions poorly (0.68). A deterministic output validator converts malformed outputs into explicit abstentions with no observed loss of correct answers, while the NLI-based verifier we tested adds little; for the 7B model, 96% of substantive answers to unanswerable-labelled questions match normalized spans of the retrieved passages. A 3B model achieves the same gold-answer containment rate as a 7B model at less than half the latency and estimated energy, although the 7B model far more often exceeds a token-F1 threshold of 0.5; five retrieved passages lower correctness from 75% to 52% compared with three. Verifying a signed pack takes about 4.5 ms versus about 29 min for embedding its passages on the device; signature and hash checks alone accept six of nine tested update attacks that layered verification rejects. Yet a validly signed poisoned pack passes every pack check: on 30 previously correct questions, correct answers drop to zero and 14 return the injected answer. None of the mechanisms we evaluated establishes the truth of the evidence. We release code and data.
Evsefuzz tool improves security testing of ev charging protocols
EVSEFuzz : A Tool for Automated Testing of Protocol Implementations
Abstract: The rapid adoption and development of electric vehicle (EV) networks has required the expansive deployment of EV charging infrastructure (EVCI) which relies on communication protocols such as the open charge point protocol (OCPP) to coordinate data transfer between charging network operators and the EV supply equipment. In this paper, we present EVSEFuzz, a tool for automatically building fuzzers to test the security of protocol implementations. To achieve this we make a novel use of Python datatype validation packages and tools to ``understand'' datatypes and message structures and generate both compliant and non-compliant messages. To date, EVSEFuzz has been tested successfully with several open and closed-source implementations and has found several vulnerabilities leading to the publication of two CVEs.
Post quantum cryptography runs efficiently on small devices in tls connections
Testing TLS 1.3 PQC on constrained devices and microcontrollers
Abstract: The UK, EU and US governments have set timelines for post-quantum cryptography migration of critical systems, with deadlines ranging from 2028 to 2035. This paper focuses on IoT-class devices and microcontrollers and the viability of using PQC to connect these devices in secure TLS 1.3 connections. Using wolfSSL, we benchmark a 36-combination TLS 1.3 algorithm matrix, pairing ML-KEM-512/768/1024 and X25519/ECC P-256 key exchange with ML-DSA-44/65/87, Ed25519, ECDSA, and RSA-PSS authentication, across four devices (Raspberry Pi Pico W & Pico 2 W, ESP32, and a Raspberry Pi Zero), measuring both handshake latency and energy consumption. We found that in capable devices, all choices in the TLS matrix gave similar results, but that in IoT-class devices, PQC performance is highly implementation- and architecture-dependent: the common assumption that elliptic-curve key exchange must be cheaper than post-quantum lattice-based key exchange does not hold in this wolfSSL-based implementation, where the best full-PQC combination (ML-KEM-512 + ML-DSA-44) completes TLS handshakes 41% faster than the equivalent classical-modern pairing (X25519 + RSA-PSS) on the Pico W (up to 2.12x as energy-efficient, depending on the paired authentication algorithm), and 8.9x faster on the ESP32. Full-PQC, ML-KEM-512/ML-DSA-44, is not only possible but energy-competitive with or superior to Hybrid or Elliptic Curve alternatives on the most constrained devices, though ML-DSA's variable signing time means applications with strict latency-predictability budgets must accept this variance as the cost of full quantum-safe authentication. We further show that the IETF's draft-specified X25519+ML-KEM-768 hybrid incurs approximately the combined cost of its two components, rather than offering a performance compromise, making pure ML-KEM the more practical choice on hardware lacking Curve25519 assembly support.
Sparse echo state networks cut model size and speed up time series tasks
Sparse Federated Echo State Networks for Time-Series Classification via Smooth-L1 Regularization
Abstract: Echo State Networks (ESNs), as lightweight implementations of reservoir computing, provide efficient solutions for temporal data processing in resource-constrained environments. While standard ESNs offer computational efficiency, their dense readout layers inflate the stored model and the per-sample inference cost. This paper introduces a Smooth-L1 regularized ESN (SL1ESN) that promotes sparsity in the readout layer while preserving differentiability for gradient-based optimization. The method employs a twice-differentiable Smooth-L1 approximation compatible with Newton's method, which we exploit both for centralized training and for a second-order (Newton-step) federated aggregation scheme. Under a single fixed shrinkage threshold shared by every dataset and both settings, experiments on seven time-series classification benchmarks show that SL1ESN learns readouts that are $77$--$95\%$ sparse in the centralized setting and $75$--$95\%$ sparse in the federated one, while staying within $0.7$ accuracy points of the strongest dense baseline on five of the seven benchmarks in the centralized setting and within $1.6$ points on the same five in the federated one, and the second-order federated update converges in only a few rounds. The resulting sparsity compresses the stored model, the per-sample inference cost, and the server-to-client broadcast by a comparable factor. These results demonstrate the practical value of sparse readouts for edge computing and IoT deployments.
Optical wireless receiver detects faults using on-device AI
Fault Detection and Bit-Error Rate Diagnostics in Optical Wireless Links Using Edge-AI
Abstract: Optical Wireless Communication (OWC) systems provide high-bandwidth, spatially secure, and RF-interference-free digital transmission. However, direct free-space optical links suffer from extreme sensitivity to line-of-sight disruptions, optical attenuation, high ambient light saturation, and transmitter-receiver misalignment. Traditional channel diagnostic frameworks rely on external computing nodes or cloud-based processing, which introduces severe diagnostic latency and reduces edge node autonomy. This paper presents an autonomous, self-diagnosing optical wireless receiver node that integrates physical-layer signal telemetry extraction with an on-device TinyML classification engine. Built around an ESP32-S3 microcontroller, the receiver recovers 1000 bit/s On-Off Keying (OOK) digital payloads using a 5-sample majority voting mechanism while concurrently extracting real-time channel features: Bit Error Rate (BER), received signal voltage (Vsignal), Signal-to-Noise Ratio (SNRdB), and ambient light baseline (Lambient). Evaluated against a Random Forest baseline (77.22% accuracy) and a floating-point neural network (78.48% accuracy), a post-training INT8 quantized TensorFlow Lite Micro model occupying only 3.32 kB of SRAM runs directly on the receiver firmware. The quantized model achieves 74.68% overall accuracy across four distinct operational conditions: normal transmission, optical filter attenuation, ambient light interference, and severe obstruction/misalignment. On-device deployment tests confirm real-time, deterministic fault classification, establishing a practical approach for self-aware optical IoT nodes.
More interactions reduce data sent for better task communication
More Interactions Make Communications More Efficient: A Directed Information Bottleneck Approach to Task-Oriented Communication
Abstract: Task-oriented communication improves communication efficiency by transmitting semantic information required for downstream tasks, but may incur redundancy with previously transmitted information. To address this issue, we propose a variational directed information bottleneck joint source-channel coding (VDIB-JSCC) framework that transmits only previously unacquired information. Specifically, we use directed information to characterize the causal flow of task-relevant incremental information and theoretically demonstrate its advantages over mutual information and conditional mutual information. Based on this metric, we formulate a directed information bottleneck (DIB) objective that balances task-relevant information preservation and redundant information compression. We further derive a variational formulation, termed VDIB, whose tractable upper bound serves as the training loss. The encoder integrates a Vision Transformer for frame-wise semantic extraction and a Mamba-based causal state-space model for capturing temporal dependencies and extracting incremental information, while the decoder uses a Mamba-based state-space model for task inference. Experiments on CIFAR-10 and CIFAR-100 video streams demonstrate that VDIB-JSCC achieves higher classification accuracy with less transmitted information than state-of-the-art semantic communication methods. These results show that leveraging historical knowledge enables task completion with less information, improving communication efficiency.
ARMOR protects IoT devices against password guessing attacks efficiently
ARMOR: Adversary Cost Amplification via a Schema-Preserving Password-Hardening Retrofit for Resource-Constrained Systems
Abstract: Internet of Things (IoT) gateways, edge authentication servers, and legacy systems need protection against offline password guessing after credential-database disclosure. Memory-hard key derivation functions (KDFs) are the preferred defense, but their resource requirements can exceed memory or latency budgets. ARMOR addresses this gap with a schema-preserving verifier-side transform for database-only (DB-only) compromise. Secret per-account chains of injective operations reside in an isolated Chain Registry. Fixed terminal escape encoding preserves distinct pre-hash values under each chain and moves outputs outside printable ASCII. We evaluate NAIVE adversaries using unmodified cracking tools and AWARE adversaries that enumerate chains. For the evaluated pre-hardened three-operation chains, NAIVE recovery is at most 0.10% on non-digit targets. Escape encoding yields zero recovery of digit-only targets under evaluated stock rule-based and non-rule attacks, closing a bypass permitting up to 45.3% recovery. Across 14.05 million eligible RockYou password entries, retaining duplicates, the median conditional guessing number is approximately 52 output-class tests at depth three and 317 at depth five. These values quantify the chain-search subproblem given the correct plaintext under a unit-cost model. A separate historical 14-operation AWARE evaluation matches all transformed targets at full dictionary coverage. Deployment measurements show microsecond-scale bare-metal transforms on three IoT boards, with protected storage dominating the measured TrustZone-M prototype components. Although an isolated high-entropy pepper provides stronger cryptographic protection, ARMOR combines compact per-account chain storage with low transform cost. When resources permit and the KDF accepts the complete transformed output, ARMOR composes as KDF(ARMOR(password)).
Faster post-quantum TLS handshake on x86 IoT gateways with HQC optimizations
Accelerating HQC for Post-Quantum TLS 1.3 on x86 IoT Gateways
Abstract: Post-quantum TLS at an IoT gateway must protect many device connections without large increases in handshake delay, CPU cost, or network traffic. HQC provides code-based diversity beyond ML-KEM, but its computation and ciphertext sizes can increase these costs. We optimize HQC for x86 processors with AVX2, AVX-512, and the Galois Field New Instructions (GFNI), and integrate the resulting implementations into TLS 1.3. We extend branch-free Toom-Cook/Karatsuba multiplication to AVX-512, accelerate Reed-Solomon decoding with GFNI, improve Reed-Muller decoding, accelerate SHA3-512 and fixed-weight sampling, and port Frobenius additive FFT (FAFFT) multiplication to AVX-512 + GFNI for HQC-5. On an Intel Core i5-1135G7 processor, our AVX2 implementation reduces decapsulation by 11.1-21.5% over the fastest prior AVX2 results. Our AVX-512 implementation reduces key generation by 24.9-29.5%, encapsulation by 10.4-11.1%, and decapsulation by 20.6-26.1% relative to Cabral et al. across the three HQC parameter sets. We evaluate the effects of these implementations on TLS 1.3 handshake latency and server and client CPU costs, as well as the effects of round-trip time (RTT) and bandwidth. In local loopback TLS measurements, our AVX-512 HQC-5 implementation reduces handshake latency from 3.22 ms to 2.92 ms compared with Cabral et al. On a constrained path with 1 Mbit/s bandwidth and an added RTT of 50 ms, the HQC-5 handshake takes 243 ms, compared with 87 ms for ML-KEM-1024. This indicates that HQC public-key and ciphertext sizes, rather than implementation speed, determine the remaining handshake cost on constrained links.
Zeppelin speeds secure encryption on tiny IoT microcontrollers
Zeppelin: Client-Side BFV Encryption and Decryption for Helium-Powered Microcontrollers
Abstract: The growth of the Internet of Things (IoT) has raised concerns over the privacy of data collected by resource-constrained sensing devices. Homomorphic encryption (HE) addresses this by letting a device encrypt its data once and an untrusted cloud server compute on the ciphertext without seeing the values. In practice, HE's memory and computational cost have kept it out of reach of microcontroller-class devices. Prior work, SEAL-Embedded, made this feasible using CKKS, but left three gaps: its arithmetic is entirely scalar, even on hardware with a vector instruction set; it never decrypts on the device, so the client cannot consume a result; and it does not explore BFV, whose encoding uses only integer arithmetic and decrypts exactly. We present Zeppelin, the first HE library to use an embedded vector instruction set, the first to support both encryption and decryption on an embedded device, and the first BFV implementation on MCU-class hardware. Zeppelin vectorizes the number-theoretic transform, HE's main bottleneck, for ARM's Helium extension, and includes a decryption procedure that avoids large-integer arithmetic and timing leakage of the secret key. A server-side adapter converts Zeppelin's ciphertexts into a format compatible with Microsoft SEAL, so the device handles encryption and decryption while the server performs all homomorphic computation. On an STM32N6 MCU with an ARM Cortex-M55, Zeppelin encodes and encrypts 4096 packed values in 4.76 ms (seeded symmetric, 128-bit security per the HE standard) and decrypts and decodes the result in 5.38 ms, using under 500 KB of RAM, with the vectorized NTT engine ${\sim}2.7\times$ faster than an equivalent scalar implementation on the same core.
Id codes reduce data and energy use in large ad hoc networks
Identification Codes for Ad Hoc Networks: Use Cases and Challenges
Abstract: In this study, we focus on large-scale ad hoc networks characterized by a high node density. To achieve energy efficiency, the devices must minimize their data transmission, thereby reducing the total number of bits sent and the associated energy consumption. We consider using ID codes for the address field in the MAC layer and reduce the header size. The work explores a range of use cases and challenges that demonstrate the benefits of incorporating these ID codes into packet routing mechanisms for ad hoc networks, thereby providing a foundation for understanding their applicability and the necessary design adaptations.
System-level tuning significantly improves post-quantum crypto on Arm Cortex-M7
System-Level Optimization Beyond Cryptographic Kernels: An ML-KEM Case Study on Arm Cortex-M7
Abstract: Recent work on embedded post-quantum cryptography has focused primarily on instruction-level optimization, including arithmetic-kernel improvements, assembly tuning, register allocation, and instruction scheduling. Using the Module-Lattice-Based Key-Encapsulation Mechanism (ML-KEM) on an Arm Cortex-M7 as a case study, we examine the additional gains available from memory-hierarchy utilization, tightly coupled memory placement, peripheral integration, clock configuration, and deterministic public-data reuse. The evaluation starts from a state-of-the-art SLOTHY-optimized implementation and covers all three ML-KEM parameter sets. Without modifying the cryptographic algorithm or standardized wire formats, the evaluated profiles without auxiliary public state reduce cycles by up to 2.5%. A selected public-data-reuse profile reduces encapsulation and decapsulation cycles by up to 74.6% and 58.8%, respectively. These results demonstrate that substantial deployment gains remain after arithmetic-kernel optimization and motivate a two-stage methodology that also examines the surrounding execution system.
Time series model shares weights to cut parameters by nearly half
Fracast-0: Fractal Weight Sharing for a Time Series Foundation Model with Only 85K Parameters
Abstract: Time series foundation models must preserve multi-domain breadth, probabilistic output, and multiple temporal scales, but parameter count grows when each scale receives a separate representation. We introduce Fracast-0, a probabilistic forecasting foundation model that exploits temporal self-similarity to reuse one operator across scales. A parameter-free detector extracts significant seasonal structure. The encoder applies a shared local block along a geometric dilation ladder with scale conditioning, while the decoder combines context-gathered states with an explicit seasonal future state and reuses a second block along another ladder before emitting nine quantiles. Pretraining across six corpora preserves multi-domain breadth within 85,001 parameters. On 97 GIFT-Eval configurations without per-dataset fine-tuning, Fracast-0 is the smallest of 28 evaluated checkpoints and remains non-dominated in the aggregate parameter-accuracy plane with MASE 0.808 and WQL 0.564. It uses 42.0% fewer parameters than TinyCast, whose MASE and WQL are 4.2% and 3.3% lower. These results support cross-scale weight reuse as a practical route to further time series foundation model compression.
Tiny neural codec enables clear voice on low power devices
Narrowband Voice Communication Using Streaming Neural Compression
Abstract: Low-bitrate speech communication on resource-constrained edge devices remains challenging due to stringent computational, memory, and bandwidth constraints. We present TinyCall, a lightweight neural audio codec designed for real-time speech communication on low-power platforms such as the ESP32 microcontroller and Raspberry Pi. The proposed system targets emergency communication and other bandwidth-limited scenarios while preserving speech intelligibility, speaker identity, and vocal expressiveness. To enable efficient deployment, we propose a minimal neural audio codec architecture together with a framework for converting a causally trained codec into a truly streamable codec through pseudo-lookahead decoding and decoder-input caching. We further replace conventional residual vector quantization (RVQ) with Residual Finite Scalar Quantization (RFSQ) to reduce inference complexity on edge processors and employ a progressive three-stage training strategy for stable optimization under latent quantization. An MFCC-based perceptual loss encourages preservation of speaker characteristics, including harmonic structure and vocal timbre. Experimental results demonstrate real-time operation on a Raspberry Pi 3 while achieving intelligible speech reconstruction at bitrates as low as 2.3 kbps. The proposed approach demonstrates that practical neural speech communication is feasible on highly resource-constrained edge devices.
Tool-interface granularity affects performance of local AI agents
MCP-GRANITE Benchmark: GRANularity Interface TEsting for MCP-Based LLM Agents
Abstract: As LLM agents increasingly interact with external tools through standardized protocols such as MCP, tool-interface design becomes a critical yet underexplored factor. How funψtionality is decomposed into tools affects whether an agent can select the right tool and construct valid arguments. This choice is especially consequential at the edge, where resource constraints limit which models can run locally and scaling up is often not an option. We present MCP-GRANITE, an open-source extensible benchmark framework that treats tool-interface granularity as a controlled variable for MCP-based agents, evaluated under edge and IoT scenarios. It comprises 81 multi-step scenarios across 9 domains, instantiated at 4 granularity levels from fine-grained primitive tools to a single tool. We evaluate 9 locally deployed models (268M-20.9B parameters) across 8,748 trials using task completion, tool selection F1, argument accuracy, latency, and resource-usage metrics. Results show that a 4-tool interface offers the best trade-off, improving task completion by 16.4% over fine-grained primitives and 33.6% over a single monolithic tool, while nearly doubling argument accuracy. Model size is only weakly correlated with task completion and strongly with latency, while its association with argument accuracy is less robust, and a 3.2B model at the optimal granularity outperforms a 20.9B model at a mismatched one. These findings identify tool-interface granularity as a key design parameter for MCP-based agents.
Spiking neural networks reduce communication and improve accuracy with predictive coding
Predictive Suppression Layers for Communication-Efficient Spiking Neural Networks
Abstract: Feedforward Spiking Neural Networks (SNNs) typically propagate every generated spike indiscriminately, disregarding whether the information is redundant from an information-theoretic perspective. This lack of selectivity induces high redundancy in inter-layer communication, creating an expensive overhead, e.g., in scenarios involving many-core neuromorphic hardware or communication-dominated Internet-of-Things (IoT) where features are transmitted wirelessly. To address this challenge, we trade localized processing for leaner network channels by introducing a minimal predictive coding framework for SNNs. We propose two layer variants sharing a predictor block: error units, which transmit signed spiking residuals, and predictive suppression, which uses residual magnitude to dynamically gate and forward only unpredictable, "surprising" activity. Evaluated on the N-MNIST and Spiking Heidelberg Digits (SHD) datasets using diagnostic metrics that decouple local processing from cross-layer communication, our new predictive coding layers achieve significant communication savings. Numerical results reveal a three-fold reduction in communicated activity, while increasing the task accuracy for both datasets. The latter finding is notable, and suggests that predictive coding layers not only minimize communication overhead, but also produce output feature vectors with a higher representation power.
Large language models evaluated on cryptographic security for iot devices
CESBench: Benchmarking Large Language Models on Cryptographic Engineering Security for IoT Devices
Abstract: For Internet of Things (IoT) devices, a secure algorithm alone is not enough: an attacker with physical access can attack the implementation directly, and its flaws are hard to fix once deployed. Large language models (LLMs) are now used to build and analyze such implementations. LLM benchmarks exist for cryptography and general cybersecurity, but none covers cryptographic engineering. In this paper, we present CESBench, 380 expert-written items across six sub-domains of cryptographic engineering security for IoT devices: side-channel, fault injection, implementation, countermeasures, evaluation, and integration. Four task types target different competences: 209 multiple-choice items test recall, 67 judgment items require a security verdict and its justification, 63 scenario items require an engineering diagnosis, and 41 code tasks are graded by 572 test cases. To validate the benchmark, 11 open-weight and proprietary LLMs answer every item. Multiple-choice and code responses are scored automatically, and judgment and scenario responses by an LLM judge, whose scores are checked against a second judge from another model family and human re-scoring. Composite scores range from 54.4% to 83.6%. The top score on each task type is 98.6% for multiple choice, 95.1% for code, and 88.4% for scenario diagnosis, but only 58.8% for judgment. Across models, 88.5% of verdicts are correct, yet their justifications earn only 53.4% of the rubric marks. Multiple choice is near its ceiling for the strongest models and most code tasks are solved, whereas justifying a security verdict remains the weakest competence. The benchmark, prompts, and per-item results are public.