Low Overhead Research Articles

Tra ined Wi thout My C onsent: Detecting Code Inclusion In Language Models Trained on Code

Code auditing ensures that the developed code adheres to standards, regulations, and copyright protection by verifying that it does not contain code from protected sources. The recent advent of Large Language Models (LLMs) as coding assistants in the software development process poses new challenges for code auditing. The dataset for training these models is mainly collected from publicly available sources. This raises the issue of intellectual property infringement as developers’ codes are already included in the dataset. Therefore, auditing code developed using LLMs is challenging, as it is difficult to reliably assert if an LLM used during development has been trained on specific copyrighted codes, given that we do not have access to the training datasets of these models. Given the non-disclosure of the training datasets, traditional approaches such as code clone detection are insufficient for asserting copyright infringement. To address this challenge, we propose a new approach, TraWiC; a model-agnostic and interpretable method based on membership inference for detecting code inclusion in an LLM’s training dataset. We extract syntactic and semantic identifiers unique to each program to train a classifier for detecting code inclusion. In our experiments, we observe that TraWiC is capable of detecting 83.87% of codes that were used to train an LLM. In comparison, the prevalent clone detection tool NiCad is only capable of detecting 47.64%. In addition to its remarkable performance, TraWiC has low resource overhead in contrast to pair-wise clone detection that is conducted during the auditing process of tools like CodeWhisperer reference tracker, across thousands of code snippets.

Deep Autoencoder for Real-Time Single-Channel EEG Cleaning and Its Smartphone Implementation Using TensorFlow Lite With Hardware/Software Acceleration.

To remove signal contamination in electroencephalogram (EEG) traces coming from ocular, motion, and muscular artifacts which degrade signal quality. To do this in real-time, with low computational overhead, on a mobile platform in a channel count independent manner to enable portable Brain-Computer Interface (BCI) applications. We propose a Deep AutoEncoder (DAE) neural network for single-channel EEG artifact removal, and implement it on a smartphone via TensorFlow Lite. Delegate based acceleration is employed to allow real-time, low computational resource operation. Artifact removal performance is quantified by comparing corrupted and ground-truth clean EEG data from public datasets for a range of artifact types. The on-phone computational resources required are also measured when processing pre-saved data. DAE cleaned EEG shows high correlations with ground-truth clean EEG, with average Correlation Coefficients of 0.96, 0.85, 0.70 and 0.79 for clean EEG reconstruction, and EOG, motion, and EMG artifact removal respectively. On-smartphone tests show the model processes a 4 s EEG window within 5 ms, substantially outperforming a comparison FastICA artifact removal algorithm. The proposed DAE model shows effectiveness in single-channel EEG artifact removal. This is the first demonstration of a low-computational resource deep learning model for mobile EEG in smartphones with hardware/software acceleration. This work enables portable BCIs which require low latency real-time artifact removal, and potentially operation with a small number of EEG channels for wearability. It makes use of the artificial intelligence accelerators found in modern smartphones to improve computational performance compared to previous artifact removal approaches.

Improving the CSIDH Protocol for Multi-party Cryptography: Rigorous Mathematical Analysis, Efficiency, and Security Comparison

This paper introduces a novel Distributed Key Generation (DKG) protocol based on the Commutative Supersingular Isogeny Diffie-Hellman (CSIDH) framework for secure multi-party cryptography. Our proposed protocol is designed to address scalability and security concerns, particularly in post-quantum cryptographic systems. The main contributions include the introduction of Piecewise Verifiable Proofs (PVPs) for non-interactive zero-knowledge verification of secret shares, and the provision of rigorous security analysis, including resistance to quantum adversaries via Shor’s and Grover’s algorithms. We analyze the protocol’s efficiency, ensuring low computational overhead even in large-scale systems, and compare it with other distributed cryptographic protocols such as RSA-based and lattice-based schemes. Through mathematical proofs and complexity analysis, we demonstrate that our protocol offers enhanced security, efficiency, and scalability in a post-quantum environment. The results presented in this paper provide a strong foundation for implementing secure multi-party computations in quantum-resistant systems.

Ytopt: Autotuning Scientific Applications for Energy Efficiency at Large Scales

ABSTRACTAs we enter the exascale computing era, efficiently utilizing power and optimizing the performance of scientific applications under power and energy constraints has become critical and challenging. We propose a low‐overhead autotuning framework to autotune performance and energy for various hybrid MPI/OpenMP scientific applications at large scales and to explore the tradeoffs between application runtime and power/energy for energy efficient application execution, then use this framework to autotune four ECP proxy applications—XSBench, AMG, SWFFT, and SW4lite. Our approach uses Bayesian optimization with a Random Forest surrogate model to effectively search parameter spaces with up to 6 million different configurations on two large‐scale HPC production systems, Theta at Argonne National Laboratory and Summit at Oak Ridge National Laboratory. The experimental results show that our autotuning framework at large scales has low overhead and achieves good scalability. Using the proposed autotuning framework to identify the best configurations, we achieve up to 91.59% performance improvement, up to 21.2% energy savings, and up to 37.84% EDP (energy delay product) improvement on up to 4096 nodes.

Real-Time Forest Fire Detection with Lightweight CNN Using Hierarchical Multi-Task Knowledge Distillation

Forest fires pose a significant threat to ecosystems, property, and human life, making their early and accurate detection crucial for effective intervention. This study presents a novel, lightweight approach to real-time forest fire detection that is optimized for resource-constrained devices like drones. The method integrates multi-task knowledge distillation, transferring knowledge from a high-performance DenseNet201 teacher model that was trained on a hierarchically structured wildfire dataset. The dataset comprised primary classes (fire vs. non-fire) and detailed subclasses that account for confounding elements such as smoke, fog, and reflections. The novelty of this approach lies in leveraging knowledge distillation to transfer the deeper insights learned by the DenseNet201 teacher model—specifically, the auxiliary task of recognizing the confounding elements responsible for false positives—into a lightweight student model, enabling it to achieve a similar robustness without the need for complex architectures. Using this distilled knowledge, we trained a MobileNetV3-based student model, which was designed to operate efficiently in real-time while maintaining a low computational overhead. To address the challenge of false positives caused by visually similar non-fire elements, we introduced the Confounding Element Specificity (CES) metric. This novel metric, made possible by the hierarchical structure of the wildfire dataset, is unique in its focus on evaluating how well the model distinguishes actual fires from the confounding elements that typically result in false positives within the negative class. The proposed approach outperformed the baseline methods—including single-task learning and direct multi-task learning—achieving a primary accuracy of 93.36%, an F1-score of 91.57%, and a higher MES score, demonstrating its enhanced robustness and reliability in diverse environmental conditions. This work bridges the gap between advanced deep learning techniques and practical, scalable solutions for environmental monitoring. Future research will focus on integrating multi-modal data and developing adaptive distillation techniques to further enhance the model’s performance in real-time applications.

Prediction of optical chaos using a multi-stage extreme learning machine with data uncertainty

In this paper, we study the problem of predicting optical chaos for semiconductor lasers, where data uncertainty can severely degrade the performance of chaos prediction. We hereby propose a multi-stage extreme learning machine (MSELM) based approach for the continuous prediction of optical chaos, which handles data uncertainty effectively. Rather than relying on pilot signals for conventional reservoir learning, the proposed approach enables the use of predicted optical intensity as virtual training samples for the MSELM model learning, which leads to enhanced prediction performance and low overhead. To address the data uncertainty in virtual training, total least square (TLS) is employed for the update of the proposed MSELM’s parameters with simple updating rule and low complexity. Simulation results demonstrate that the proposed MSELM can execute the continuous optical chaos predictions effectively. The chaotic time series can be continuously predicted for a time period in excess of 4 ns with a normalized mean squared error (NMSE) lower than 0.012. It also demands much fewer training samples than state-of-the-art learning-based methods. In addition, the simulation results show that with the help of TLS, the length of prediction is improved significantly as the uncertainty is handled properly. Finally, we verify the prediction ability of the multi-stage ELM under various laser parameters, and make the median boxplot of the predicted results, which shows that the proposed MSELM continues to produce accurate and continuous predictions on time-varying optical chaos.

LES-YOLO: efficient object detection algorithm used on UAV for traffic monitoring

Abstract The use of UAVs for traffic monitoring greatly facilitates people’s lives. Classical object detection algorithms struggle to balance high speed and accuracy when processing UAV images on edge devices. To solve the problem, the paper introduces an efficient and slim YOLO with low computational overhead, named LES-YOLO. In order to enrich the feature representation of small and medium objects in UAV images, a redesigned backbone is introduced. And C2f combined with Coordinate Attention is used to focus on key features. In order to enrich cross-scale information and reduce feature loss during network transmission, a novel structure called EMS-PAN (Enhanced Multi-Scale PAN) is designed. At the same time, to alleviate the problem of class imbalance, Focal EIoU is used to optimize network loss calculation instead of CIoU. To minimize redundancy and ensure a slim architecture, the P5 layer has been eliminated from the model. And verification experiments show that LES-YOLO without P5 is more efficient and slimmer. LES-YOLO is trained and tested on the VisDrone2019 dataset. Compared with YOLOv8n-p2, mAP@0.5 and Recall has increased by 7.4% and 7%. The number of parameters is reduced by over 50%, from 2.9 M to 1.4 M, but there is a certain degree of increase in FLOPS, reaching 18.8 GFLOPS. However, the overall computational overhead is still small enough. Moreover, compared with YOLOv8s-p2, both the number of parameters and FLOPS are significantly reduced , while the performance is similar . As for real-time, LES-YOLO reaches 138 fps on GPU and a maximum of 78 fps on edge devices of UAV.

Single-layer digitized-counterdiabatic quantum optimization for p-spin models

Abstract Quantum computing holds the potential for quantum advantage in optimization problems, which requires advances in quantum algorithms and hardware specifications. Adiabatic quantum optimization is conceptually a valid solution that suffers from limited hardware coherence times. In this sense, counterdiabatic quantum protocols provide a shortcut to this process, steering the system along its ground state with fast-changing Hamiltonian. In this work, we take full advantage of a digitized-counterdiabatic quantum optimization algorithm to find an optimal solution of the p-spin model up to four-local interactions. We choose a suitable scheduling function and initial Hamiltonian such that a single-layer quantum circuit suffices to produce a good ground-state overlap. By further optimizing parameters using variational methods, we solve with unit accuracy two-spin, three-spin, and four-spin problems for 100%, 93%, and 83% of instances, respectively. As a particular case of the latter, we also solve factorization problems involving 5, 9, and 12 qubits. Due to the low computational overhead, our compact approach may become a valuable tool towards quantum advantage in the NISQ era.

Secured Fog-Body-Torrent : A Hybrid Symmetric Cryptography with Multi-layer Feed Forward Networks Tuned Chaotic Maps for Physiological Data Transmission in Fog-BAN Environment

Recently, the Wireless Body Area Networks (WBAN) have become a promising and practical option in the tele-care medicine information system that aids for the better clinical monitoring and diagnosis. The trend of using Internet of Things (IoT) has propelled the WBAN technology to new dimension in terms of its network characteristics and efficient data transmission. However, these networks demand the strong authentication protocol to enhance the confidentiality, integrity, recoverability and dependability against the emerging cyber-physical attacks owing to the exposure of the IoT ecosystem and the confidentiality of biometric data. Hence this study proposes the Fog based WBAN infrastructure which incorporates the hybrid symmetric cryptography schemes with the chaotic maps and feed forward networks to achieve the physiological data info security without consuming the characteristics of power hungry WBAN devices. In the proposed model, scroll chaotic maps are iterated to produce the high dynamic keys streams for the real time applications and feed-forward layers are leveraged to align the complex input-output associations of cipher data for subsequent mathematical tasks. The feed forward layers are constructed which relies on the principle of Adaptive Extreme Learning Machines (AELM) thereby increasing randomness in the cipher keys thereby increasing its defensive nature against the different cyber-physical attacks and ensuring the high secured encrypted-decrypted data communication between the users and fog nodes. The real time analysis is conducted during live scenarios. BAN-IoT test beds interfaced with the heterogeneous healthcare sensors and various security metrics are analysed and compared with the various residing cryptographic algorithms. Results demonstrates that the recommended methodology has exhibited the high randomness characteristics and low computational overhead compared with the other traditional BAN oriented cryptography protocol schemes

Weight-Reduced Stabilizer Codes with Lower Overhead

Stabilizer codes are the most widely studied class of quantum error-correcting codes and form the basis of most proposals for a fault-tolerant quantum computer. A stabilizer code is defined by a set of parity-check operators, which are measured in order to infer information about errors that may have occurred. In typical settings, measuring these operators is itself a noisy process and the noise strength scales with the number of qubits involved in a given parity check, or its weight. Hastings has proposed a method for reducing the weights of the parity checks of a stabilizer code, though it has previously only been studied in the asymptotic regime. Here, we instead focus on the regime of small to medium-size codes suitable for quantum computing hardware. We both provide a fully explicit description of Hastings’s method and propose a substantially simplified weight-reduction method that is applicable to the class of quantum product codes. Our simplified method allows us to reduce the check weights of hypergraph- and lifted-product codes to at most six, while preserving the number of logical qubits and at least retaining (in fact, often increasing) the code distance. The price we pay is an increase in the number of physical qubits by a constant factor but we find that our method is much more efficient than Hastings’s method in this regard. We benchmark the performance of our codes on a simulated photonic quantum computing architecture based on Gottesman-Kitaev-Preskill qubits and passive linear optics, finding that our weight-reduction method substantially improves code performance. Published by the American Physical Society 2024

ROPGMN: Effective ROP and variants discovery using dynamic feature and graph matching network

Return Oriented Programming (ROP) is one of the most challenging threats to operating systems. Traditional detection and defense techniques for ROP such as stack protection, address randomization, compiler optimization, control flow integrity, and basic block thresholds have certain limitations in accuracy or efficiency. At the same time, they cannot effectively detect ROP variant attacks, such as COP, COOP, JOP. In this paper, we propose a novel ROP and its variants detection approach that first filters the normal execution flow according to four strategies provided and then adopts Graph Matching Network (GMN) to determine whether there is ROP or its variant attack. Moreover, we developed a prototype named ROPGMN with shared memory to solve cross-language and cross-process problems. Using real-world vulnerable programs and constructed programs with dangerous function calls, we conduct extensive experiments with 6 ROP detectors to evaluate ROPGMN. The experimental results demonstrate the effectiveness of ROPGMN in discovering ROPs and their variant attacks with low performance overhead.

Adaptive Quotient Filters

Filters trade off accuracy for space and occasionally return false positive matches with a bounded error. Numerous systems use filters in fast memory to avoid performing expensive I/Os to slow storage. A fundamental limitation in traditional filters is that they do not change their representation upon seeing a false positive match. Therefore, the maximum false positive rate is only guaranteed for a single query, not for an arbitrary set of queries. We can improve the filter's performance on a stream of queries, especially on a skewed distribution, if we can adapt after encountering false positives. Adaptive filters, such as telescoping quotient filters and adaptive cuckoo filters, update their representation upon detecting a false positive to avoid repeating the same error in the future. Adaptive filters require an auxiliary structure, typically much larger than the main filter and often residing on slow storage, to facilitate adaptation. However, existing adaptive filters are not practical and have not been adopted in real-world systems for two main reasons. First, they offer weak adaptivity guarantees, meaning that fixing a new false positive can cause a previously fixed false positive to come back. Secondly, the sub-optimal design of the auxiliary structure results in adaptivity overheads so substantial that they can actually diminish overall system performance compared to a traditional filter. In this paper, we design and implement the \sysname, the first practical adaptive filter with minimal adaptivity overhead and strong adaptivity guarantees, which means that the performance and false-positive guarantees continue to hold even for adversarial workloads. The \sysname is based on the state-of-the-art quotient filter design and preserves all the critical features of the quotient filter such as cache efficiency and mergeability. Furthermore, we employ a new auxiliary structure design which results in considerably low adaptivity overhead and makes the \sysname practical in real systems. We evaluate the \sysname by using it to filter queries to an on-disk B-tree database and find no negative impact on insert or query performance compared to traditional filters. Against adversarial workloads, the \sysname preserves system performance, whereas traditional filters incur 2× slowdown from adversaries representing as low as 1% of the workload. Finally, we show that on skewed query workloads, the \sysname can reduce the false-positive rate 100× using negligible (1/1000th of a bit per item) space overhead.

Energy-efficient hierarchical cluster-based routing strategies for Internet of Nano-Things: Algorithms design and experimental evaluations

Nanodevices (NDs), which are only a few nanometers (nm) in size, need to communicate with each other to perform complex operations. In nanonetworks, this communication typically involves multiple hops, requiring efficient routing protocols. Existing protocols are not well suited for nanonetworks due to their high resource consumption and setup overhead. In this paper, we propose three novel routing protocols for nanodevices. Non-Back Flooding Routing (NBFR) and Layer-Based Flooding Routing (LBFR) aim to reduce unnecessary packet transmission by utilizing distance and layer information based on received signal power. On the other hand, Tree-Based Forwarding Routing (TBFR) is a unicast-based approach that aims to transmit the packet to the destination using the shortest and most reliable path possible through a tree structure. The performance of these proposed methods is compared to well-known methods in terms of packet transmission, energy consumption, end-to-end delay, and setup overhead. TBFR achieved a packet transmission success of 92.95% in topology with the highest density of nanorouters (NRs), while it reached up to 99.57% for fewer nanorouters. Moreover, its end-to-end delay values are much lower than those of multi-path routing protocols. It also consumed one-fifth of the energy compared to its most challenging multi-path competitor, NBFR, regarding packet transmission success. However, for dense nanosensor (NS) topologies, NBFR and LBFR achieved higher packet transmission rates of 87.04% and 86.66%, respectively. Furthermore, in addition to achieving low end-to-end delays, the energy consumption of NBFR is very close to that of TBFR. In summary, the tests show that TBFR is more suitable for communication among nanorouters due to the requirement of building the tree structure, which results in a slightly higher setup overhead. In contrast, NBFR and LBFR are more suitable for communication between nanosensors because of their simplicity and low setup overhead. But, it should be noted that NBFR requires a larger header than the other alternatives.

DEAC-IoT: Design of lightweight authenticated key agreement protocol for Intra and Inter-IoT device communication using ECC with FPGA implementation

The growing reliance on wireless communication in Internet-of-Things (IoT) devices highlights the critical need for secure and efficient communication protocols, especially in environments vulnerable to cyber threats. Existing IoT protocols often lack sufficient security, creating a need for robust authentication and key exchange mechanisms that can resist attacks while maintaining low computational overhead. In this paper, we propose a fog-enabled network architecture integrated with IoT devices (Intra and Inter IoT device) and develop the DEAC-IoT scheme using Elliptic Curve Cryptography (ECC) for secure authentication and key agreement. Our protocol is designed to protect device-to-device communication from security threats in resource-constrained IoT environments. We validate DEAC-IoT’s security through both informal analysis and formal verification using the Real-Or-Random (RoR) model, demonstrating its resistance to major attacks. Simulation via the Scyther tool confirms that private parameters remain secure throughout the protocol’s execution. For practical feasibility, we implement DEAC-IoT on a Field Programmable Gate Array (FPGA) and conduct performance evaluations. The results show that our protocol surpasses existing protocols in both computational and communication efficiency, making it highly suitable for real-world IoT applications.

Efficient entanglement purification based on noise guessing decoding

In this paper, we propose a novel bipartite entanglement purification protocol built upon hashing and upon the guessing random additive noise decoding (GRAND) approach recently devised for classical error correction codes. Our protocol offers substantial advantages over existing hashing protocols, requiring fewer qubits for purification, achieving higher fidelities, and delivering better yields with reduced computational costs. We provide numerical and semi-analytical results to corroborate our findings and provide a detailed comparison with the hashing protocol of Bennet et al. Although that pioneering work devised performance bounds, it did not offer an explicit construction for implementation. The present work fills that gap, offering both an explicit and more efficient purification method. We demonstrate that our protocol is capable of purifying states with noise on the order of 10% per Bell pair even with a small ensemble of 16 pairs. The work explores a measurement-based implementation of the protocol to address practical setups with noise. This work opens the path to practical and efficient entanglement purification using hashing-based methods with feasible computational costs. Compared to the original hashing protocol, the proposed method can achieve some desired fidelity with a number of initial resources up to one hundred times smaller. Therefore, the proposed method seems well-fit for future quantum networks with a limited number of resources and entails a relatively low computational overhead.

Learning-based visibility prediction for terahertz communications in 6G networks

Terahertz communications are envisioned as a key enabler for 6G networks. The abundant spectrum available in such ultra high frequencies has the potential to increase network capacity to huge data rates. However, they are extremely affected by blockages, to the point of disrupting ongoing communications. In this paper, we elaborate on the relevance of predicting visibility between users and access points (APs) to improve the performance of THz-based networks by minimizing blockages, that is, maximizing network availability, while at the same time keeping a low reconfiguration overhead. We propose a novel approach to address this problem, by combining a neural network (NN) for predicting future user–AP visibility probability, with a probability threshold for AP reselection to avoid unnecessary reconfigurations. Our experimental results demonstrate that current state-of-the-art handover mechanisms based on received signal strength are not adequate for THz communications, since they are ill-suited to handle hard blockages. Our proposed NN-based solution significantly outperforms them, demonstrating the interest of our strategy as a research line.

A cost-effective and highly robust triple-node-upset self-recoverable latch design based on dual-output C-elements

With the continuous reduction of feature size of transistors, single-event triple-node-upsets (TNUs) induced by the striking of radiation particles in nano-scale CMOS circuits have emerged as a significant reliability concern. To address the shortcomings of existing radiation-hardened designs, including low reliability and high overhead, this paper proposes a cost-effective and highly robust TNU self-recovery latch design called DOCTRL. The proposed DOCTRL latch primarily consists of six dual-output C-elements (DOCs) and two clocked DOCs. By utilizing DOCs with two independent outputs, the proposed DOCTRL latch achieves a smaller area overhead. In addition, a four-level circular interlock matrix connection is designed to recover all possible TNUs within the proposed DOCTRL latch. Meanwhile, the latch also incorporates clock gating technology and a high-speed path to minimize power consumption and delay penalties. Simulation results indicate that the proposed DOCTRL reduces area by an average of 32.43 %, power consumption by 46.84 %, delay by 14.43 %, and area-power-delay product (APDP) by 69.55 %, compared to the five typical TNU self-recovery latches (SCLCRL, TNUSH, LCTNUCR, ADTRL, TSRL). Furthermore, detailed process, voltage, temperature (PVT), and Monte Carlo simulations verify the robustness of the proposed DOCTRL latch.

Blind Quantum Machine Learning with Quantum Bipartite Correlator.

Distributed quantum computing is a promising computational paradigm for performing computations that are beyond the reach of individual quantum devices. Privacy in distributed quantum computing is critical for maintaining confidentiality and protecting the data in the presence of untrusted computing nodes. In this Letter, we introduce novel blind quantum machine learning protocols based on the quantum bipartite correlator algorithm. Our protocols have reduced communication overhead while preserving the privacy of data from untrusted parties. We introduce robust algorithm-specific privacy-preserving mechanisms with low computational overhead that do not require complex cryptographic techniques. We then validate the effectiveness of the proposed protocols through complexity and privacy analysis. Our findings pave the way for advancements in distributed quantum computing, opening up new possibilities for privacy-aware machine learning applications in the era of quantum technologies.

A Blockchain-Based Privacy-Preserving Charging Station Reservation and Payment Scheme for Electric Vehicles

EV charging infrastructures traditionally rely on untrusted centralized infrastructures that pose several privacy and security threats to EVs’ personal information. Targeted advertisements, privacy leaks, selling data to third parties, are among the threats to privacy and security. By utilizing blockchain-based solutions, recent work address the security and privacy problems associated with EV charging protocols. Most of them are geared toward maintaining EV anonymity rather than preserving end-to-end privacy. As EV owners’ charging histories and payment information are associated with their wallet address on the blockchain, any threat of linkability of these blockchain addresses to physical identities can pose a serious risk to their privacy. In this paper, we propose a ring signature based privacy-preserving end-to-end charging station (CS) reservation and payment protocol, which provides EV owners with the ability to reserve and pay for a charging slot privately, without sharing private information or exposing their identity or addresses at CS locations. Additionally, we provide EV owners with a decentralized charging slot information verification protocol with the help of secure multiparty computation (SMC), which allows them to verify available slots. A dispute resolution mechanism is also proposed that handles disputes between EVs and CSs and penalizes them accordingly by utilizing trusted execution environment (TEE). Results show that the proposed protocol ensures end-to-end EV owners’ privacy with low blockchain transaction and computation overhead.

SEAIS: Secure and Efficient Agricultural Image Storage Combining Blockchain and Satellite Networks

The image integrity of real-time monitoring is crucial for monitoring crop growth, helping farmers and researchers improve production efficiency and crop yields. Unfortunately, existing schemes just focus on ground equipment and drone imaging, neglecting satellite networks in remote or extreme environments. Given that satellite internet features wide area coverage, we propose SEAIS, a secure and efficient agricultural image storage scheme combining blockchain and satellite networks. SEAIS presents the mathematical model of image processing and transmission based on satellite networks. Moreover, to ensure the integrity and authenticity of image data during pre-processing such as denoising and enhancement, SEAIS includes a secure agricultural image storage and verification method based on blockchain, homomorphic encryption, and zero-knowledge proof. Specifically, images are stored via IPFS, with hash values and metadata recorded on the blockchain, ensuring immutability and transparency. The simulation results show that SEAIS exhibits more stable and efficient processing times in extreme environments. Also, it maintains low on-chain storage overhead, enhancing scalability.