Enhancing Security in QR Code Technology Using AI: Exploration and Mitigation Strategies

The widespread adoption of QR codes has revolutionized various industries, streamlined transactions and improved inventory management. However, this increased reliance on QR code technology also exposes it to potential security risks that malicious actors can exploit. QR code Phishing, or “Quishing”, is a type of phishing attack that leverages QR codes to deceive individuals into visiting malicious websites or downloading harmful software. These attacks can be particularly effective due to the growing popularity and trust in QR codes. This paper examines the importance of enhancing the security of QR codes through the utilization of artificial intelligence (AI). The abstract investigates the integration of AI methods for identifying and mitigating security threats associated with QR code usage. By assessing the current state of QR code security and evaluating the effectiveness of AI-driven solutions, this research aims to propose comprehensive strategies for strengthening QR code technology’s resilience. The study contributes to discussions on secure data encoding and retrieval, providing valuable insights into the evolving synergy between QR codes and AI for the advancement of secure digital communication.

Artificial Noise Aided Polar Codes for Physical LayerSecurity

The secrecy rates of the existing practical secrecy coding methods are relative low to satisfy the security requirement of 5 G communications.We propose an artificial noise(AN) aided polar coding algorithm to improve the secrecy rate.Firstly,a secrecy coding model based on AN is presented,where the confidential bits of last transmission code block are adopted as AN to inject into the current codeword.In this way,the AN can only be eliminated from the jammed codeword by the legitimate users.Since the AN is shorter than the codeword,we then develop a suboptimal jamming positions selecting algorithm with the goal of maximizing the bit error rate of the eavesdropper.Theoretical and simulation results demonstrate that the proposed algorithm outperforms the random selection method and the method without AN.

Proof of Activity Protocol for IoMT Data Security

The Internet of Medical Things(IoMT)is an online device that senses and transmits medical data from users to physicians within a time interval.In,recent years,IoMT has rapidly grown in the medicalfield to provide healthcare services without physical appearance.With the use of sensors,IoMT applications are used in healthcare management.In such applications,one of the most important factors is data security,given that its transmission over the network may cause obtrusion.For data security in IoMT systems,blockchain is used due to its numerous blocks for secure data storage.In this study,Blockchain-assisted secure data management framework(BSDMF)and Proof of Activity(PoA)protocol using malicious code detection algorithm is used in the proposed data security for the healthcare system.The main aim is to enhance the data security over the networks.The PoA protocol enhances high security of data from the literature review.By replacing the malicious node from the block,the PoA can provide high security for medical data in the blockchain.Comparison with existing systems shows that the proposed simulation with BSD-Malicious code detection algorithm achieves higher accuracy ratio,precision ratio,security,and efficiency and less response time for Blockchain-enabled healthcare systems.

Secure Transmission in Downlink Non-Orthogonal Multiple Access Based on Polar Codes

Non-orthogonal multiple access(NOMA)is deemed to have a superior spectral efficiency and polar codes have became the channel coding scheme for control channel of enhanced mobile broadband(eMBB)in the fifth generation(5G)communication systems.In this paper,NOMA combined with polar codes is used to achieve secure transmission.Both degraded wiretap channel and non-degraded wiretap channel are considered,where an eavesdropper intercepts the communication between base station(BS)and users.For the degraded wiretap channel scenario,a secure polar encoding scheme is proposed in NOMA systems with power allocation to achieve the maximum secrecy capacity.With regard to the nondegraded wiretap channel,a polar encoding scheme with multiple-input-single-output(MISO)system is proposed,where artificial noise is generated at BS to confuse the eavesdropper’s channel via transmit beamforming.The security and the secure rate are employed respectively in order to measure the secrecy performance.We prove that the proposed schemes for each scenario can achieve the secure rate and can transmit the signal securely and reliably.The simulation results show that the eavesdropper hardly decoding the secure signal when the legitimate receiver can decode the signal with very low block error rate(BLER).

Code mechanical solidification and verification in MEMS security devices

The virtual machine of code mechanism （VMCM） as a new concept for code mechanical solidification and verification is proposed and can be applied in MEMS （micro-electromechanical systems） security device for high consequence systems. Based on a study of the running condition of physical code mechanism, VMCM＇s configuration, ternary encoding method, running action and logic are derived. The cases of multi-level code mechanism are designed and verified with the VMCM method, showing that the presented method is effective.

Henon CSK Secure Communication System Using Chaotic Turbo Codes

In this paper, the authors design a novel chaotic secure communication system, which has high security and good error correcting capability. Firstly, the Henon Chaos Shift Keying (CSK) modulation block is presented. Secondly, chaotic turbo encoder/decoder (hard decision) is introduced. Thirdly, this chaotic secure communication system, which comprises the Henon CSK modulation block and chaotic turbo encoder in a serially concatenated form, is shown. Furthermore, a novel two step encryption scheme is proposed, which is based on the chaotic turbo encoded Henon CSK secure communication system.

A Cross Language Code Security Audit Framework Based on Normalized Representation

With the rapid development of information technology,audit objects and audit itself are more and more inseparable from software.As an important means of software security audit,code security audit will become an important aspect of future audit that cannot be ignored.However,the existing code security audit ismainly based on source code,which is difficult to meet the audit needs of more and more programming languages and binary commercial software.Based on the idea of normalized transformation,this paper constructs a cross language code security audit framework(CLCSA).CLCSA first uses compile/decompile technology to convert different highlevel programming languages and binary codes into normalized representation,and then usesmachine learning technology to build a cross language code security audit model based on normalized representation to evaluate code security and find out possible code security vulnerabilities.Finally,for the discovered vulnerabilities,the heuristic search strategy will be used to find the best repair scheme from the existing normalized representation sample library for automatic repair,which can improve the effectiveness of code security audit.CLCSA realizes the normalized code security audit of different types and levels of code,which provides a strong support for improving the breadth and depth of code security audit.

网络环境下基于Erasure Codes的高可靠性存储体系设计

设计了一种基于Erasure Codes的网络环境下的分布式文件存储系统。初步的实验结果证明这种存储体系可以较好地解决人们当前所面临的文件存储的可靠性、安全性等问题。

Physical Layer Security with Its Applications in 5GNetworks： A Review

5G network is expected to support massive user connections and exponentially increasing wireless services,which makes network security unprecedentedly important.Unlike traditional security-guaranteeing techniques which rely heavily on cryptographic approaches at upper layers of the protocol stack,physical-layer security(PLS) solutions fully take advantages of the characteristics of wireless channels to degrade the received signal qualities at the malicious users,and realize keyless secure transmission via signal design and signal processing techniques.PLS avoids the difficulties in the distribution and management of secret keys,and provides flexible security levels through adaptive transmission protocol design.Moreover,PLS techniques match the features of 5G networks well.Therefore,the application of PLS to 5G networks is a promising solution to address the security threats.This article presents a comprehensive review of the state-of-the-art PLS techniques,and discusses their applications in 5G networks.We first summarize the principle and advantages of PLS techniques,and point out the reasons why PLS is suitable for 5G networks.Then,we review the existing PLS methods in literature,and highlight severalPLS solutions that are expected to be applied in 5G networks.Finally,we conclude this article and figure out some further research directions.

Maximum two-dimensional (u×v,4,1,3)-OOCs

Let Ф（u ×v, k, Aa, Ac） be the largest possible number of codewords among all two- dimensional （u ×v, k, λa, λc） optical orthogonal codes. A 2-D （u× v, k, λa, λ）-OOC with Ф（u× v, k, λa, λc） codewords is said to be maximum. In this paper, the number of codewords of a maximum 2-D （u × v, 4, 1, 3）-OOC has been determined.

Multiple bit upsets mitigation in memory by using improved hamming codes and parity codes

This paper combines improved Hamming codes and parity codes to assure the reliability of memory in presence of multiple bit upsets with low cost overhead.The redundancy bits of improved Hamming codes will be appended at the end of data bits,which eliminates the overhead of interspersing the redundancy bits at the encoder and decoder.The reliability of memory is further enhanced by the layout architecture of redundancy bits and data bits.The proposed scheme has been implemented in Verilog and synthesized using the Synopsys tools.The results reveal that the proposed method has about 19% less area penalties and 13% less power consumption comparing with the current two-dimensional error codes,and its latency of encoder and decoder is 63% less than that of Hamming codes.

Reversible Video Steganography Using Quick Response Codes and Modified ElGamal Cryptosystem

The rapid transmission of multimedia information has been achieved mainly by recent advancements in the Internet’s speed and information technology.In spite of this,advancements in technology have resulted in breaches of privacy and data security.When it comes to protecting private information in today’s Internet era,digital steganography is vital.Many academics are interested in digital video because it has a great capability for concealing important data.There have been a vast number of video steganography solutions developed lately to guard against the theft of confidential data.The visual imperceptibility,robustness,and embedding capacity of these approaches are all challenges that must be addressed.In this paper,a novel solution to reversible video steganography based on Discrete Wavelet Transform(DWT)and Quick Response(QR)codes is proposed to address these concerns.In order to increase the security level of the suggested method,an enhanced ElGamal cryptosystem has also been proposed.Prior to the embedding stage,the suggested method uses the modified ElGamal algorithm to encrypt secret QR codes.Concurrently,it applies two-dimensional DWT on the Y-component of each video frame resulting in Approximation(LL),Horizontal(LH),Vertical(HL),and Diagonal(HH)sub-bands.Then,the encrypted Low(L),Medium(M),Quantile(Q),and High(H)QR codes are embedded into the HL sub-band,HHsub-band,U-component,and V-component of video frames,respectively,using the Least Significant Bit(LSB)technique.As a consequence of extensive testing of the approach,it was shown to be very secure and highly invisible,as well as highly resistant to attacks from Salt&Pepper,Gaussian,Poisson,and Speckle noises,which has an average Structural Similarity Index(SSIM)of more than 0.91.Aside from visual imperceptibility,the suggested method exceeds current methods in terms of Peak Signal-to-Noise Ratio(PSNR)average of 52.143 dB,and embedding capacity 1 bpp.

Homomorphic Hashing Verification for Wireless Sensor Networks Rateless Codes Over-the-Air Programming

The homomorphic hash algorithm(HHA)is introduced to help on-the-fly verify the vireless sensor network(WSN)over-the-air programming(OAP)data based on rateless codes.The receiver calculates the hash value of a group of data by homomorphic hash function,and then it compares the hash value with the receiving message digest.Because the feedback channel is deliberately removed during the distribution process,the rateless codes are often vulnerable when they face security issues such as packets contamination or attack.This method prevents contaminating or attack on rateless codes and reduces the potential risks of decoding failure.Compared with the SHA1 and MD5,HHA,which has a much shorter message digest,will deliver more data.The simulation results show that to transmit and verify the same amount of OAP data,HHA method sends 17.9% to 23.1%fewer packets than MD5 and SHA1 under different packet loss rates.

Development of Hybrid ARQ Protocol for the Quantum Communication System on Stabilizer Codes

In this paper,we develop a novel hybrid automatic-repeat-request(ARQ)protocol for the quantum communication system using quantum stabilizer codes.The quantum information is encoded by stabilizer codes to against the channel noise.The twophoton entangled state is prepared for codeword secure transmission.Hybrid ARQ protocol rules the recognition and retransmission of error codewords.In this protocol,the property of quantum entangled state ensures the security of information,the theory of hybrid ARQ system improves the reliability of transmission,the theory of quantum stabilizer codes corrects the flipping errors of codewords.Finally,we verify the security and throughput efficiency of this protocol.

A Security Sensitive Function Mining Approach Based on Precondition Pattern Analysis

Security-sensitive functions are the basis for building a taint-style vulnerability model.Current approaches for extracting security-sensitive functions either don’t analyze data flow accurately,or not conducting pattern analyzing of conditions,resulting in higher false positive rate or false negative rate,which increased manual confirmation workload.In this paper,we propose a security sensitive function mining approach based on preconditon pattern analyzing.Firstly,we propose an enhanced system dependency graph analysis algorithm for precisely extracting the conditional statements which check the function parameters and conducting statistical analysis of the conditional statements for selecting candidate security sensitive functions of the target program.Then we adopt a precondition pattern mining method based on conditional statements nomalizing and clustering.Functions with fixed precondition patterns are regarded as security-sensitive functions.The experimental results on four popular open source codebases of different scales show that the approach proposed is effective in reducing the false positive rate and false negative rate for detecting security sensitive functions.

Security Analysis of Subspace Network Coding

This paper analyzed the security of constant dimensional subspace code against wiretap attacks. The security was measured in the probability with which an eavesdropper guessed the source message successfully. With the methods of linear algebra and combinatorics, an analytic solution of the probability was obtained. Performance of subspace code was compared to several secure network coding schemes from the perspective of security, flexibility, complexity, and independence, etc. The comparison showed subspace code did not have perfect security, but it achieved probabilistic security with low complexity. As a result, subspace code was suitable to the applications with limited computation and moderate security requirement.

C3SM: Information Assurance Based on Cryptographic Checksum with Clustering Security Management Protocol

Wireless Sensor Networks (WSNs) are resource-constrained networks in which sensor nodes operate in an aggressive and uncontrolled environment and interact with sensitive data. Traffic aggregated by sensor nodes is susceptible to attacks and, due to the nature of WSNs, security mechanisms used in wired networks and other types of wireless networks are not suitable for WSNs. In this paper, we propose a mechanism to assure information security against security attacks and particularly node capturing attacks. We propose a cluster security management protocol, called Cryptographic Checksum Clustering Security Management (C3SM), to provide an efficient decentralized security management for hierarchal networks. In C3SM, every cluster selects dynamically and alternately a node as a cluster security manager (CSM) which distributes a periodic shared secrete key for all nodes in the cluster. The cluster head, then, authenticates identity of the nodes and derive a unique pairwise key for each node in the cluster. C3SM provides sufficient security regardless how many nodes are compromised, and achieves high connectivity with low memory cost and low energy consumption. Compared to existing protocols, our protocol provides stronger resilience against node capture with lower key storage overhead.

Emergence of Plastidial Intergenic Spacers as Suitable DNA Barcodes for Arid Medicinal Plant <i>Rhazya stricta</i>

The desert plant Rhazya stricta has anticancer and antimicrobial properties, and is widely used in indigenous medicines of Saudi Arabia. However, the therapeutic benefits rely on an accurate identification of this species. The authenticity of R. stricta and other medicinal plants and herbs procured from local markets can be questionable due to a lack of clear phenotypic traits. DNA barcoding is an emerging technology for rapid and accurate species identification. In this study, six candidate chloroplastid barcodes were investigated for the authentication of R. stricta. We compared the DNA sequences from fifty locally collected and five market samples of R. stricta with database sequences of R. stricta and seven closely related species. We found that the coding regions matK, rbcL, rpoB, and rpoC1 were highly similar among the taxa. By contrast, the intergenic spacers psbK-psbI and atpF-atpH were variable loci distinct for the medicinal plant R. stricta. psbK-psbI clearly discriminated R. stricta samples as an efficient single locus marker, whereas a two-locus marker combination comprising psbK-psbI + atpF-atpH was also promising according to results from the Basic Local Alignment Search Tool and a maximum likelihood gene tree generated using PHyML. Two-dimensional DNA barcodes (i.e., QR codes) for the psbK-psbI and psbK-psbI + atpF-atpH regions were created for the validation of fresh or dried R. stricta samples.

Security in Multicast Over α-μ Fading Channels with Orthogonal Frequency Division Multiplexing

The orthogonal space-frequency block coding (OSFBC) with orthogonal frequency division multiplexing (OFDM) system reduces complexity in the receiver which improves the system performance significantly. Motivated by these advantages of OSFBC-OFDM system, this paper considers a secure wireless multicasting scenario through multiple-input multiple-output (MIMO) OFDM system employing OSFBC over frequency selective α-μ fading channels. The authors are interested to protect the desired signals from eavesdropping considering the impact of the number of multicast users and eavesdroppers, and the fading parameters α and μ. A mathematical model has been developed based on the closed-form analytical expressions of the probability of non-zero secrecy multicast capacity (PNSMC) and the secure outage probability for multi-casting (SOPM) to ensure the security in the presence of multiple eaves-droppers. The results show that the security in MIMO OSFBC OFDM system over α-μ fading is more sensitive to the magnitude of α and μ and this effect increases in the high signal-to-noise ratio (SNR) region of the main channel.

Implementation of an Efficient Light Weight Security Algorithm for Energy-Constrained Wireless Sensor Nodes

In-network data aggregation is severely affected due to information in transmits attack. This is an important problem since wireless sensor networks (WSN) are highly vulnerable to node compromises due to this attack. As a result, large error in the aggregate computed at the base station due to false sub aggregate values contributed by compromised nodes. When falsified event messages forwarded through intermediate nodes lead to wastage of their limited energy too. Since wireless sensor nodes are battery operated, it has low computational power and energy. In view of this, the algorithms designed for wireless sensor nodes should be such that, they extend the lifetime, use less computation and enhance security so as to enhance the network life time. This article presents Vernam Cipher cryptographic technique based data compression algorithm using huff man source coding scheme in order to enhance security and lifetime of the energy constrained wireless sensor nodes. In addition, this scheme is evaluated by using different processor based sensor node implementations and the results are compared against to other existing schemes. In particular, we present a secure light weight algorithm for the wireless sensor nodes which are consuming less energy for its operation. Using this, the entropy improvement is achieved to a greater extend.