Search Results (23)

The Blockchain-Based Medical Insurance Transaction System (BMIT) developed in this study addresses key issues in traditional medical insurance—information silos, data tampering, and privacy breaches—through innovative blockchain architectural design and technical infrastructure reconstruction. Built on a consortium blockchain architecture with FISCO BCOS (Financial Blockchain Shenzhen Consortium Blockchain Open Source Platform) as the underlying platform, the system leverages FISCO BCOS’s distributed ledger, granular access control, and efficient consensus algorithms to enable multi-stakeholder on-chain collaboration. Four node roles and data protocols are defined: hospitals (on-chain data providers) generate 3D coordinate hashes of medical data via an algorithmically enhanced Bloom Filter for on-chain certification; patients control data access via blockchain private keys and unique parameters; insurance companies verify eligibility/claims using on-chain Bloom filters; the blockchain network stores encrypted key data (public keys, Bloom filter coordinates, and timestamps) to ensure immutability and traceability. A 3D-enhanced Bloom filter—tailored for on-chain use with user-specific hash functions and key control—stores only 3D coordinates (not raw data), cutting storage costs for 100 records to 1.27 KB and reducing the error rate to near zero ($1.77\%$ lower than traditional schemes for 10,000 entries). Three core smart contracts (identity registration, medical information certification, and automated verification) enable the automation of on-chain processes. Performance tests conducted on a 4-node consortium chain indicate a transaction throughput of 736 TPS (Transactions Per Second) and a per-operation latency of 181.7 ms, which meets the requirements of large-scale commercial applications. BMIT’s three-layer design (“underlying blockchain + enhanced Bloom filter + smart contracts”) delivers a balanced, efficient blockchain medical insurance prototype, offering a reusable technical framework for industry digital transformation. Full article

The exponential growth of multi-modal data in the real world poses significant challenges to efficient retrieval, and traditional single-modal methods are no longer suitable for the growth of multi-modal data. To address this issue, hashing retrieval methods play an important role in cross-modal retrieval tasks when referring to a large amount of multi-modal data. However, effectively embedding multi-modal data into a common low-dimensional Hamming space remains challenging. A critical issue is that feature redundancies in existing methods lead to suboptimal hash codes, severely degrading retrieval performance; yet, selecting optimal features remains an open problem in deep cross-modal hashing. In this paper, we propose an end-to-end approach, named Robust Supervised Deep Discrete Hashing (RSDDH), which can accomplish feature learning and hashing learning simultaneously. RSDDH has a hybrid deep architecture consisting of a convolutional neural network and a multilayer perceptron adaptively learning modality-specific representations. Moreover, it utilizes a non-redundant feature selection strategy to select optimal features for generating discriminative hash codes. Furthermore, it employs a direct discrete hashing scheme (SVDDH) to solve the binary constraint optimization problem without relaxation, fully preserving the intrinsic properties of hash codes. Additionally, RSDDH employs inter-modal and intra-modal consistency preservation strategies to reduce the gap between modalities and improve the discriminability of learned Hamming space. Extensive experiments on four benchmark datasets demonstrate that RSDDH significantly outperforms state-of-the-art cross-modal hashing methods. Full article

In response to the Cybersecurity Law, organizations face numerous management and technical requirements. Detection techniques such as vulnerability scanning and penetration testing are employed to identify risks. Addressing these vulnerabilities demands substantial manpower, time, and financial resources. Security concerns also arise during digital file transmission and remediation efforts. This study proposes a security detection platform with step-by-step implementation guidelines, enabling resource-limited units to replicate the setup and address security gaps. It compares detection results between open-source and commercial tools, highlighting key differences and offering remediation strategies. Numerous digital files (e.g., test reports) are generated during testing. To ensure secure storage and sharing, the system integrates IOTA’s distributed ledger and IPFS, generating HASH values and uploading files on-chain to preserve integrity and authenticity. The objective is to deliver a scalable, cost-effective security detection framework that enhances system resilience while minimizing resource consumption. Full article

Lunar-rover path planning is a key topic in lunar exploration research, with safety and computational efficiency critical for achieving long-distance planning. This paper proposes a distributed path-planning method that considers multiple lunar environmental factors, addressing the issues of inadequate safety considerations and low computational efficiency in current research. First, a set of safety evaluation rules is constructed by considering factors such as terrain slope, roughness, illumination, and rock abundance. Second, a distributed path-planning strategy based on a safety-map tile pyramid (DPPS-STP) is proposed, using a weighted A* algorithm with hash table-based open and closed lists (OC-WHT-A*) on a Spark cluster for efficient and safer path planning. Additionally, high-resolution digital orthophoto maps (DOM) are utilized for small crater detection, enabling more refined path planning built upon the overall mission-planning result. The method was validated in four lunar regions with distinct characteristics. The results show that DPPS-STP, which considers multiple environmental factors, effectively reduces the number of hazardous nodes and avoids crater obstacles. For long-distance tasks, it achieves an average speedup of up to 11.5 times compared to the single-machine OC-WHT-A*, significantly improving computational efficiency. Full article

Intelligent precision agriculture incorporates a number of Internet of Things (IoT) devices and drones to supervise agricultural activities and surroundings. The collected data are then forwarded to processing centers to facilitate crucial decisions. This can potentially help optimize the usage of agricultural resources and thwart disasters, enhancing productivity and profitability. To facilitate monitoring and decision, the smart devices in precision agriculture must exchange massive amounts of data across the open wireless communication channels. This inadvertently introduces a number of vulnerabilities, exposing the collected data to numerous security and privacy threats. To address these issues, massive security solutions have been introduced to secure the communication process in precision agriculture. However, most of the current security solutions either fail to offer perfect protection or are inefficient. In this paper, a scheme deploying efficient cryptographic primitives such as hashing, exclusive OR and random number generators is presented. We utilize the Burrows–Abadi–Needham (BAN) logic to demonstrate the verifiable security of the negotiated session keys. In addition, we execute an extensive semantic analysis which reveals the robustness of our scheme against a myriad of threats. Moreover, comparative performance evaluations demonstrate its computation overheads and energy consumption efficiency. Full article

Planetary photogrammetry remains an important technical means of producing high-precision planetary maps. High-quality control networks are fundamental to successful bundle adjustment. However, current software tools used by the planetary mapping community to construct and edit control networks exhibit very low efficiency. Moreover, redundant and invalid control points in the control network can further increase the time required for the bundle adjustment process. Due to a lack of targeted algorithm optimization, existing software tools and methods are unable to meet the photogrammetric processing requirements of massive planetary remote sensing images. To address these issues, we first proposed an efficient control network construction framework based on approximate orthoimage matching and hash quick search. Next, to effectively reduce the redundant control points in the control network and decrease the computation time required for bundle adjustment, we then proposed a control network-thinning algorithm based on a K-D tree fast search. Finally, we developed an automatic detection method based on ray tracing for identifying invalid control points in the control network. To validate the proposed methods, we conducted photogrammetric processing experiments using both the Lunar Reconnaissance Orbiter (LRO) narrow-angle camera (NAC) images and the Origins Spectral Interpretation Resource Identification Security Regolith Explorer (OSIRIS-REx) PolyCam images; we then compared the results with those derived from the famous open-source planetary photogrammetric software, the United States Geological Survey (USGS) Integrated Software for Imagers and Spectrometers (ISIS) version 8.0.0. The experimental results demonstrate that the proposed methods significantly improve the efficiency and quality of constructing control networks for large-scale planetary images. For thousands of planetary images, we were able to speed up the generation and editing of the control network by more than two orders of magnitude. Full article

The Internet of Vehicles (IoV) is an emerging technology that enables vehicles to communicate with their surroundings, provide convenient services, and enhance transportation systems. However, IoV networks can be vulnerable to security attacks because vehicles communicate with other IoV components through an open wireless channel. The recent related work suggested a two-factor-based lightweight authentication scheme for IoV networks. Unfortunately, we prove that the related work cannot prevent various security attacks, such as insider and ephemeral secret leakage (ESL) attacks, and fails to ensure perfect forward secrecy. To address these security weaknesses, we propose an anonymous and efficient authentication scheme with conditional privacy-preserving capabilities in IoV networks. The proposed scheme can ensure robustness against various security attacks and provide essential security features. The proposed scheme ensures conditional privacy to revoke malicious behavior in IoV networks. Moreover, our scheme uses only one-way hash functions and XOR operations, which are low-cost cryptographic operations suitable for IoV. We also prove the security of our scheme using the “Burrows–Abadi–Needham (BAN) logic”, “Real-or-Random (ROR) model”, and “Automated Validation of Internet Security Protocols and Applications (AVISPA) simulation tool”. We evaluate and compare the performance and security features of the proposed scheme with existing methods. Consequently, our scheme provides improved security and efficiency and is suitable for practical IoV networks. Full article

The periodontal ligament (PDL) is a highly specialized fibrous tissue comprising heterogeneous cell populations of an intricate nature. These complexities, along with challenges due to cell culture, impede a comprehensive understanding of periodontal pathophysiology. This study aims to address this gap, employing single-cell RNA sequencing (scRNA-seq) technology to analyze the genetic intricacies of PDL both in vivo and in vitro. Primary human PDL samples (n = 7) were split for direct in vivo analysis and cell culture under serum-containing and serum-free conditions. Cell hashing and sorting, scRNA-seq library preparation using the 10x Genomics protocol, and Illumina sequencing were conducted. Primary analysis was performed using Cellranger, with downstream analysis via the R packages Seurat and SCORPIUS. Seven distinct PDL cell clusters were identified comprising different cellular subsets, each characterized by unique genetic profiles, with some showing donor-specific patterns in representation and distribution. Formation of these cellular clusters was influenced by culture conditions, particularly serum presence. Furthermore, certain cell populations were found to be inherent to the PDL tissue, while others exhibited variability across donors. This study elucidates specific genes and cell clusters within the PDL, revealing both inherent and context-driven subpopulations. The impact of culture conditions—notably the presence of serum—on cell cluster formation highlights the critical need for refining culture protocols, as comprehending these influences can drive the creation of superior culture systems vital for advancing research in PDL biology and regenerative therapies. These discoveries not only deepen our comprehension of PDL biology but also open avenues for future investigations into uncovering underlying mechanisms. Full article

Blockchain, as a distributed trust database, has been widely applied in the field of trustworthy sharing of Internet of Things (IoT) sensor data. A single hash mechanism has achieved, to some extent, the trustworthy on-chain storage of blockchain sensor data, that is, the consistency of data on and off the chain. However, it still faces potential security risks such as collision attacks, short password attacks, and rainbow table attacks. To address this issue, this paper proposes a resiliently secure blockchain sensor data trustworthy sharing model based on a mimic hash mechanism. Specifically, in response to the security risks that may arise from the single hash mechanism, this study innovatively introduces a mimic hash mechanism and proposes two methods for constructing mimic hashes based on Verifiable Random Function (VRF) and Cyber Mimic Defense (CMD) in dedicated Wireless Sensor Networks (WSNs) and open public networks, respectively. Theoretical analysis and experimental results demonstrate that this model effectively solves the problem of trustworthy on-chain storage of sensor data in edge computing environments, enhancing the trustworthiness and security of the data on the chain. Full article

A paradigm that combines cloud computing and the Internet of Things (IoT) allows for more impressive services to be provided to users while addressing storage and computational resource issues in the IoT environments. This cloud-based IoT environment has been used in various industries, including public services, for quite some time, and has been researched in academia. However, various security issues can arise during the communication between IoT devices and cloud servers, because communication between devices occurs in open channels. Moreover, issues such as theft of a user’s IoT device or extraction of key parameters from the user’s device in a remote location can arise. Researchers interested in these issues have proposed lightweight mutual authentication key agreement protocols that are safe and suitable for IoT environments. Recently, a lightweight authentication scheme between IoT devices and cloud servers has been presented. However, we found out their scheme had various security vulnerabilities, vulnerable to insider, impersonation, verification table leakage, and privileged insider attacks, and did not provide users with untraceability. To address these flaws, we propose a provably secure lightweight authentication scheme. The proposed scheme uses the user’s biometric information and the cloud server’s secret key to prevent the exposure of key parameters. Additionally, it ensures low computational costs for providing users with real-time and fast services using only exclusive OR operations and hash functions in the IoT environments. To analyze the safety of the proposed scheme, we use informal security analysis, Burrows–Abadi–Needham (BAN) logic and a Real-or-Random (RoR) model. The analysis results confirm that our scheme is secure against insider attacks, impersonation attacks, stolen verifier attacks, and so on; furthermore, it provides additional security elements. Simultaneously, it has been verified to possess enhanced communication costs, and total bit size has been shortened to 3776 bits, which is improved by almost 6% compared to Wu et al.’s scheme. Therefore, we demonstrate that the proposed scheme is suitable for cloud-based IoT environments. Full article

Linear probing continues to be one of the best practical hashing algorithms due to its good average performance, efficiency, and simplicity of implementation. However, the worst-case performance of linear probing seems to degrade with high load factors due to a primary-clustering tendency of one collision to cause more nearby collisions. It is known that the maximum cluster size produced by linear probing, and hence the length of the longest probe sequence needed to insert or search for a key in a hash table of size n, is $\Omega \left(\log n\right)$, in probability. In this article, we introduce linear probing hashing schemes that employ two linear probe sequences to find empty cells for the keys. Our results show that two-way linear probing is a promising alternative to linear probing for hash tables. We show that two-way linear probing has an asymptotically almost surely $O\left(\log \log n\right)$ maximum cluster size when the load factor is constant. Matching lower bounds on the maximum cluster size produced by any two-way linear probing algorithm are obtained as well. Our analysis is based on a novel approach that uses the multiple-choice paradigm and witness trees. Full article

Recent advancements in memory technology have opened up a wealth of possibilities for innovation in data structures. The emergence of byte-addressable persistent memory (PM) with its impressive capacity and low latency has accelerated the adoption of PM in existing hashing-based indexes. As a result, several new hashing schemes utilizing emulators have been proposed. However, these schemes have proven to be suboptimal, lacking scalability when implemented on real devices. Only a handful of hash table designs have successfully addressed critical properties such as load factor, scalability, efficient memory utilization, and recovery. One of the main challenges in redesigning data structures for an effective hashing scheme in PM is minimizing the overhead associated with dynamic hashing operations in the hash table. To tackle this challenge, this paper introduces ESH, an efficient and scalable hashing scheme that significantly improves memory efficiency, scalability, and overall performance on PM. The ESH scheme maximizes the utilization of the hash table’s available space, thus reducing the frequency of full-table rehashing and improving performance. Consequently, this scheme achieves a high load factor while minimizing the need for rehashing. To evaluate the effectiveness of the ESH scheme, we compare it to widely used dynamic hashing schemes employing similar techniques on Intel Optane^® DC persistent memory (DCPMM). The experimental results demonstrate that ESH outperforms CCEH and Dash in terms of data insertion performance, exhibiting a 30% improvement over CCEH and a 4% improvement over Dash. Furthermore, ESH improves the lookup operation by nearly 10% compared to Dash, while achieving a load factor of up to 91%, surpassing its competitors. Full article

With the rapid advancement of network communication and big data technologies, the Internet of Things (IoT) has permeated every facet of our lives. Meanwhile, the interconnected IoT devices have generated a substantial volume of data, which possess both economic and strategic value. However, owing to the inherently open nature of IoT environments and the limited capabilities and the distributed deployment of IoT devices, traditional access control methods fall short in addressing the challenges of secure IoT data management. On the one hand, the single point of failure issue is inevitable for the centralized access control schemes. On the other hand, most decentralized access control schemes still face problems such as token underutilization, the insecure distribution of user permissions, and inefficiency.This paper introduces a blockchain-based access control framework to address these challenges. Specifically, the proposed framework enables data owners to host their data and achieves user-defined lightweight data management. Additionally, through the strategic amalgamation of smart contracts and hash-chains, our access control scheme can limit the number of times (i.e., n-times access) a user can access the IoT data before the deadline. This also means that users can utilize their tokens multiple times (predefined by the data owner) within the deadline, thereby improving token utilization while ensuring strict access control. Furthermore, by leveraging the intrinsic characteristics of blockchain, our framework allows data owners to gain capabilities for auditing the access records of their data and verifying them. To empirically validate the effectiveness of our proposed framework and approach, we conducted extensive simulations, and the experimental results demonstrated the feasibility and efficiency of our solution. Full article

The fusion of spatial data with blockchain technologies presents an innovative approach towards a decentralized, secure, and trustworthy framework for spatial information management. This integration brings spatial representation to the forefront of blockchain, opening avenues for various sectorial applications. However, challenges like slow processing times, restricted query capabilities, and consistency issues have been identified within the blockchain system. Addressing these challenges, we propose an optimized method for spatial queries by leveraging the high-performance capabilities of spatial databases. Unlike conventional off-chain query techniques, our approach synergistically combines hyperledger fabric with a specialized spatial database. This fusion facilitates distributed spatial queries within blockchain framework, incorporating spatial operation functionalities into smart contracts while preserving the distributed nature of nodes and spatial databases. Enhancing system security, we incorporate a dual-stage verification mechanism alongside a salt-hash storage strategy to counteract potential unauthorized alterations. Initial results validate the efficacy of our methodology in terms of performance and security. Building on this foundation, we introduce a rental transaction system that effectively merges spatial data with blockchain, demonstrating the feasibility and potential of integrating spatial information into the blockchain, especially in the realm of real estate. Full article

Automotive cyber-physical systems are in transition from the closed-systems to open-networking systems. As a result, in-vehicle networks such as the controller area network (CAN) have become essential to connect to inter-vehicle networks through the various rich interfaces. Newly exposed security concerns derived from this requirement may cause in-vehicle networks to pose threats to automotive security and driver’s safety. In this paper, to ensure a high level of security of the in-vehicle network for automotive CPS, we propose a novel lightweight and practical cyber defense platform, referred to as CANon (CAN with origin authentication and non-repudiation), to be enabled to detect cyber-attacks in real-time. CANon is designed based on the hierarchical approach of centralized-session management and distributed-origin authentication. In the former, a gateway node manages each initialization vector and session of origin-centric groups consisting of two more sending and receiving nodes. In the latter, the receiving nodes belonging to the given origin-centric group individually perform the symmetric key-based detection against cyber-attacks by verifying each message received from the sending node, namely origin authentication, in real-time. To improve the control security, CANon employs a one-time local key selected from a sequential hash chain (SHC) for authentication of an origin node in a distributed mode and exploits the iterative hash operations with randomness. Since the SHC can constantly generate and consume hash values regardless of their memory capacities, it is very effective for resource-limited nodes for in-vehicle networks. In addition, through implicit key synchronization within a given group, CANon addresses the challenges of a key exposure problem and a complex key distribution mechanism when performing symmetric key-based authentication. To achieve lightweight cyber-attack detection without imposing an additive load on CAN, CANon uses a keyed-message authentication code (KMAC) activated within a given group. The detection performance of CANon is evaluated under an actual node of Freescale S12XF and virtual nodes operating on the well-known CANoe tool. It is seen that the detection rate of CANon against brute-force and replay attacks reaches 100% when the length of KMAC is over 16 bits. It demonstrates that CANon ensures high security and is sufficient to operate in real-time even on low-performance ECUs. Moreover, CANon based on several software modules operates without an additive hardware security module at an upper layer of the CAN protocol and can be directly ported to CAN-FD (CAN with Flexible Data rate) so that it achieves the practical cyber defense platform. Full article