Encrypted Messages Research Articles

The Fast Health Interoperability Resources (FHIR) Standard and Homecare, a Scoping Review

The scoping review reported by this article aimed to analyze the state of the art of the use of Fast Health Interoperability Resources (FHIR) in the development of homecare applications and was informed by the following research questions: (i) what type of homecare applications benefit from the use of FHIR?; (ii) what FHIR resources are being implemented?; (iii) what publicly available development tools are being used?; and (iv) how privacy and security issues are being addressed? An electronic search was conducted, and 27 studies were included in the scoping review after the selection process. The results show a current interest in using FHIR to implement: i) applications to provide interoperable measurement devices for home monitoring; (ii) applications to remotely collected Patient Reported Outcome Measures (PROM); (iii) Personal Health Records (PHR); and (iv) specific applications for self-management. According to the results, the FHIR resources being implemented are quite diverse and contribute for the challenge of handling the variability caused by diverse healthcare processes. However, the use of publicly available development tools (e.g., SMART on FHIR or HAPI) is not yet generalized. Moreover, just a small number of studies reported the validation of the implemented resources using publicly available FHIR validators. Finally, in terms of privacy and security issues, different approaches were identified: authentication and authorizations mechanisms, end-to-end encrypted messaging mechanisms, and decentralized management and audit trail based on blockchain technologies.

How Disinformation on WhatsApp Went From Campaign Weapon to Governmental Propaganda in Brazil

The popular encrypted messaging and chat app WhatsApp played a key role in the election of Brazilian President Jair Bolsonaro in 2018. The present study builds on this knowledge and showcases how the app continued to be used in a governmental operation spreading false and misleading information popularly known in Brazil as the Office of Hatred (OOH). By harnessing in-depth expert interviews with documentarians of the office’s daily operations—researchers, journalists, and fact-checkers ( N = 10)—this study draws up a chronology of the OOH. Via this methodological approach, we trace and chronologize events, actions, and actors associated with the OOH. Specifically, findings (a) document the rise of antipetismo and disinformation campaigns associated with attacks on the Brazilian Worker’s party from 2012 until the election of Bolsonaro in 2018, (b) describe the emergence of the OOH at the heels of the election and subsequent radicalization in WhatsApp groups, (c) provide an overview of the types of disinformation that are spread on the app by the OOH, and (d) illustrate how the OOH operates by mapping key actors and places, communicative strategies, and audiences. These findings are discussed in light of ramifications that government-sponsored forms of disinformation might have in other antidemocratic polities marked by strongman populist leadership.

Identity-Based Key Management Scheme for Secure Discussion Group Establishment in DOSNs

Distributed online social network (DOSN) solves the challenges of single-point failure and user data privacy faced by traditional online social network (OSN). Online discussion group, allowing a user to facilitate the communications with other users, is one of the most important components of (D)OSN. Key management is the key technology to ensure the secure establishment of discussion groups in DOSNs. However, the existing key management schemes for secure discussion group establishment in DOSNs cannot meet the requirements of sender non-restriction, receiver controllability, round optimal, certificate freeness simultaneously. In this paper, we propose a novel key management scheme for secure discussion group establishment in DOSNs. In our scheme, any user could use our key management scheme to initialize a discussion group with a piece of discussion group information. Users who are interested in the group topic contained in the discussion group information can join and leave the discussion group at any time once the discussion group is initialized with one-round communication. Any user/sender can find the users that he/she wants to communicate with by looking up the discussion group information of a discussion group and then send encrypted messages to some or all of the users in the discussion group. Therefore, our scheme achieves sender non-restriction, receiver controllability, round optimal, certificate freeness simultaneously. Security analysis also shows that our scheme achieves confidentiality, authentication, full collusion resistance, known-key security and perfect forward security.

A message encryption scheme inspired by Sudoku puzzle

A message encryption scheme inspired by Sudoku puzzle

Steganography Encryption Secret Message in Video Raster Using DNA and Chaotic Map

Recently, much secured data has been sent across the internet and networks. Steganography is very important because it conceals secure data in images, texts, audios, protocols, videos, or other mediums. Video steganography is the method of concealing data in frames of video format. A video is a collection of frames or images used for hidden script messages. This paper proposes a technique to encrypt secret messages using DNA and a 3D chaotic map in video frames using the raster method. This technique uses three steps: Firstly, converting video frames into raster to extract features from each frame. Secondly, encryption of secret messages using encoded forms of DNA bases, inverse/inverse complements of DNA, and utilizing 3D chaotic maps, Thirdly, hiding encryption secret messages in that raster video frame by using a secret key in the four corners of each video frame. This technique hides large amounts of secret data because the video frame is large and accepts any message size. The outcomes are efficient, robust, highly secure, and can tolerate high capacity. These outcomes have been obtained from a set of tests like: peak signal to noise ratio (PSNR), mean square error (MSE), entropy, correlation coefficient, and histogram and capacity.

Fine-grained flexible access control: ciphertext policy attribute based encryption for arithmetic circuits

Applying access structure to encrypted sensitive data is one of the challenges in communication networks and cloud computing. Various methods have been proposed to achieve this goal, one of which is attribute-based encryption (ABE). In ABE schemes, the access structure, a.k.a policy, can be applied to the key or ciphertext. Thus, if the policy is applied to the key, the ABE scheme is called the key policy attribute-based encryption (KP-ABE), and if it is applied to the ciphertext, the scheme is called the ciphertext policy attribute-based encryption (CP-ABE). Since in the KP-ABE, the policy is selected once by a trusted entity and is fixed then, they are not suitable for applications where the policy needs to change repeatedly. This problem is solved in CP-ABE, where the policy is selected by the sender and can be changed for each message encryption. Furthermore, it is desired in the ABE schemes that a strong fine-grained access control can be realized. While most of the existing access structures are of Boolean type, an arithmetic access structure can support a stronger fine-grained access structure. We present the first CP-ABE scheme with an arithmetic circuit access policy based on the multilinear maps. First, we outline a basic design and then two improved versions of this scheme, with or without the property of hidden attributes, are introduced. We also define the concept of hidden result attribute based encryption (HR-ABE) which means that the result of the arithmetic function will not be revealed to the users. We define a new hardness assumption, called the \((k-1)\)-distance decisional Diffie–Hellman assumption, which is at least as hard as the k-multilinear decisional Diffie–Hellman assumption. Under this assumption, we prove the adaptive security of the proposed scheme.

Tiny encryption algorithm (TEA) for analysis and implementation of cryptool2-based text message encryption and decryption processes

Data security is one of the main factors in the world of information technology. The human need for information is increasing along with the changing times today. To maintain the authenticity of the information presented, it is necessary to have a high level of security. In this study, a data security simulation will be designed using the TEA (Tiny Encryption Algorithm) algorithm which includes a block cipher encryption algorithm and includes a symmetric key cryptography algorithm with the advantage of being on the Feistel network. The practicum was analyzed based on the process of encrypting and decrypting messages in text format. The software used to simulate the TEA (Tiny Encryption Algorithm) algorithm using Cryptool2 software which is open source software is used to explain the concept of cryptography. This research is used to decipher, schema, and implement the TEA (Tiny Encryption Algorithm) algorithm in the form of simulating encryption and decryption of text messages (both text and text files) so that text messages are sent in the safest way from the sender to the recipient.

Thermally Induced Reversible Fluorescence Switching of Lead Chloride Hybrids for Anticounterfeiting and Encryption.

Metal halide hybrids with thermally induced fluorescence transition have the potential to be utilized as the next generation of smart materials in optoelectronic devices. However, the fabrication of thermochromic materials with simultaneously reversible and lower transition temperatures is still a challenge. Herein, we present a novel one-dimensional (1D) organic-inorganic lead chloride hybrid (TPA)PbCl3-Green (TPA = tetrapropylammonium) single crystal that exhibits green emission and up to 30% photoluminescence quantum yield (PLQY). It is worth noting that the (TPA)PbCl3-Green crystal changes emission from green to blue light when heated at 323 K. The emission spectra indicate that the blue light is attributed to the combination of two emission peaks located at 438 and 520 nm, respectively. Furthermore, the green luminescence is restored after natural cooling to room temperature. The dynamic transition process is demonstrated via steady-state photoluminescence, single-crystal X-ray diffraction (SCXRD), and powder X-ray diffraction (XRD). (TPA)PbCl3-Green crystals and (TPA)PbCl3-Green@PVP complexes have also been explored as fluorescent security inks for dynamic anticounterfeiting and message encryption as well as optical logic gate applications due to the excellent cycling stability and low transition temperature. This material offers a completely new option for thermochromic materials used for security information.

Multicolor fluorescent/room temperature phosphorescent carbon dot composites for information encryption and anti-counterfeiting

Room temperature phosphorescent (RTP) materials have a place in information encryption and anti-counterfeiting applications due to features such as long-life luminescence. In this work, three different colors (blue, cyan and green) carbon dots, named B-CDs, C-CDs, and G-CDs, were prepared via a one-step hydrothermal method using glutathione, m-phenylenediamine and p-phenylenediamine as raw materials. B-CDs, C-CDs, and G-CDs generate more n-π* transitions due to the doping of N atoms, which promotes inter-system crossing (ISC) and thus effectively populates triplet excitons. In addition, the corresponding fluorescent/phosphorescent solid powders were obtained by dispersing B-CDs, C-CDs, and G-CDs in sodium alginate (SA). After turning off the UV lamp, several seconds of RTP were able to be observed with phosphorescence lifetimes of 165.8, 284.5, and 186.1 ms, respectively. Moreover, RTP is easily quenched by atmospheric oxygen and water molecules, so green RTP can only be observed in a dry condition by printing C-CDs@SA gels on filter paper. Based on this feature, the prepared CDs can be effectively used for message encryption and advanced anti-counterfeiting. As well as, C-CDs@SA powder also has important applications in fingerprint detection.

Computational indistinguishability and boson sampling* *This paper is dedicated to Igor Jex on the occasion of his 60th birthday.

We introduce a computational problem of distinguishing between the output of an ideal coarse-grained boson sampler and the output of a true random number generator, as a resource for cryptographic schemes, which are secure against computationally unbounded adversaries. Moreover, we define a cryptographic setting for the implementation of such schemes, including message encryption and authentication, as well as entity authentication.

Hybrid Encryption Model using One-Time Pad and Route Cipher algorithm with Integrity Check (Using MD5 hashing)

The world is moving forward in terms of internet connectivity. While this enhances connectivity and strengthens communication, it brings with it its shortcomings. The advent of internet went hand in hand with emergence of hackers. This made businesses vulnerable and prone to malicious attacks by various groups and organizations. The business, to safeguard the data of the clients and consumers had to fool proof their servers and data-centres, hence the need to enhance and tighten security and close various vulnerable points. Cryptography is a technique involving encryption of data and messages so that only the intended audience can decrypt and comprehend it. For enhanced security, a hybrid encryption technique along with integrity check (MD5 hashing) is used. The encryption technique of One Time Pad (OTP - symmetric) and Route cipher (trans- positional) are combined and used.

Optimal secure fuzzy based multi keyword search over ciphered e-mail in cloud

Cloud computing become increasingly more famous consistently, as numerous associations tend to outsource their information. With the outbreak of email message leakage, the protection and security of sensitive email data have become clients’ essential concerns. Encrypted email data is a superior method to ensure security, yet it will enormously restrict the searching. To take care of this difficulty keyword-based search over encrypted information is presented. The current search strategies permit the client to search utilizing just the specific keywords. There is no capacity to bear errors and format irregularities. In order to overcome those drawbacks, optimal secured fuzzy-based multi-keyword search over encrypted email data is proposed here. The email sender encrypts the email data before outsourcing the data to a cloud server. For encryption, the proposed method utilizes the optimal secure XOR (OSXOR) encryption algorithm. Here the key value is optimally selected by the mayfly optimization algorithm (MOA). After the encryption, the encrypted email is outsourced to the cloud server. The data owner creates an encrypted searchable index using an input file to enable querying across encrypted emails and then assigns either the index or the gathering of encrypted messages to a cloud server. The receiver receives them from the cloud server and is fed back information, but it is unable to comprehend the signal. The recipient of the encrypted email can decode it and create a search trapdoor in the encrypted email database. For searching, fuzzy-based multi-keyword search is proposed. The effectiveness of the proposed methodology is analyzed in terms of different metrics namely, Memory Usage, Execution time, Encryption and decryption time and search time. The experimental result shows that the proposed method takes a minimum search time is 0.51 s and it achieves maximum searching accuracy of 98%. The implementation is done in JAVA with a Cloud simulator.

Keamanan Pesan Menggunakan Kriptografi dan Steganografi Least Significant Bit pada File Citra Digital

In the current era, data security disturbances often occur, such as data theft by unwanted people. To overcome security problems can be handled using cryptography and steganography methods. The cryptography process generates random writing that can obscure the message making it difficult for others to read. However, cryptography itself is still too weak to secure messages, so steganography is needed to disguise the existence of the message so that it is not visible to the human eye. Apart from hiding messages, another goal is to know the impact of message insertion. In this study, the encryption steps were followed by insertion and decryption followed by extraction. In the secret message encryption process using two algorithms, namely Vigenere Cipher and Playfair Cipher. In the process of inserting a secret message using Least Significant Bit (LSB) steganography. The results of the combination of cryptography and steganography are able to secure secret messages without causing significant changes even though the digital image used before and after the steganography process has increased in size, the Mean Square Error (MSE) value obtained is 0.000136 and the Peak Signal to Noise Ratio (PSNR) value is obtained. 86.8062 dB and the result of message encryption is enough to obscure the relationship pattern in the modified secret message with an avalanche effect value of 53.06%.

Encrypted smartphone text messaging between spine surgeons may reduce after-hours surgery.

"After-hours" non-elective spine surgery is associated with increased morbidity. Decision-making may be enhanced by collaborative input from experienced local colleagues. At our center, we implemented routine use of a cross-platform messaging system (CPMS; WhatsApp Inc., Mountain View, California) to facilitate quality care discussions and collaborative surgical decision-making between spine surgeons prior to booking cases with the operating room. Our aim is to determine whether encrypted text messaging for shared decision-making between spine surgeons affects the number or type of after-hours spine procedures. We retrospectively compared the number, type and length of after-hours spine surgery over three time periods: (A) June 1, 2016-May 31, 2017 (baseline control); (B) June 1, 2017-May 31, 2018 (implementation of retrospective quality care spine rounds); and (C) June 1, 2018-May 31, 2019 (implementation of CPMS). A qualitative analysis of the CPMS transcripts was also performed to assess the rate of between-surgeon agreement for timing and type of procedure. The mean number of after-hours spine surgeries/month over the three study periods (A, B, C) was 10.83, 9.75 and 7.58 (p = 0.014); length of surgery was 41.82, 33.14 and 25.37h/month (p = 0.001). Group agreement with the attending spine surgeon plan was 74.3% overall and was highest for the most urgent and least urgent types of indications. Prospective (i.e., prior to booking surgery) quality care discussion for joint decision-making among spine surgeons using CPMS may reduce both the number and complexity of after-hours procedures.

New deep data hiding and extraction algorithm using multi-channel with multi-level to improve data security and payload capacity.

The main challenge in steganography algorithms is balancing between the size of the secret message (SM) that is embedded in the cover image (CI) and the quality of the stego-image (SI). This manuscript proposes a new steganography algorithm to hide a large amount of secret messages in cover images with a high degree of non-perception in the resulting images. The proposed algorithm applied a multi-channel deep data hiding and extraction algorithm (MCDHEA) based on a modified multi-level steganography (MLS) approach. This approach used a new modification of the least significant bits (NMLSB) to make it hard to extract a secret message from attackers. The secret message was distributed among n-blocks; each block was hidden into a sub-channel that included multi-level hiding and flows into the main channel. Different grayscale images were used through the levels of each sub-channel and using the color image in the last level of the main channel. The image size of the multi-level was expanded from one level to the next level, and at each level, lossless image compression using the Huffman coding algorithm was applied to enable the size of the data hiding at the next level. In addition, the encryption of secret messages and intermediate cover images based on the XOR encryption algorithm is applied before the hiding process. Finally, the number of bits to be replaced at each level for both sub and main channels was four bits per byte except at the last level of the main channel based on a new approach using a non-uniform number of bits replacements. This algorithm's performance was evaluated using various measures. The results show that the proposed technique is effective and better than the previous works concerning imperceptibility and robustness. Furthermore, the results show that the maximum peak signal-to-noise ratio (PSNR) of 61.2 dB for the payload of 18,750 bytes, the maximum video information fidelity (VIF) of 0.95 for the payload of 19,660 bytes, and the maximum structural similarity index measure (SSIM) of 0.999 for the payload of 294,912 bytes.

A Lightweight Hybrid Scheme for Hiding Text Messages in Colour Images Using LSB, Lah Transform and Chaotic Techniques

Data security can involve embedding hidden images, text, audio, or video files within other media to prevent hackers from stealing encrypted data. Existing mechanisms suffer from a high risk of security breaches or large computational costs, however. The method proposed in this work incorporates low-complexity encryption and steganography mechanisms to enhance security during transmission while lowering computational complexity. In message encryption, it is recommended that text file data slicing in binary representation, to achieve different lengths of string, be conducted before text file data masking based on the lightweight Lucas series and mod function to ensure the retrieval of text messages is impossible. The steganography algorithm starts by generating a random key stream using a hybrid of two low-complexity chaotic maps, the Tent map and the Ikeda map. By finding a position vector parallel to the input image vector, these keys are used based on the previously generated position vector to randomly select input image data and create four vectors that can be later used as input for the Lah transform. In this paper, we present an approach for hiding encrypted text files using LSB colour image steganography by applying a low-complexity XOR operation to the most significant bits in 24-bit colour cover images. It is necessary to perform inverse Lah transformation to recover the image pixels and ensure that invisible data cannot be retrieved in a particular sequence. Evaluation of the quality of the resulting stego-images and comparison with other ways of performing encryption and message concealment shows that the stego-image has a higher PSNR, a lower MSE, and an SSIM value close to one, illustrating the suitability of the proposed method. It is also considered lightweight in terms of having lower computational overhead.

Photostable and printable fluorescence carbon quantum dots for advanced message encryption and specific reversible multiple sensing of Cu2+ and cysteine

The ability to manipulate carbon quantum dots (CQDs) fluorescence with specific substances has been of primary importance for applications in advanced dynamic information encryption. The development of CQDs with specific functionalization, high selectivity and excellent fluorescence stability for information security and sensing remains a challenge. In this paper, we present an N-doped and tryptophan functionalized CQDs that can be applied not only as a fluorescent ink for multiple message encryption but also for fluorescent sensitive and selective recognition of Cu2+ and cysteine (Cys) by multi-method, including aqueous solutions, filter paper, hydrogels and in human DU-145 Prostate cancer cells. Theoretical calculations and mechanistic studies suggested that this on–off-on mechanism was attributed to the transfer of electrons between Cu2+ and functionalized groups on the surface of CQDs and stronger coordination capability with Cys. The above results showed that these newly designed CQDs will greatly enrich the fundamental understanding of CQDs by explaining the recognition mechanism between Cu2+ and Cys, and provide an opportunity for anti-counterfeiting, solid-state fluorescent materials, cellular imaging and environmental.

On the Application of Noiseless Steganography and Elliptic Curves Cryptography Digital Signature Algorithm Methods in Securing Text Messages

Elliptic curve cryptography includes symmetric key cryptography systems that base their security on mathematical problems of elliptic curves. There are several ways that can be used to define the elliptic curve equation that depends on the infinite field used, one of which is the infinite field prima ( where ). Elliptic curve cryptography can be used for multiple protocol purposes, digital signatures, and encryption schemes.The purpose of this study is to determine the process of hiding encrypted messages using the Noiseless Steganography method as well as the generation of private keys and public keys and the process of verifying the validity of the Elliptic Curves Cryptography Digital Signature Algorithm (ECDSA). The result of this thesis is that a line graph is obtained that store or hides a message using the steganography method and a message authenticity from the process of key generation and verification of validity using the ECDSA method. By selecting three samples consisting of one test sample and two differentiating samples, a line graph, an MD5 hash value, and a value at the point are obtained different. Successively obtained values to message “Matematika 2018”, “MATEMATIKA 2018”, and “2018 matematika” are and . The discussion in this thesis only covers the elliptic curves on prime finite field. So, for the next thesis, the next researcher can do a discussion about the elliptic curve on the finite field or the application of elliptic curve cryptography and other steganographic methods

Article: A Lapse of Grace: Encryption Bans as Potential Expropriation Claims

Regulatory interventions to prevent perceived harms of emerging technologies may likely pave the way for tech-related disputes between a host state and a foreign corporation. One such emerging technology whose harms and widespread use features in recent debates is end-to-end encryption (E2EE). This article examines an outright ban of end-to-end encrypted instant messaging platforms, based on the ‘going dark’ concerns of governments, as a potential expropriation claim. This article attempts to answer whether there has been a substantial deprivation, and whether non-compensation is justified for such a deprivation by carrying out effects-based, purpose-based, and balancing analyses. The findings of this study demonstrate that although the effects of the ban may be tantamount to expropriation, such a finding is not evident in a purpose-based or proportionality analyses.

'Choice' of social media platform or encrypted messaging app to buy and sell illegal drugs.

Social media is increasingly being utilized to facilitate the buying and selling of illegal drugs, particularly by young people. However, the range of social media and messaging platforms means people must make 'choices' around which platforms they will use to conduct drug transactions. Polymedia theory suggests that people use different media to manage their social relationships, 'choosing' appropriate channels or platforms based on platform features and the social context of the relationship. This paper uses polymedia theory to explore how buyers and sellers navigate platform 'choice' for drug trading, and how this bears similarities to the ways in which they move between different platforms in their daily lives. We conducted anonymous online interviews with thirty-three people who buy and/or sell drugs via social media and encrypted messaging apps in New Zealand to explore the factors shaping their selection of platforms for drug transactions. Our findings highlight the importance of the relationship between the buyer and seller in shaping how interviewees weighted the relative importance of platform security and convenience. Though more commercial drug sellers exercised considerable influence in directing buyers of drugs towards a given platform, this pattern was less characteristic of how platform 'choice' was navigated in contexts of drug supply between friends. In social supply contexts, platform 'choices' were often not explicitly made, but rather exchanges were channelled through platforms already in use within the social group. We highlight the tensions that arise between seller preferences for a more secure platform and buyer preferences for greater convenience in contexts of friendship. Our findings highlight the importance of understanding social media drug market engagement as shaped by broader patterns of social media engagement, and the distinctions between different social contexts and personal relationships, consistent with polymedia theory.