Message Confidentiality Research Articles

Robust cryptographic scheme for reliable data communication in VANET (RCSRC) using clustering approach

In contemporary times, as accident rates continue to rise, there is a growing interest in vehicular ad hoc networks (VANETs) as a means to reduce accidents and vehicle damage, as well as enhance public safety. VANETs facilitate the transmission of messages within predefined areas to ensure system safety and efficiency. However, ensuring message authenticity in such a dynamic environment presents a significant challenge, with previous research focusing less on security aspects. Some previous protocols send plain message, which leads to the compromise of the message confidentiality. Although few algorithms work on security, they involve the communication to the trusted authority, which lead to increased latency. Thus, in this paper we propose a robust cryptographic scheme for reliable data communication in VANET which minimizes the involvement of trusted authority and uses communication ID of vehicle for communication in place of real entities. Security analysis of the proposed scheme is showing the sturdiness of the proposed protocol again various types of safety spasms. The evaluation of its performance includes assessing communication cost and time, revealing the proposed algorithm's efficiency compared to others.

Enhanced Dual-Layer Video Steganographic Approach: Enhancing Security and Imperceptibility

In a digital age where the role of digital information is continually expanding, the imperative to ensure secure communication and data protection has intensified. Steganography, a field that conceals sensitive information within apparently innocuous carriers like multimedia files, holds promise for achieving this goal. Recent times have seen a growing interest in video-based steganography, driven by the proliferation of videos online. However, a review has unveiled a noteworthy gap in efforts to increase the safety of video steganography employing the popular Least Significant Bit (LSB) process. LSB steganography is at risk to exploits that could jeopardize the confidentiality of the concealed message. In this research, we present a video steganographic solution achieved through the integration of advanced encryption algorithms and a dual approach involving randomized frame selection using the Fisher-Yates method and pixel selection utilizing the 8-directional technique. Additionally, we have devised an upgraded imperceptible video steganographic approach in the spatial domain, capitalizing on an XOR-based LSB substitution embedding approach. The outcomes underscore the effectiveness of our proposed methodology, revealing significant imperceptibility when compared to recent solutions, thereby reinforcing data security against unauthorized access. This comprehensive solution holds wide-ranging applications across various domains, providing heightened security and confidentiality for sensitive information. Notable applications include secure communications within intelligence agencies, safeguarding patient data in medical sciences, ensuring privacy in video surveillance, fortifying video transmission against errors and data breaches, securing business communications, preventing data leakage, and enhancing rights management for digital content.

An Enhanced RSA Algorithm to Counter Repetitive Ciphertext Threats Empowering User-centric Security

The technology-driven modern age emphasizes the security and privacy of communication. Through this paper, we delve deep into the need for user-centric security within cloud-based environments. The need for enhancement in encryption arises due to the increasing cases of data breaches and insider threats in cloud-based environments recently. The focus is laid upon the use of RSA encryption, end-to-end encryption, and anonymous messaging to address security-based concerns. The primary focus of this research is to develop a comprehensive security system to ensure the confidentiality and authenticity of text-based messages shared in the cloud. The proposed improved RSA algorithm, as suggested, incorporates three prime numbers in the key generation process. To address repetitive ciphertext, the proposed algorithm involves adding the index of each character in the plaintext string to the character’s integer value before encryption. Conversely, during decryption, the same index is subtracted. This proposed algorithm has been utilized in a practical scenario, specifically in the implementation of a chat application. This paper presents a proof-of-concept for the proposed enhanced version of the RSA algorithm, accompanied by a thorough comparison and analysis of computational times across various bit lengths. Increase in data security at a cost of minor increase in computation time was observed through this research.

Layered security model through integration of Vigenere and Hill Cipher in digital message encryption

The rapid development of digitalization has a significant impact on data and information protection. One approach to protecting data and information is through the use of cryptography. The research aims to combine the use of Vigenere and Hill Cipher algorithms in modeling to maintain the security and confidentiality of digital messages. The focus of this research is on the process of encrypting digital text messages. The layered security in this study takes advantage of the advantages of each algorithm. The combination of the two is designed to increase the complexity of encryption and reduce vulnerability to cryptanalytic attacks. The encryption process starts with using Vigenere Cipher for initial message encrypting, then the results are re-encrypted using Hill Cipher. Research shows that this layered security model can improve data security and make it more difficult for uninterested parties to decipher it. The combination of Vigenere's and Hill Cipher's algorithms could be one of the layered security alternatives to digital message encryption in an effort to protect information and data from security threats in the digital age.

PENGAMANAN DATA EKSTENSI FILE PDF DENGAN ALGORITMA AES DAN OTP

The rapid development of technology presents new challenges in maintaining data security and privacy, especially concerning the security and confidentiality of documents that are vulnerable to eavesdropping and theft. Cryptography is the art and science of maintaining the confidentiality of messages using mathematical techniques related to data security, such as privacy, data integrity, and authentication. Cryptography can be applied in various sectors to enhance data security and protect sensitive information from risks such as unauthorized access, theft, and misuse of personal data. For instance, PDFs, which are digital document formats, are often used for various purposes, such as online applications, registrations, and digital transactions. AES (Advanced Encryption Standard) is a widely used encryption algorithm for protecting data, and the use of OTP (One Time Password) is a security technique that requires two different steps of verification to access a system. The AES algorithm provides strong security by utilizing complex transformations that make it very difficult to break, and the addition of OTP further enhances data security before it is returned to its original form.

Secure Routing Protocol Based on Junction Selection in VANETs (SERPROV)

Road safety has become a major issue over the last twenty years. The existing transportation system has become inefficient as the number of vehicles has increased remarkably, causing more accidents and other problems. To meet these challenges, the field of Intelligent Transport Systems (ITS) has been proposed. ITS, also known as intelligent transport, is based on vehicle ad hoc networks (VANETs), a subset of mobile ad hoc networks (MANETs) that use moving cars as nodes to create mobile networks. ITS includes various applications such as cooperative traffic monitoring, blind crossings, collision avoidance and traffic flow control. However, dynamic topology and secure communication remain major challenges due to the high mobility of nodes and the random speed of vehicles. This paper proposes a secure protocol called SERPROV (Secure Routing Protocol based on Junction Selection in VANETs) that combines routing and security using a junction selection mechanism and applies an asymmetric cryptography protocol. Simulation results show that SERPROV improves response time and packet delivery ratio compared to existing protocols for a number of vehicles less than or equal to 300. We plan to implement blockchain technology in the future to replace the public key register, thus making the protocol fully decentralized and further exploring the confidentiality of messages exchanged in the VANET environment.

Broadcast signcryption scheme with equality test in smart transportation system

With the generation of massive traffic information in the smart transportation system, the traffic control center efficiently utilizes broadcast communication to send multiple messages to multiple vehicles. Besides, diversified privacy disclosure and security attack issues also emerged spontaneously. To achieve secure communication between the traffic control center and vehicles in the smart transportation system, we design a broadcast signcryption scheme with equality test in the smart transportation system based on the certificateless cryptosystem and equality test. The scheme realizes message confidentiality and vehicle privacy by using the Lagrange interpolation theorem to encrypt messages and vehicle identities, while also achieving classify ciphertext by using the equality test and facilitate road traffic information management. Through numerical experiment analysis, the proposed work has higher operation efficiency and is more suitable for application in smart transportation systems.

An SGX-based online voting protocol with maximum voter privacy

Electronic voting (E-voting), a crucial method in modern society, balances efficiency with the need for equity, reliability, and privacy to accurately record votes and maintain democracy. However, there is the challenge of potential leakage of voting information in scenarios where administrators of voting system may act maliciously. Moreover, contemporary collaborative counting methods face a significant increase in the cost of storage and heightened communication overhead in large-scale e-voting. In response, this paper proposes an innovative online voting protocol that integrates Intel SGX, homomorphic encryption, and zero-knowledge proof. This protocol aims to cut down the cost of communication and storage while maximizing the protection of voter privacy. The protocol relies on SGX to provide a trusted execution environment for the voting process, guarding against malicious attacks from external software or high-privileged administrators. In the proposed protocol, voters apply homomorphic encryption algorithms to locally encrypt their ballots, no longer relying on other entities (such as the voting system or SGX) for encryption. Then the encrypted ballots are submitted to SGX to mitigate the threat of data leakage in SGX. Through the adoption of zero-knowledge proof technology, the voting protocol can verify the legitimacy of votes without revealing their content. The proposed solution introduces the SGXVOT architecture, comprising two enclaves – Enclave V responsible for tallying individual encrypted votes, and Enclave T responsible for decrypting and publishing voting results. This design ensures that individual voters’ ballots remain in ciphertext, preserving the confidentiality of votes and voter privacy. Additionally, the protocol incorporates a “One-Time Pad” encryption communication protocol to guarantee the confidentiality of communication messages between Enclave V and Enclave T. The thorough security analysis and performance evaluation demonstrate the superior performance of the proposed solution in terms of security, practicality, and scalability.

Performance Analysis Of The Combination Of Blum Blum Shub And Rc5 Algorithm In Message Security

This research aims to enhance message security in the RC5 algorithm by integrating it with the Blum Blum Shub (BBS) algorithm. The rapid growth in data and information exchange, driven by advancements in information and communication technology, demands robust security against attacks such as eavesdropping, interruption, and data modification. Cryptography, particularly with symmetric and asymmetric keys, becomes a solution to maintain message confidentiality. The RC (Rivest Cipher) algorithm, specifically RC5, has become a popular choice in network applications due to its speed and variable key length complexity. This study attempts to improve the quality of encryption keys by integrating the Blum Blum Shub (BBS) method, a mathematical random number generator algorithm. RC5 and BBS are used together to secure messages, producing ciphertext that is difficult to predict and smaller in file size compared to the standard RC5 method. The test results show that the processing speed is independent of the number of characters in the plaintext, while the encrypted file size resulting from the RC5-BBS combination is more efficient than using the default RC5. In conclusion, integrating BBS into RC5 can enhance the security and efficiency of the encryption algorithm, with the potential for widespread application in cryptography-based data security

Message Encryption in Digital Images using the Zhang LSB Imange Method

Message encryption in digital images using the Zhang LSB Image method is a steganography technique that utilizes the Least Significant Bit (LSB) method to hide secret messages in the last bit of the image pixel. This method allows the use of images as a medium to convey hidden messages. The encryption process involves two main stages, namely message encryption and message hiding in an image. Message encryption is carried out using strong cryptographic algorithms to secure the authenticity and confidentiality of messages. Then, the encrypted message is inserted into the last bit of the image pixel using the LSB method. This is done by modifying the last bit value of the pixel so that the change is not visually visible to the human eye. To recover the original message, the message recovery process involves extracting the last bit of the modified image pixel and decrypting the message using the appropriate key. The Zhang LSB Image method is a steganography technique that is relatively simple but effective in hiding messages in digital images.

An optimized secure dual authentication for VANETs

“Vehicular Ad-hoc Network (VANET)” has emerged as a hotbed of research and development. This technology has been utilized to improve vehicle and road safety by transmitting information about traffic congestion and road conditions during emergencies in order to soothe drivers and passengers. However, such environments are more vulnerable to security risks. Thus, the primary challenge in such an environment is to provide authentication services while maintaining user confidentiality. To that end, a trustworthy authority (TA) is established, which offers services to users as well as authentication of communications transmitted between trusted authorities and VANET nodes. A trusted authority (TA) is established using VANETs to supply clients with a range of online premium services. As a result, preserving the confidentiality and authenticity of messages conducted between the TA and VANET nodes is crucial. Our proposed method minimizes recognition latency by up to 85% when compared to On-site Driver ID, and decreases authentication latency by up to 94%, respectively.

A lattice-based efficient heterogeneous signcryption scheme for secure network communications

Ensuring the security of transmitted content is an important task in network communication. Signcryption technology combines signature and encryption operations in a single step to achieve message authentication and confidentiality. In practical applications, users are usually in different cryptographic systems, the ordinary signcryption technology cannot realize communication between two different cryptographic systems. And the ciphertext structure of the existing signcryption schemes is relatively complex, signcryption is not efficient. Therefore, in order to solve the problem of efficient communication between different cryptosystems and ensure quantum security, this paper proposes a lattice-based efficient heterogeneous signcryption scheme for secure network communications. This signcryption scheme accomplishes signcryption through matrix operations and hash functions, which avoids complex signcryption structures, efficiently realizes bidirectional message communication between identity-based cryptosystems and certificateless cryptosystems.

Leakage-Resilient Hybrid Signcryption in Heterogeneous Public-key Systems

Signcryption integrates both signature and encryption schemes into single scheme to ensure both content unforgeability (authentication) and message confidentiality while reducing computational complexity. Typically, both signers (senders) and decrypters (receivers) in a signcryption scheme belong to the same public-key systems. When signers and decrypters in a signcryption scheme belong to heterogeneous public-key systems, this scheme is called a hybrid signcryption scheme which provides more elastic usage than typical signcryption schemes. In recent years, a new kind of attack, named side-channel attack, allows adversaries to learn a portion of the secret keys used in cryptographic algorithms. To resist such an attack, leakage-resilient cryptography has been widely discussed and studied while a large number of leakage-resilient schemes have been proposed. Also, numerous hybrid signcryption schemes under heterogeneous public-key systems were proposed, but none of them possesses leakage-resilient property. In this paper, we propose the first hybrid signcryption scheme with leakage resilience, called leakage-resilient hybrid signcryption scheme, in heterogeneous public-key systems (LR-HSC-HPKS). Security proofs are demonstrated to show that the proposed scheme provides both authentication and confidentiality against two types of adversaries in heterogeneous public-key systems.

A Computationally Efficient Method for Increasing Confidentiality in Smart Electricity Networks

Safeguarding the data collected by smart meters is essential because the disclosure of this information may threaten the privacy of the consumer. By obtaining them, hackers can find out the behavior of the person and use that information for malicious purposes. Therefore, the anonymity of such information can prevent the occurrence of risks. Given the paramount significance of user privacy and data integrity, this paper primarily investigates the confidentiality, integrity, and anonymity of messages. This paper aims to develop a platform for determining dynamic pricing to coordinate supply and demand, thereby maximizing the efficiency of facilities. In the previous research, the operation center was not authenticated for the customer in the first step, and they also had a heavy computational cost. But this paper has endeavored to develop an efficient and comprehensive privacy-preserving solution for the smart electricity network. Also, it has tried to cover all the required security objectives by dealing with authenticity, confidentiality, and irrefutability. The method of the research is that two entities mutually authenticate each other and reach a key agreement so that if the operation center wants to send a control command, it can send control commands directly to the meter with less time complexity. The power company sends control commands and requests to the smart meters until the analyzed and collected energy consumption data are transmitted. The data aggregator node gathers the data from the meters. The results showed that the proposed method reduced the computational complexity and communication overhead to a satisfactory level and is also resistant to various attacks.

Identity-based proxy blind signature scheme on lattice in high-speed network environment

The methods of network attacks are becoming more and more diverse In high-speed networks, and protecting private data is a key issue for users’ security. Proxy blind signature technology combines proxy and blind signature technology to achieve signature transitivity and message confidentiality. However, current signature schemes will not be secure in quantum environments. Meanwhile, the certificate storage of the existing scheme is relatively complicated. Therefore, to avoid the need for certificates and resist quantum attacks, this paper proposes an anti-quantum identity-based proxy blind signature (ID-Proxy-BS) scheme on lattice. This ID-Proxy-BS scheme improves the efficiency of signature through Gaussian distribution and sampling techniques. Security analysis shows that the scheme satisfies correctness, efficiency, blindness, and unforgeability.

Quantum data communication protection with the quantum permutation pad block cipher in counter mode and Clifford operators

Background: This article integrates two cryptographic schemes for quantum data protection. The result achieves authentification, confidentiality, integrity, and replay protection. The authentication, integrity, and replay aspects leverage quantum Clifford operators. Confidentiality of quantum messages is achieved using the quantum permutation pad (QPP) cryptographic scheme. Methods: Clifford operators and the QPP are combined into a block cipher in counter mode. A shared secret is used to seed a random number generator for the arbitrary selection of Clifford operators and quantum permutations to produce a signature field and perform encryption. An encryption and signature algorithm and a decryption and authentication algorithm are specified to protect quantum messages. Results: A symmetric key block cipher with authentication is described. The plain text is signed with a sequence of randomly selected Clifford operators. The signed plaintext is encrypted with a sequence of randomly selected permutations. The algorithms are analyzed. As a function of the values selected for the security parameters, there is an unavoidable risk of collision. The probability of block collision is modelled versus the number of blocks encrypted, for block sizes two, three, four, and five qubits. Conclusions: The scheme is practical but does not achieve perfect indistinguishability because of the risk of message collision. This is normal and unavoidable when fixed-size fields are assumed to make a scheme practical. The model can be used to determine the values of the security parameters and the lifetime of session keys to mitigate the risk of information leakage according to the needs of the scheme’s users. The session key can be renewed when a tolerable maximum number of messages has been sent.

Unlinkable Signcryption Scheme for Multi-Receiver in VANETs

An increasing number of researchers are turning their attention to signcryption, particularly in the context of multi-receiver communication scenarios, due to its ability to simultaneously provide authentication, integrity, and confidentiality of messages. However, existing signcryption schemes have not been able to fully implement sender unlinkability. Specifically, when a sender signcrypts a secret message and obtains the corresponding ciphertext, the intended recipient must use the sender’s identity or public key to complete the unsigncryption process and retrieve the plaintext. Consequently, the recipient can link the sender via the same identity or public key. To address this issue, we present an Unlinkable Signcryption Scheme for Multi-Receiver (USS-MR). With Chinese Remainder Theorem (CRT), our USS-MR enables a vehicle to send the same secret message to a group of RoadSide Units (RSUs). Additionally, when a new message requires signcryption, the vehicle generates a new key pair, making it impossible for any RSU to link the vehicle through its public key. In our USS-MR, we have adopted a pseudonym mechanism to provide conditional privacy, which hides the real identity of the vehicle through the use of pseudonyms and avoids linking it to the identity. Moreover, if a vehicle is found to engage in malicious behavior, it will not only be tracked but also subjected to revocation. Comprehensive security analyses demonstrate that our USS-MR satisfies various security, privacy, and functionality requirements and effectively resists common attacks in Vehicular Ad-hoc Networks (VANETs). Finally, our USS-MR demonstrates certain advantages in terms of computation and communication when compared to relevant studies. In particular, our USS-MR maintains a consistent communication burden of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$388$</tex-math> </inline-formula> bytes.

Penerapan Algoritma Gronsfeld Dengan Pembangkit Kunci Quicksort Untuk Mengamankan Pesan Rahasia

The numerous issues often encountered in securing confidential messages revolve around message leaks. Message leaks occur through various means, such as eavesdropping. Eavesdropping happens when unauthorized parties manage to access and obtain information from ongoing communications. One way to maintain the confidentiality of secret messages is through encryption and decryption, known as cryptography, achieved by transforming the original message (plaintext) into a secret message (ciphertext). In this study, the results of the encrypted character ciphertext are v, v, w, ^, ™, ʽ, ¦, ¥, -, ¼, Ý, ó, ⁒, x, [], ", [], #, S, a, I, p, p. These findings can serve as an alternative solution to safeguard message confidentiality, ensuring only the message owner and those with knowledge of the key can access it. The Gronsfeld Cipher cryptographic method can also enhance the security of the Quicksort algorithm, a cryptographic algorithm, by generating a more randomized text message that does not reveal patterns connecting it to the original text message.

Enabling secure lightweight mobile Narrowband Internet of Things (NB-IoT) applications using blockchain

Narrowband Internet of Things (NB-IoT) is a low bandwidth 3GPP communication standard transmitting small quantities of data over long distances at random intervals. However, as NB-IoT cannot support seamless handover between base stations, its applications are limited to stationary devices, which may result in the potential risk of fake base station connections in an attempt to maintain connectivity across cells. Considering characteristics such as low power consumption and high connection density, researchers envision using NB-IoT in mobile applications such as public-bike sharing, pet tracking etc. Connecting NB-IoT devices using decentralised architecture such as blockchain ensures seamless communication in mobile applications and eliminates bottlenecks due to multiple data requests observed in centralised networks. In this paper, we develop a hybrid blockchain framework facilitating mutual authentication between base stations to enhance user privacy and prevent fake base station connections and certificate transfers. Zero-knowledge proof used as the consensus algorithm enhances user privacy and message confidentiality. IoT devices are designed to store the hashes of their approved transactions as a linear hash chain instead of the complete merkle tree to minimise hash verification complexity. Additionally, base station memory is partitioned dynamically to enhance scalability and memory utilisation efficiency. We prototype our framework on Remix IDE in Ethereum and implement it on Raspberry Pi 4. The security of the proposed framework is formally verified using Scyther. Further, we show that our approach achieves 80.50% lower computational power, 74.73% lower execution time and 50% lower memory, respectively, in comparison with existing schemes making our proposed scheme lightweight.

Securely Compressed Extensive Text Messages: The Interactive Mobile Learning for Distance Education in the COVID – 19 Pandemic

The COVID-19 pandemic has made a massive impact on the higher education system in the present globe. Universities had to close abruptly due to keeping up social distancing to prevent the spread of the Coronavirus in the world community. As a result, the existing face-to-face education style is rapidly shifting to distance education environment through the mobile technology. Here, an extensive text messages, one of the most popular applications, make a significant contribution on higher education. However, in this scenario, the single text message is not sufficient in various academic activities such as sending short lecture summaries, feedbacks, assessment timetables, useful web links, detailed news, notices, and examination results to achieve educational prospects to obtain better results in distance education. Moreover, standard SMSs do not provide message confidentiality when sending sensitive data, such as examination results. Here, we propose a novel technique for extensive text message compression to create an interactive mobile learning environment for distance education in the present pandemic situation. This proposed secure mechanism provides message confidentiality, authenticity, and integrity with cryptographic protection. Initially, the teacher inserts academic-related information as an extensive text message. The extensive text message is then compressed and secured with the initialization vector and the secret key in the proposed mechanism. Finally, the securely compressed single text message transmits to students who will decompress it into its original form on their mobile devices. The result shows that students' extrinsic motivation in their distance learning environment effectively and efficiently in the COVID-19 pandemic.