Vehicular misbehavior detection faces multiple technical challenges, including machine learning-adaptive attacks and trust management issues. A critical concern is the problem of malicious vehicle with high-reputation, in which malicious vehicles exploit trust-based security by maintaining legitimate behavioral profiles while strategically injecting malicious content. This behavior creates systemic vulnerabilities that compromise network trust infrastructures. Attacks affecting high-reputation malicious behavior detection include both external and internal types, requiring holistic defense mechanisms. However, current vehicular security research lacks unified defense against both internal and external attacks. Typically, studies that effectively resist internal attackers demonstrate the weaker defense against external attacks, and vice versa. To mitigate these concerns, we have designed a Training Verdict Autonomous Vehicle Networks architecture (TV-AVN) that develops a novel Verdict Misbehavior Detection System (V-MDS) by combining machine learning with reputation mechanism. The proposed scheme incorporates a public key cryptosystem to enhance security during basic safety message transmission. A local authority regularly consolidates detection outcomes to update vehicle reputation scores. In comprehensive experimental comparisons, our approach demonstrates robust-level security performance, with formal verification tools validating the security robustness of our proposed mechanism. For position falsification attacks, our method achieves average detection performance of 0.99 Precision , 0.98 Recall , and 0.98 F 1- score . Moreover, the proposed approach demonstrates superior resilience against intelligent attacks involving high-reputation attackers. Although the detection performance experiences degradation, our method remains more stable than existing approaches, which suffer rapid deterioration. In summary, TV-AVN establishes reliable communication for vehicle users, maintaining long-term network quality and preserving user confidence in the system.

Traditionally, industrial control systems operate in isolated networks with proprietary solutions. As smart factories and digital twins have become inevitable with AI advancement, the rapid adoption of Industrial Internet of Things (IIoT) devices has significantly increased cybersecurity risks. More precisely, the complexity of industrial environments, which includes production processes and device roles, creates substantial challenges for secure deployment. The authors introduce a bottom-up, industrial role-oriented verification framework (IROVF) for manufacturing line deployment. IROVF incorporates SCADA's MTU and RTU components, which are mapped to distinct device roles. This provides authentication and least-privilege principles that are tailored to factory environments. The proposed framework designs an alarm strategy, which can be helpful to detect and report potential operational disruptions during runtime, thus minimizing impact on system availability. Experimental results demonstrate the superior security coverage of the proposed framework compared to existing research, while a comprehensive application scenario validates its practical applicability. The scalable security parameters of IROVF allow organizations to select appropriate security levels based on their specific requirements. IROVF provides an effective security solution for modern industrial control systems during deployment phases.

Zero-trust architecture has received massive attention globally and been a significant development in the field of cybersecurity. Within zero-trust architecture, the continuous authentication (CA) strategy has been proposed to counter the network security threats posed by traditional static authentication mechanisms. However, most studies have focused on either device-to-device authentication or user authentication. This limitation results in risks of identity spoofing or credential theft despite the implementation of the CA mechanism, thus concluding the parity in significance between authenticating users and devices. Furthermore, considering the CA of users, it is essential to face the issue posed by user authentication fatigue. In response to these challenges, this work aims to introduce an unconsciously CA protocol (UCAP) based on zero-trust concepts and behavior biometrics. UCAP utilizes the behavior of keystroke dynamics as a main factor in consistently evaluating the user trust level. This method enables the continual updating of communication keys to preserve robust authentication of both devices and users. The robustness of UCAP has been examined through formal tools, while the experimental outcomes have shown satisfactory performance.

Traditional industries rapidly transcend the time and place restrictions of the country according to the technology growth by leaps and bounds over the year. Regrettably, international cybercrime incidents simultaneously explode by 2,400 million from 2020 to 2021. Undoubtedly, the real-time incident response has become the primary subject of incident handling. In this article, we aim to propose lawful remote forensics mechanism for ensuring the optimal protection of potential evidence in stochastic and unpredictable transnational crime. Meanwhile, the entire process can be performed remotely and compliant with legal requirements, such as ISO/IEC and NIST regulations. Specifically, all the procedures can be retroactive based on the design of the chain of custody, which leads to the proof of evidence admissibility. Aside from the security essential confirmation by the formal tools Proverif, AVISPA, and Scyther, simulation results have demonstrated that remote forensics can fulfill the legal requirements and perform excellently in various incident scales.

The utilization of cloud and edge computing has become one of the most prevailing resource supply mechanisms. Thousands of enterprise users and Internet of Things (IoT) devices have performed operations through services sold by computing resource providers. So far, the auction match is the main strategy for allocating resources, in which there exists a trusted third party playing a role as a broker to deal with resource allocation requests for both providers and consumers. The main concerns in resource allocation architecture are how and how long to solve the Winner Determination Problem (WDP), which is used to lay out the match outcome. It is not easy for a single broker with limited computing power to generate an optimal solution in a short period since its corresponding time complexity is regarded as the NP-hard problem. Meanwhile, it is hard for people to trust the third party thoroughly. That is, there are three potential issues, including centralization, data security, and untrustworthiness in traditional matching architecture. In particular, the real-time matching cannot be achieved to fulfill users who have urgent needs of computing resources. To solve above issues, we have designed a trustworthy and real-time decentralized computing resource allocation platform based on blockchain and smart contract. In order to optimize the allocation results, we improve the Non-dominated Sorting Genetic Algorithm II (NSGA-II) for miners to reach the consensus mechanism. Experimental results and comparison analysis have demonstrated that potential defects could be addressed in the new method, and the real-time resource allocation can be preserved firmly despite the balance vibration of market supply and demand.

The internet of things (IoT) has brought the properties of convenience, intelligence, and manageability into our daily lives. Nevertheless, it also gives malicious attackers lots of opportunity to compromise our private information. Hence, the security issue over IoT has become an emergent and crucial research topic. Kalra and Sood (2015) proposed an authentication scheme for IoT device and cloud server. Unfortunately, Chang et al. (2017) have pointed out the weaknesses of Kalra and Sood's scheme and provided proper improvements. However, we have found that the improved version still exist potential risks. Thus, we aim to develop a brand-new ECC-based authentication mechanism for offering a secure session between an IoT device and a cloud server. In particular, the new method is proved secure under the examination of AVISPA, which is a formal verification tool.

The preservation of classical archives is an essential task in the digitization of culture. So far, there remain two crucial challenges in archiving treasurable but aged image records. The first one is to eliminate a large-scale smudge located in a smooth ground, while the second one is to improve the readability of text content. Undoubtedly, the quality of an aged image is always degraded by antiquated smears, and the same situation occurs to obscure the content of a text image. In this paper, the authors apply the concept of patch propagation to help renovating contaminative images and introduce an adaptive confidence collation strategy to avoid the phenomenon of error diffusion, which often results in serious distortion in repairing. Furthermore, the techniques of Canny detection and center-weighted median filter are adopted in the proposed mechanism to refine the blurry target. In particular, the obscured text of aged images can be improved in the new mechanism, while it is seldom concerned in related works.

ABSTRACT Vehicle ad hoc networks are self‐configurable networks with dynamic topologies. All involved nodes in vehicle ad hoc networks, including vehicles and roadside devices, have to share the responsibility for achieving handover operation and providing communication services. Such networks are more vulnerable to the malicious attacks than traditional wireless networks because of the shortage of the fixed infrastructure. Moreover, because the vehicles always move from one area to another very quick, how to handle the handover between roadside devices has become a crucial challenge in designing the system. For providing secure and seamless communications in such networks, we develop a robust and fast handover mechanism. We have conducted essential experiments to demonstrate the superiority of the new mechanism to other works. In particular, we have applied the BAN logic model to prove the correctness of mutual authentication between involved participants. Copyright © 2013 John Wiley & Sons, Ltd.

The lottery game has been around for centuries and gained the attention of thousands of individuals because of the chance of making a big fortune. It is often launched by a national institute or a legitimate organisation for gathering funds or raising charity monies. In this study, the authors aim to design a new, electronic lottery (e‐lottery) system based on Aryabhata remainder theorem, which can help realise e‐lottery games. In particular, the new mechanism can guarantee the security of this popular game involving the potential for a lot of money.

ABSTRACT Along with widespread information communication technology, digital management has been applied to a variety of fields. Considering the rapidly growing importance of medical treatment, for which medical record management plays a crucial role, it is time to make full use of digital techniques in the medical field. Doctors in different departments and locations can check the electronic records of patients without complex steps and can even consult together via the Internet. In this paper, we design a hierarchical–object–relational management system for electronic records (HORME). HORME can not only achieve the essentials of traditional paper‐based record but can also satisfy the requirements of privacy and security according to the factorization problem, which makes it possible to protect the right of the legal doctors, patients, and hospitals. Copyright © 2013 John Wiley & Sons, Ltd.

Fragile watermarking is applied to protect the content integrity of digital images. The main concerns related to watermarking include retaining the quality of the watermarked image and retaining the ability to detect whether any manipulation has occurred. Because recent watermarking techniques seriously distort the quality of the protected image after embedding the authentication code into the image content, attention has been drawn to how to satisfy both the need for image fidelity and detection ability. To account for the influence from both essentials, a novel algorithm is proposed in this article. The new scheme utilizes a weighted-sum function to embed ( n + 1) authentication bits into a block with 2 n pixels by modifying only one original pixel with (±1). With fewer authentication codes, the new process can protect the content of the image. The experimental results demonstrate that the approach can guarantee the fidelity of the watermarked image while retaining tamper-proof functionality.

Unlike gambling, lottery games can exist in a lawful form to raise funds for charitable institutions. Owing to the expeditious development of network technology, lotteries over the Internet have become an inevitable trend. Since the Internet allows people to communicate with each other without direct contact, it is more difficult to guarantee the security and fairness of online lotteries than for conventional lottery games. However, electronic lottery methods can also provide something that conventional lottery mechanisms cannot: they allow players to purchase tickets at any time and in any place where they can access the Internet. The authors propose an online lottery mechanism that can confirm the propositions of general lottery games. Specifically, this novel method not only allows players to make t-out-of-n numbers in lotteries without iterative selection but also preserves the privacy of players' choices, making the system more similar to traditional lottery games.

Content digitization transforms a source into its digital form through digital cameras or scanners. This transformation often leads to the irregular distribution of image illumination, which may distort the quality of digital images. Engineers have provided many mechanisms to solve the degradation problem; however, these works mainly focus on dealing with full text images. In this letter, we propose a novel method to balance the illumination distribution of the transformed image. Experimental results show that the new method is capable of improving the quality of degraded text images. Particularly, unlike related works, the new method can effectively adjust the illumination distribution of a text-photo image to enhance the image quality.

This paper presents a novel dual watermarking mechanism for digital media that embeds a recognizable pattern into the spatial domain and an invisible logo into the frequency domain. Undoubtedly, visible watermarking is important for protecting online resources from unauthorized reproduction. Due to the visibility of embedded patterns, however, watermarked digital media are vulnerable to the inpainting attack and common signal processing operations. Utilizing hybrid strategies, simulation results show that the novel method can resist these attacks. In particular, the new mechanism allows legal subscribers to restore an unmarked image, whereas other dual watermarking schemes do not. This feature makes it suitable for protecting artistic and valuable media.

Abstract Since the early 1990s, engineers have proposed many mechanisms for providing confidential communications and data integrity in mobilead hocnetworks (MANET). The deficiency of fastened infrastructure makes mobilead hocnetworks more vulnerable to security threats than conventional wireless networks. MANET can be considered as a short‐lived collection of mobile nodes that communicate with each other in between. All involved nodes in the network system share the responsibility for routing, accessing, and communicating. The main challenges on the design of MANET include high power saving and low bandwidth. The public key infrastructure (PKI) is a well‐known mechanism used to provide data integrity and confidential communications in MANET recently. The computation loads of PKI, however, are heavy to each mobile node in the cluster. Without adopting PKI cryptosystems to en/decrypt messages, we propose a novel version based on a variant Diffie‐‐Hellman protocol. The novel method can preserve the forward and backward secrecy of group communications. Specifically, the new method outperforms related works in the computation overheads of involved nodes while communicating with other nodes. Copyright © 2008 John Wiley & Sons, Ltd.

Most computers are linked together such that facilities can be shared through the connection of networks. However, resources provided by remote servers over the Internet are not free for all users. If someone wants to access facilities from certain remote server, he/she has to pay for the access request. On the other hand, providers of the facilities have to make their resources accessible under appropriate protection. The combination of password authentication scheme and key agreement mechanism is a practical solution for validating remote users and providing secure communications between a remote system and login users. Without loss of generality, users who want to access a remote server must pass several examinations in the process of authentication. Only after users are authorized by the remote system, they can have the access right to resources provided by the remote server and share a session key with the remote system to ensure the following communications; otherwise, the remote system can reject their access requests. Researchers have proposed lots of password authentication schemes to improve the authentication efficiency and security, so that password authentication has become a popular research topic recently. Employing a time-bounded mechanism, this article describes a novel version which not only achieves the requirements of general password authentication schemes but also allows the remote system to effectively conduct the valid access phase of each legitimate user.

With the rapid growth of computer networks and communication technologies, more and more computers are linked together such that facilities can be shared through the networks. However, most resources provided by the servers over the Internet are not free for all users. Therefore, providers of the facilities have to make resources under appropriate protection. The password authentication schemes are usually regarded as the most efficient and practical ones to protect the resources of the remote servers. Nevertheless, most of the proposed password schemes are only designed for the single-server environment, the user who wants to access from the different servers needs to register many times. In 2004, Juang proposed an authentication scheme for multiserver architecture. However, Juang's scheme lacks efficiency. In this article, we propose a more efficient and secure authentication scheme for multiserver architecture such that it can be applied in the real world.