Encrypted Messages Research Articles

A TYPE OF POST–QUANTUM CRYPTOGRAPHIC ALGORITHM

The article proposes a type of post–quantum cryptographic algorithm based on hash function and One–Time Pad cipher. Due to inheriting a property called “perfect secrecy” of the One-Time Pad cipher, the algorithms constructed according to the method proposed here can resist various types of attacks with the help of quantum computers. In addition to high security, algorithms of this type also have the ability to authenticate the origin and integrity of the encrypted messages. On the other hand, the one-time key for encryption/decryption is established for each individual message while the management and distribution of the shared secret key between the sender/encryptor and receiver/decryptor is performed similar to symmetric – key cryptosystems being applied in practice.

Encryption of messages by the sum of a real variable functions.

The article proposes a cryptosystem with symmetric keys, where the keys are functions of a real variable. These functions can be either continuous or discrete and must satisfy certain constraints. The number of key functions is determined by the number of binary digits that encode a character in the ASCII table. Each binary digit has its own key function. The cipher of a character is represented by a one-dimensional array of real numbers. These numbers are obtained by summing the key functions, which correspond to “1” in the ASCII code of the character. The amplitudes of these functions are random and unknown to the receiving party. Decryption is a multi-level process, in which integral disproportion functions are calculated at each level. To increase the cryptographic strength, the encryption/decryption process involves a permutation of the key-functions according to a secret scheme agreed upon by both parties. Computer simulation has demonstrated the high cryptographic resistance of the proposed system to the determination of the coefficients within the key functions, as well as to the rearrangement of the key functions themselves. It is shown that adjacent identical symbols in an encrypted message have different ciphers, which also complicates hacking the system.

Context-Committing Security of Leveled Leakage-Resilient AEAD

During recent years, research on authenticated encryption has been thriving through two highly active and practically motivated research directions: provable leakage resilience and key- or context-commitment security. However, the intersection of both fields had been overlooked until very recently. In ToSC 1/2024, Struck and Weishäupl studied generic compositions of encryption schemes and message authentication codes for building committing leakage-resilient schemes. They showed that, in general, Encrypt-then-MAC (EtM) and MAC-then-Encrypt (MtE) are not committing while Encrypt-and-MAC (EaM) is, under plausible and weak assumptions on the components. However, real-world schemes are rarely strict blackbox constructions. Instead, while various leakage-resilient schemes follow blueprints inspired by generic compositions, they often tweak them for security or efficiency.In this paper, we study two blueprints, the first one based on EtM for one of the strongest possible levels of leakage resilience. The second one is a single-pass framework based on leveled implementations. We show that, with a careful selection of the underlying primitives such as with identical encryption and authentication keys and a collision-resistant PRF as the MAC, these blueprints are committing. Our results do not contradict the results by Struck and Weishäupl since we pose more, but practically-motivated, requirements on the components. We demonstrate the practical relevance of our results by showing that our results on those blueprints allow us to easily derive proofs that several state-of-the-art leakage-resilient schemes are indeed committing, including TEDT and its descendants TEDT2 and Romulus-T, as well as the single-pass scheme Triplex.

基于温度开关的光响应智能水凝胶用于可逆信息加密和解密

基于温度开关的光响应智能水凝胶用于可逆信息加密和解密

Implementation of Hybrid Encryption Algorithm

This paper presents an analysis of a message encryption scheme that harnesses the strengths of both the RSA and AES algorithms. Through a detailed comparison of RSA and AES in terms of encryption and decryption time, security, key management, and key length, we developed a hybrid scheme that leverages the speed advantage of AES for encryption operations and the stability and key management strengths of RSA. Our analysis demonstrates how the integration of these two algorithms can enhance overall security and performance, effectively combining their respective advantages.  Motivation There are various applications using client- server mechanism but the communication channel is not secure that much and existing methods are not so efficient thus there is need to come up with an efficient and better approach.  Objective Our objective through this project is to constructa hybrid algorithm which is capable of overcoming the disadvantages of the existing methods and provide us with muchbetter approach in terms of various parameters.

Group encryption: Full dynamicity, message filtering and code-based instantiation

Group encryption (GE), introduced by Kiayias, Tsiounis and Yung (Asiacrypt'07), is the encryption analogue of group signatures. It allows to send verifiably encrypted messages satisfying certain requirements to certified members of a group, while keeping the anonymity of the receivers. Similar to the tracing mechanism in group signatures, the receiver of any ciphertext can be identified by an opening authority - should the needs arise. The primitive of GE is motivated by a number of interesting privacy-preserving applications, including the filtering of encrypted emails sent to certified members of an organization.This paper aims to improve the state-of-affairs of GE systems. Our first contribution is the formalization of fully dynamic group encryption (FDGE) - a GE system simultaneously supporting dynamic user enrolments and user revocations. The latter functionality for GE has not been considered so far. As a second contribution, we realize the message filtering feature for GE based on a list of t-bit keywords and 2 commonly used policies: “permissive” - accept the message if it contains at least one of the keywords as a substring; “prohibitive” - accept the message if all of its t-bit substrings are at Hamming distance at least d from all keywords, for d≥1. This feature so far has not been substantially addressed in existing instantiations of GE based on DCR, DDH, pairing-based and lattice-based assumptions. Our third contribution is the first instantiation of GE under code-based assumptions. The scheme is more efficient than the lattice-based construction of Libert et al. (Asiacrypt'16) - which, prior to our work, is the only known instantiation of GE under post-quantum assumptions. Our scheme supports the 2 suggested policies for message filtering, and in the random oracle model, it satisfies the stringent security notions for FDGE that we put forward.

Engaging student volunteers in non-clinical navigation: ACS community access to resources, education, and support (ACS CARES).

e13577 Background: Despite known benefits of oncology patient navigation in improving patient outcomes, implementation is variable and many programs are understaffed. The American Cancer Society (ACS) developed the ACS CARES (Community Access to Resources, Education, and Support) program to expand navigation capacity through the standardized training of students from local universities as volunteers providing non-clinical navigation support. Methods: This pragmatic, real-world hybrid type 2 study utilizes the Consolidated Framework for Implementation Research (CFIR) to evaluate the implementation of student volunteer navigation for patients receiving cancer care at 3 pilot sites. Volunteers meet with patients in clinic, administer a modified NCCN distress thermometer health-related social needs (HRSNs) screen, and administer non-clinical navigation support. Initial process measures from the first 3 months of the pilot data include number and demographics of patients served, distress scores and HRSNs, and time spent by volunteers. Results: Pilot sites spanned diverse geographic regions (rural mid-West, rural-suburban Southeast, urban West) and included clinics with multiple cancer types. From 10/23/23-12/23/23, 22 volunteers navigated 73 patients who were 53% female, 22% Black, and an average age of 57. Of all patients, 46% had a moderate (score 3-6) and 37% had a severe (score 7-10) distress score. ACS CARES volunteers identified 116 HRSNs (56% practical, 18% physical, 17% emotional, 7% social, 2% spiritual). The most common practical HRSNs were finances and transportation. Volunteers spent an average of 78.6 min per patient per in-person meeting, 14 min per patient per follow-up call, 25 min per patient coordinating care and sending encrypted messages, and 90 min per patient identifying and providing resources to address barriers to care. Total time providing non-clinical navigation was over 250 hours. Conclusions: Student volunteers embedded in oncology clinics provided non-clinical navigation support to 73 patients in the first 3 months of the ACS CARES program, further extending the reach and depth of support provided by pilot site care teams. Future analyses will include survey and EMR data to examine program impact on clinical and patient reported outcomes and healthcare utilization. Clinical trial information: 2013209-1.

Decentralized Chatting Application Using Blockchain Technology

Abstract: The emergence of blockchain technology has spurred innovation in various domains, including decentralized communication systems. In this context, a decentralized chat application leveraging blockchain, Remix Ethereum IDE, Ganache blockchain, and MetaMask offers a novel approach to secure and privacy-centric messaging. The application harnesses blockchain's immutable ledger to store chat messages, ensuring data integrity and censorship resistance. Remix Ethereum IDE provides developers with a robust environment for crafting smart contracts, the backbone of the chat application's functionality. Developers can design and deploy smart contracts defining chatroom logic, message encryption, and user authentication. Ganache blockchain serves as a local testing environment, enabling developers to validate smart contracts and simulate blockchain interactions in a controlled setting. This facilitates rapid iteration and debugging during the development phase. MetaMask acts as the gateway for users to access the decentralized chat application. Through MetaMask, users authenticate securely using their Ethereum wallets, ensuring pseudonymous identity verification and enabling seamless interaction with the Ethereum blockchain. Together, these technologies form the foundation of a decentralized chat application that prioritizes privacy, security, and user control. By leveraging blockchain and associated tools, the application offers a compelling alternative to centralized messaging platforms, empowering users with sovereignty over their data and communication.

A New Approach of Steganography on Image Metadata

In this paper, we introduce a novel method, Steganography on Image Metadata (SIM), to tackle the problem of robustness modification in steganography. The SIM method works by embedding messages into the metadata storage space of digital media. Metadata is information embedded in a file that explains the file's content. The advantage of this method is that it does not alter the pixel values in the image, ensuring no degradation in media quality, and the secret message remains secure even when robustness manipulations are applied to the stego-image. To enhance data security, this paper also suggests using Fernet cryptography for message encryption during the embedding process into the cover-image. According to experimental evaluations, the SIM technique can attain a maximum PSNR value of 100 dB and an outstanding MSE value of 0. All robustness manipulation issues in steganography can be effectively addressed using the SIM method. Test results demonstrate that the SIM method can withstand symmetric and asymmetric cropping manipulations down to a pixel size of 1x1, and the message can still be extracted. Testing with image rotation manipulation also proves that the message can be successfully extracted even when the stego-image is rotated up to 180 degrees. Experiments with image resizing manipulation also confirm that the message can be recovered even when the stego-image undergoes up to 90% compression. Testing with color effects applied to the image also does not affect message extraction results.

New simultaneous Diophantine attacks on generalized RSA key equations

RSA stands as a widely adopted method within asymmetric cryptography, commonly applied for digital signature validation and message encryption. The security of RSA relies on the challenge of integer factorization, a problem considered either computationally infeasible or highly intricate, especially when dealing with sufficiently large security parameters. Effective exploits of the integer factorization problem in RSA can allow an adversary to assume the identity of the key holder and decrypt such confidential messages. The keys employed in secure hardware are particularly significant due to the typically greater value of the information they safeguard, such as in the context of securing payment transactions. In general, RSA faces various attacks exploiting weaknesses in its key equations. This paper introduces a new vulnerability that enables the concurrent factorization of multiple RSA moduli. By working with pairs (Ni,ei) and a fixed value y satisfying the Diophantine equation eixi2−y2ϕ(Ni)=zi, we successfully factorized these moduli simultaneously using the lattice basis reduction technique. Notably, our research expands the scope of RSA decryption exponents considered as insecure.

Protection of Personal Privacy Data with Enhanced Encryption & Revocation (PEER)

Abstract: In light of frequent non-public statistics breaches, safeguarding such facts is now greater crucial than ever. By combining Ciphertext-Policy Attribute-Based Encryption (CP-ABE) with blockchain, stable facts storage and sharing are facilitated. However, in excessive-dimensional characteristic domains, existing schemes stumble upon issues like compromised safety, excessive computational overhead, and steeply-priced attribute revocation. This paper proposes a novel scheme to address those demanding situations. It includes 3 components: Fast High-dimensional Attribute Domain-based totally Message Encryption (HAD-FME) for more desirable protection and reduced computational charges, an Attribute Revocation Mechanism Based on Sentry Mode (SM-ARM) using clever contracts for green revocation, and a Blockchain-based totally Model for Personal Privacy Data Protection (BC-PPDP) integrating HAD-FME with SM-ARM. Security analysis confirms the effectiveness of HAD-FME beneath the DLIN assumption and the pride of forward and backward safety for attribute revocation. Experiments show advanced computational performance for HAD-FME and decrease revocation costs for SM-ARM as compared to present methods, with smart contracts and blockchain proving effective in making sure information safety and privateness.

DNA Steganography: Embedding the Secret Messages Using Glass Stack Method and Detecting Errors Made by Different Attacks

Cyber threats pose a significant challenge to protecting cloud-based health data, including DNA sequences and patient information. Steganography is a well-known solution to this problem. Recent studies have limitations, such as not reconstructing the cover or enlarging the original sequence, increasing personal data security risks. In this study, we provide a novel data-hiding technique that uses a secret key, bit padding, and exclusive OR (XOR) operation to insert secrets into a pre-processed DNA sequence. The message encryption and pre-processing of the cover are performed using a new glass stack pattern technique. The message encryption and pre-processing processes using the new glass stack pattern method increase the security and robustness of the system. The method embeds 3 bits per nucleotide which is greater than the existing schemes. It has a relatively small DNA expansion which is 50% and has a low risk of breaking security. The method also preserves the biological properties of DNA sequences. Additionally, a parity check approach further improves security by thwarting attacks like man-in-the-middle, chosen stego, and modification attacks that alter the stego DNA. These advances improve the system's overall security capabilities. The experimental findings demonstrate that the suggested method reconstructs the cover, healthcare data, and DNA sequence properly and error-free, and outperforms competing algorithms on all performance metric dimensions. Highlights The scheme implants a maximum of 3 bits per nucleotide with a small expansion. Its cover pre-processing and message encryption using a glass stack pattern makes strong security. The scheme can detect and fix changed bits caused by attacks. A very low cracking probability shows strong security and robustness. The biological properties of the stego DNA sequence are preserved by this scheme.

Short message encryption technology of Beidou communication based on SM9

AbstractTo reduce the security authentication time cost, forwarding delay, and enhance message security of Beidou communication short messages, this paper proposes a Beidou communication short message encryption technology based on SM9 (Mobile Code Secure Communication). This technology uses split hierarchical clustering algorithm to cluster the short message data of Beidou Communication, in order to unify the processing of similar short message data and improve the encryption efficiency of subsequent short messages. Based on the data clustering results, this paper constructs a short message forwarding verification model using the SM9 identification password algorithm, and provides the message content of the communication application protocol and the communication receiving information protocol to achieve low‐cost and efficient forwarding verification. In addition, this article improves the initial value selection of Logistic chaotic mapping by coupling the tent map with coupled mapping lattice (CML) in the spatiotemporal chaos model to generate a chaotic initial value sequence, thereby expanding the key space, enhancing the ability to resist exhaustive attacks, enhancing the randomness of the generated key parameters, and optimizing the encryption effect of short messages. The experimental results show that the short message security authentication time of the technology proposed in this article is basically controlled within 25 ms, and the minimum forwarding delay is only 23.9 ms, which can effectively resist attacks and improve the security of Beidou communication.

The Development and Evaluation of the Mobile Obstetric Referral Emergency System (MORES) in Bong County, Liberia [ID 2683571

INTRODUCTION: Liberia and much of sub-Saharan Africa lacks a standard triage system for obstetric emergencies. Research conducted in low- and middle-income (LMICs) has shown that maternal mortality is directly related to inadequate triage systems. This study aimed to implement a novel mobile obstetric referral emergency system to improve obstetric triage in Liberia. METHODS: Ninety-seven midwives were recruited from 18 rural health facilities (RHFs) and two referral hospitals in Bong County, Liberia. The study utilized WhatsApp, an encrypted messaging platform, to enable communication between providers at RHFs and referral hospitals. Training sessions at RHFs on sending patient referral data including indication, age, gravidity/parity, gestational age, method of transportation, and delays were conducted. Midwives at referral hospitals were instructed to send messages confirming arrival and outcome. RESULTS: A total of 380 referral messages were sent, with significantly more referrals completing the referral process than not (60%). Both hypertension and hemorrhage accounted for 12% of referrals. Nonemergent obstetric causes accounted for 34%. Of women who arrived, 31% delivered via cesarean section. Significantly more women transported via ambulance arrived compared to self-transport or taxi. When money was identified as a barrier, only 45% of women arrived. CONCLUSION: This is the first study to introduce a real-time two-way mobile-phone obstetric triage platform for use in Liberia. Strengthening the obstetric triage system is critical to prevent delays in reaching care and improve obstetric outcomes. Addressing socioeconomic barriers is vital to increasing access to maternal health care. Future work includes country-wide scale-up in Liberia and assessment of the sustainability of the MORES intervention.

BANKS SHORT MESSAGE SERVICE THREATS NOTIFICATION SYSTEM ON ANDROID BASED PHONE

This research is carried out for the development and implementation of an end-to-end encrypted Short Message Service (SMS) App, utilizing a hybrid cipher algorithm, driven by the notable insecurity observed in SMS communications on mobile devices. SMS is a widely used communication method, and the primary goal of this study is to create a system (App) for end-to-end encrypted SMS. Loss of phones is becoming vulnerable for threats, because we store vital records in android and these records are secret such that no other third party is required to see them, such as Bank SMS, Event Notification etc. Also this information can be compromised if android phone is been lost and found by the criminals. Kidnapping activity is serious case happening in northern part of Nigeria, so if a phone is being lost and discovered how financed he is (the device holder), there is any means of bank account compromisation as that would allow the bank to give some information about the account because of the registered SIM card inserted in android devices (phones). This system is aimed to secure Bank SMS by not allowing an unauthorized person to views the banks SMS, but all other SMS can be view. Whenever the Banks SMS is received by the Android phone, the system will encrypt it and can only be viewed if using correct decryption key, a notification will be sent to the owner other phone if more than two attempt to view the message is made, using a Hybrid Cipher...

Broadcast Encryption using Sum-Product decomposition of Boolean functions

The problem of Broadcast Encryption (BE) consists in broadcasting an encrypted message to a large number of users or receiving devices in such a way that the emitter of the message can control which of the users can or cannot decrypt it. Since the early 1990s, the design of BE schemes has received significant interest and many different concepts were proposed. A major breakthrough was achieved by Naor, Naor and Lotspiech (CRYPTO 2001) by partitioning cleverly the set of authorized users and associating a symmetric key to each subset. Since then, while there have been many advances in public-key based BE schemes, mostly based on bilinear maps, little was made on symmetric cryptography. In this paper, we design a new symmetric-based BE scheme, named Σ Π BE, that relies on logic optimization and consensual security assumptions. It is competitive with the work of Naor et al. and provides a different tradeoff: the bandwidth requirement is significantly lowered at the cost of an increase in the key storage.

Hybrid Cryptographic Approach for Data Security Using Elliptic Curve Cryptography for IoT

The Internet of Things (IoT) technology has changed the contemporary digital world. Devices connected to the IoT have sensors embedded within them. All these devices are purposely connected to share data among them through the Internet. Data sharing among IoT devices needs some security protocols to maintain the privacy and confidentiality of information. IoT devices have less computing power to perform various operations of a cryptographic process. So, there is a need of cryptographic approach to reduce the computational complexity for resource-constrained devices and provide data security. However, storing data over the cloud server also reduces storage overhead, but data transmission via the cloud is not always secure. Data integrity and authentication can be compromised because the end user can only access the data with the help of a cloud server. To ensure the security and integrity of the data, various cryptographic techniques are used. Therefore, in this paper, we propose a secure and optimized hybrid cryptographic scheme for the secure sharing of data by combining Advanced Encryption Standard (AES) and Elliptic Curve Cryptography (ECC). To ensure authentication and data integrity, the proposed scheme primarily uses the Message Authentication Code (MAC). The encrypted messages are stored on a cloud server to reduce storage overhead. The experimental findings demonstrate that the proposed scheme is effective and produces superior results as compared to existing approaches.

Anonymous attribute-based broadcast encryption with hidden multiple access structures

Due to the high demands of data communication, the broadcasting system streams the data daily. This service not only sends out the message to the correct participant but also respects the security of the identity user. In addition, when delivered, all the information must be protected for the party who employs the broadcasting service. Currently, Attribute-Based Broadcast Encryption (ABBE) is useful to apply for the broadcasting service. (ABBE) is a combination of Attribute-Based Encryption (ABE) and Broadcast Encryption (BE), which allows a broadcaster (or encrypter) to broadcast an encrypted message, including a predefined user set and specified access policy to install the authorization mechanism. It is desirable to hide all the information when producing in the ciphertext, which has not been considered in the previous works of ABBE. Motivated by the above issue, we devise a solution to achieve anonymity for the ABBE scheme, which not only hides the access structures but also anonymizes the user’s identity. In this work, we propose two schemes as Anonymous Key Policy (AKP)-ABBE and Anonymous Ciphertext Policy (ACP)-ABBE with supporting multiple access structures by using OR/AND\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\ extsf {OR}/\ extsf {AND}$$\\end{document} gates. Specifically, we present the generic constructions of AKP/ACP-ABBE on the building block of the Inner Product Encryption (IPE\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\ extsf {IPE}$$\\end{document}), which enables the hidden user’s identity and complex OR/AND\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\ extsf {OR}/\ extsf {AND}$$\\end{document}-Gate access structure. We show that our proposed schemes are secured under the standard models.

Differentially Private Functional Encryption

We address the question of realizing privacy preserving analysis of user data. The abstract scenario considered is that an analyst aims to evaluate a function f on some user data X. To achieve comprehensive privacy, it is necessary to protect the input X directly. However, it is known that f(X) may leak too much information about X as well. A common approach to mitigate such risks is to make the computation differential private. In practice, this is often accomplished by replacing f by a noisy variant f^*. We investigate the use of multi-input functional encryption (MIFE) for achieving input- and output-privacy in one cryptographic mechanism. In a MIFE scheme, a setup authority can generate restricted decryption keys which enable to learn specific functions of encrypted messages, without revealing any additional information. To achieve differential privacy in this process, we introduce as a new cryptographic primitive: noisy multi-input functional encryption (NMIFE). It extends the concept of MIFE such that the decryption key may also encode a noisy function where the noise value is secret. While the change from MIFE to NMIFE is rather straightforward, the challenge is to come up with precise and workable definitions of correctness and security definition that we propose and explain in this work. Here, the security definition is tailored to the use case of differential privacy. As it is a special case of the established notion of full-hiding security, we present a generic transformation that allows to turn any full-hiding MIFE scheme into a secure NMIFE scheme that has practically the same performance as the initial MIFE scheme. Moreover, we make use of the fact that the proposed security definition is less restrictive and present a new concrete NMIFE scheme for evaluating the inner product. It is dubbed DiffPIPE (short for DIFFerentially Private Inner Product Evaluation). DiffPIPE is not the result from the transformation and outperforms all from existing full-hiding MIFE schemes constructed NMIFE schemes. In experiments, we demonstrate its applicability for realizing privacy preserving counting queries on data sets.

Concealment of Secret Information in Digital LSB Steganography in Colour and Grey Scale Images

Modern communication system needs an exceptional way of security, especially on computer networks. The network security is becoming more paramount as the number of data being exchanged on the internet increases. Steganography is the art of hiding information in a cover image without causing statistically significant variations to the cover image. Different types of carrier file formats can be used, but digital images are the most popular ones because of their frequency on the internet. This research work gives an overview of image steganography, it’s uses and techniques, basically, to store confidential information within images such as details of working strategy, secret missions, criminal and confidential information in various organizations that work for national security such as military, FBI, DSS, Nigerian police etc. The desktop application has been developed that incorporates Advanced Encryption Standard for encryption of the original message, and Spatially Desynchronized Steganography Algorithm for hiding the text file inside the image. Least Significant Bit (LSB) technique was used in hiding messages in an image. The system enhanced the LSB technique by randomly dispersing the bits of the message in the image and thus making it harder for steganalyst to extract the original message. Keywords:. LSB, Cryptography, Encryption, Image Processing, Security