Message Encoding Research Articles

Ways to Organize and Identify Steganographic Channels in IP Networks

The article is devoted to an overview of network steganography methods that can be used to build hidden message transmission channels in IP networks, as well as methods aimed at identifying such hidden channels. The article gives the concept of a stegocontainer, and provides classification of network steganography methods. The article discusses the following methods of organizing hidden channels: the method of changing the contents of network packet headers, the Transcoding Steganography (TranSteg) method, the delay modulation method, the Lost Audio Packet Steganography (LACK) method, the Retransmission Steganography (RSTEG) method. In the review of the method of changing the contents of network packet headers, the principle of implementing changes in values in some service fields of IP (Internet Protocol) and TCP (Transmission Control Protocol) packet headers, which do not lead to data transmission failure, are considered. In the overview of the TranSteg method, the principle of transcoding the contents of network packets delivering real-time traffic is considered in order to free up space in the packet, which will be used to transmit hidden information. In the review of the delay modulation method, the principles of hidden message encoding are considered, which is carried out by changing the delay value of sending packets in the network. In the review of the LACK method, the mechanism of deliberate retention of RTP packets with an embedded steganographic message is considered. In the review of the RSTEG method, the principle of TCP segment exchange is considered, which provides the possibility of transmitting a steganogram. A number of parameters are given by which it is possible to conclude that there is a hidden channel in the network. The applicability of statistical methods and the methods with a classifier for detecting hidden channels in IP networks is considered. The expediency of implementing statistical methods and methods with a classifier in integration with systems for capturing and analyzing network traffic is indicated.

Attention to Entropic Communication

AbstractThe concept of attention has proven to be very relevant in artificial intelligence. Relative entropy (RE, aka Kullback‐Leibler divergence) plays a central role in communication theory. Here, these concepts, attention, and RE are combined. RE guides optimal encoding of messages in bandwidth‐limited communication as well as optimal message decoding via the maximum entropy principle. In the coding scenario, RE can be derived from four requirements, namely being analytical, local, proper, and calibrated. Weighted RE, used for attention steering in communications, turns out to be improper. To see how proper attention communication can emerge, a scenario of a message sender who wants to ensure that the receiver of the message can perform well‐informed actions is analyzed. In case only the curvature of the utility function maxima are known, it becomes desirable to accurately communicate an attention function, in this case a by this curvature weighted and re‐normalized probability function. Entropic attention communication is here proposed as the desired generalization of entropic communication that permits weighting while being proper, thereby aiding the design of optimal communication protocols in technical applications and helping to understand human communication. It provides the level of cooperation expected under misaligned interests of otherwise honest communication partners.

Coding, Decoding and Retrieving a Message Using DNA: An Experience from a Brazilian Center Research on DNA Data Storage.

DNA data storage based on synthetic oligonucleotides is a major attraction due to the possibility of storage over long periods. Nowadays, the quantity of data generated has been growing exponentially, and the storage capacity needs to keep pace with the growth caused by new technologies and globalization. Since DNA can hold a large amount of information with a high density and remains stable for hundreds of years, this technology offers a solution for current long-term data centers by reducing energy consumption and physical storage space. Currently, research institutes, technology companies, and universities are making significant efforts to meet the growing need for data storage. DNA data storage is a promising field, especially with the advancement of sequencing techniques and equipment, which now make it possible to read genomes (i.e., to retrieve the information) and process this data easily. To overcome the challenges associated with developing new technologies for DNA data storage, a message encoding and decoding exercise was conducted at a Brazilian research center. The exercise performed consisted of synthesizing oligonucleotides by the phosphoramidite route. An encoded message, using a coding scheme that adheres to DNA sequence constraints, was synthesized. After synthesis, the oligonucleotide was sequenced and decoded, and the information was fully recovered.

CULTURAL DIVERSITY IN NONVERBAL COMMUNICATION: COMPARING THE MEANING OF HUNGARIAN-RUSSIANAMERICAN NONVERBAL SIGNS

The aim of my research was to conduct a comparative analysis of nonverbal communication cues between Hungarian, Russian and American cultures, with a focus on the cultural specificities and overlaps of nonverbal cues used to express different emotions and states, such as aggressiveness, uncertainty and interest. The study involved an extensive literature review and a questionnaire survey with participants from different cultures to understand how these nonverbal signals are interpreted and perceived in different cultural contexts.
 In the analysis, I paid particular attention to the different interpretations of body language, facial expressions, gestures and touch, and spatial relations cues. The results of the research have highlighted that although there are some common forms of nonverbal communication, there are also a number of significant cultural differences that fundamentally influence the encoding and decoding of messages.
 For example, while in American culture direct eye contact and open posture can be signs of sincerity and confidence, in Hungarian and Russian cultures these signals can have different contexts and intensities. The meaning and acceptability of touch also varies; what is seen as a friendly gesture in one culture may suggest excessive closeness and inappropriateness in another.
 The research also highlighted the intercultural communication difficulties and misunderstandings that can arise from different interpretations of nonverbal signals. This underlines the need to better understand and respect the communication customs and norms of different cultures in order to communicate effectively and efficiently.
 At the end of my research, I have formulated recommendations for those involved in cross-cultural communication, whether in business, educational or personal contexts. I have stressed the importance of cultural sensitivity, avoiding prejudices and active listening, which can be key to successful and meaningful intercultural dialogues.

Gain/loss framing moderates the VMPFC's response to persuasive messages when behaviors have personal outcomes.

Activity within the ventral medial prefrontal cortex (VMPFC) during encoding of persuasive messages has been shown to predict message-consistent behaviors both within scanner samples and at the population level. This suggests that neuroimaging can aid in the development of better persuasive messages, but little is known about how the brain responds to different message features. Building on past findings, the current study found that gain-framed persuasive messages elicited more VMPFC activation than loss-framed messages, but only when messages addressed outcomes that would be experienced by participants directly. Participants also perceived gain-framed messages as more effective than loss-framed messages, and self-reported perceptions of message effectiveness were positively correlated with VMPFC activation. These results support theories that VMPFC activity during message encoding indexes perceptions of value and self-relevance and demonstrate that established theories of persuasion can improve the understanding of the neural correlates of persuasion.

Encoding of Messages Generated by an Arbitrary Markov Source with Unknown Message Statistics

The method of universal coding of an arbitrary set of Markov sources with finite memory is proposed. An estimation of the universal coding is obtained depending on the ε-entropy of the set of sources describing the massive of this set.

A Data Hiding Approach for Secured Data Communication

"In the digital era preserving the privacy of confidential information is the crucial issue in authentication and secret communication. Cryptography, steganography, data anonymization are few techniques used to preserve the information. Steganography is the process of hiding information into other non-secret sources of information like text, image or audio, so that secret information is not visible to the naked eye. This paper proposes a novel Prime Number Based Embedding (PNBE) approach for efficient data hiding to encode the data in images without any visual distortion. This approach proposes a novel scheme for identifying the embedding location of the data in the image and PNBE algorithm for the encoding and decoding of messages. The proposed approach is demonstrated with benchmark images. The data encoding capacity and quality are tested on different sized images. Experimental results show better hiding capacity in terms of bytes ranging from 6,327 to 12,448 based on the size of the image. The quality of the image is described as Peak to Signal Noise Ratio (PSNR), which computes the quality difference between original and compressed images. The efficiency of the proposed approach is demonstrated using PSNR with higher values. It is observed from the results that the proposed approach outperforms the existing ones in terms of embedding capacity and quality of the images. "

Determinants of Memory Encoding of Altruistic Messages: M-Delphi and F-DEMATEL Approach

One of the key challenges of non-profit organizations is the effective communication of values beneficial to society, such as altruism. Communication can be deemed effective if the message is memory encoded by the recipient. This paper applies social cognitive theory to analyze the determinants of the memory encoding of altruistic messages transmitted to audiences via television. The data were analyzed by the modified Delphi [M-Delphi) and Fuzzy Decision-Making Trial and Evaluation Laboratory [F-DEMATEL). The researchers initially proposed ten factors, and two factors were added after the first Delphi round. The analysis revealed three causal factors and four effect factors. The findings provide several contributions to communication literature. They also provide managerial implications for managers in non-profit organizations on the effective communication of altruism.

SpaceSheep: Satellite Communications for Ovine Smart Grazing.

The application of IoT-based methods to support pastoralism allows the smart optimization of livestock operations and improves the efficiency of the activity. The use of autonomous animal control mechanisms frees the shepherd to carry out other tasks. However, human intervention is still needed in cases such as system failure, the bad or unpredicted behavior of the animals, or even in cases of danger, the welfare of the animal. This study documents the enhancement of an alarm generation system, initially developed within the scope of the SheepIT project, to monitor animal behavior and equipment, which warns the human operator of the occurrence of undesirable events that require intervention. Special attention was given to the use of case scenarios in places without Internet access, such as rural areas. Therefore, the system was integrated with a satellite interface, as a way of guaranteeing the timely delivery of the alarm messages. To ensure an acceptable operating cost, the system was further optimized in terms of message encoding, considering the cost of this type of communication. This study assessed the overall performance of the system, evaluated its scalability, and compared the efficiency gains from the optimization, as well as the performance of the satellite link.

BINOMIAL METHODS FOR BINARY MESSAGE COMPRESSION

Two lossless numerical compression methods for binary messages using binomial coefficients are proposed. The methods are based on the decomposition of a Bernoulli source of information into a combinatorial source A and a probabilistic source B. Accordingly, the entropy of the source is also decomposed into two entropies. The entropy of source A solves the problem of enumeration encoding of compressible messages, and the entropy of source B for the first method solves the problem of optimal coding. The disadvantage of this method is the need for statistical tests. In the second method, the calculation of the maximum value of the entropy of the source B replaces the optimal encoding. This replacement avoids statistical tests, although it leads to a relatively small redundancy of compressed messages, which decreases as their length increases. The work of the methods is shown on specific examples, which allows you to better understand both the idea of the methods and their practical implementation.

Communication Competence of Teachers in Contemporary Educational-Pedagogical Work

In this paper, communication competence is seen as one of the most important skills in modern educational-pedagogical work. It is not about the absolute disposition of man, but about a set of variables that can be improved by learning to the level necessary for the realization of a certain social role. These are two groups of individually determined variables / potencies through which the degree of communication competence of an individual is articulated: cognitive and interactive. Pedagogical communication is most effective if it is realized with professional and communicatively competent teachers, individualized teaching in direct and / or indirect interpersonal communication and encoding of communicative messages, whose reception in pedagogical terms, ie. in terms of cognitive effects and value consequences, will be unambiguous.

A metaprotocol-based Internet of Things architecture

In this paper we propose a metaprotocol-based architecture for the Internet of Things. The metaprotocol defines the message content, but it uses existing communication protocols and the forwarding capabilities of nodes that support this metaprotocol. Such nodes are described with a model that is demonstrated with a prototype middleware implementation. The behaviour of non-trivial nodes is defined with rules that specify actions for various events, including forwarding of received messages. In this way, a dynamic overlay network can be created with various possibilities of interconnecting and various node roles. Regardless of the roles a node possesses, communication with other nodes in this architecture is based on the same metaprotocol. The metaprotocol is based on SQL operations, which allows maximum flexibility in the design of a specific system. On the other hand, the proposed message encoding and the dependence on the underlying transmission protocols allow the creation of very short and simple messages, so that even the most resource-constrained devices can be included in such a system. A comparison with similar architectures shows the expected advantages of the proposed architecture when most resource-constrained nodes are used and when an arbitrary network configuration is required, different from the standard layered thing-gateway-server configuration.

Modelling and Simulation of Collaborative Surveillance for Unmanned Traffic Management.

Unmanned traffic management (UTM) systems rely on collaborative position reporting to track unmanned aerial system (UAS) operations over wide unsurveilled (with counter-UAS systems) areas. Many different technologies, such as Remote-ID, ADS-B, FLARM, or MLAT might be used for this purpose, in addition to the direct exploitation of C2 telemetry, relayed though cellular networks. This paper provides an overview of the most used collaborative sensors and surveillance systems in this context, analyzing their main technical parameters and performance effects. In addition, this paper proposes an abstracted general statistical simulation model covering message encoding, network capacity and access, sensors coverage and distribution, message transmission and decoding. Making use of this abstracted model, this paper proposes a particularized set of simulation models for ADS-B, FLARM and Remote-Id; it is thus useful to test their potential integration in UTM systems. Finally, a comparative analysis, based on simulation, of these systems, is performed. It is shown that the most relevant effects are those related with quantification and the potential saturation of the communication channels leading to collisions and delays.

Rate-Splitting Multiple Access for Multi-Antenna Joint Radar and Communications

Dual-Functional Radar-Communication (DFRC) system is an essential and promising technique for beyond 5G. In this work, we propose a powerful and unified multi-antenna DFRC transmission framework, where an additional radar sequence is transmitted apart from communication streams to enhance radar beampattern matching capability, and Rate-Splitting Multiple Access (RSMA) is adopted to better manage the interference. RSMA relies on multi-antenna Rate-Splitting (RS) with Successive Interference Cancellation (SIC) receivers, and the split and encoding of messages into common and private streams. We design the message split and the precoders of the radar sequence and communication streams to jointly maximize the Weighted Sum Rate (WSR) and minimize the radar beampattern approximation Mean Square Error (MSE) subject to the per antenna power constraint. An iterative algorithm based on Alternating Direction Method of Multipliers (ADMM) is developed to solve the problem. Numerical results first show that RSMA-assisted DFRC achieves a better tradeoff between WSR and beampattern approximation than Space-Division Multiple Access (SDMA)-assisted DFRC with or without radar sequence, and other simpler radar-communication strategies using orthogonal resources. We also show that the RSMA-assisted DFRC frameworks with and without radar sequence achieve the same tradeoff performance. This is because that the common stream is better exploited in the proposed framework. The common stream of RSMA fulfils the triple function of managing interference among communication users, managing interference between communication and radar, and beampattern approximation. Therefore, by enabling RSMA in DFRC, the system performance is enhanced while the system architecture is simplified since there is no need to use additional radar sequence and SIC. We conclude that RSMA is a more powerful multiple access for DFRC.

Multi Agent Assisted Safety Information Dissemination Scheme for V2V Communication in VANETs: Intelligent Agent Approach

The safety information dissemination plays a vital role in the VANET communication. It is a technique of transmitting the information at scheduled intervals or during road hazards by detecting the events using onboard system and interfaces. Information is shared between vehicles and road side units which are further used to predict vehicle collisions, road line crossings, environmental warnings, traffic data and road hazards. Interestingly the risk of lateral collisions and dense traffic for vehicles can be avoided by accomplishing fast data dissemination i.e. warning alerts by event detection. Vehicular technology which supports the safe mode of transportation is growing faster due to the deployment of new automated technology in the intelligent transportation system (ITS). The different scenarios used in vehicular communication are Vehicle to Vehicle (V-V), Vehicle to Infrastructure (V-I) and Vehicle to Internet. Some of the important characteristics of vehicular communications are the mobility, frequent changes in topology, varying transmission power of antennas, intermittent connectivity. ITS providing the solutions for most critical transportation issues and inspiring the researchers for the betterment of road safety. In this paper, we propose a multi agent based safety information dissemination scheme for vehicle to vehicle communication. The proposed algorithm performs the safety information dissemination with help of intelligent agents by optimizing the channel access techniques, message encoding and selection of intermediate nodes. Here the communication between source and destination is achieved with fever number of intermediate links by selecting the nodes in the special zone. Short interval codes which represent safety information are effectively transmitted in the intermittent nature of wireless connectivity. This proposed work describes the details of algorithm with associated network environment, multi agent functions and dissemination mechanism to illustrate the improvement in end to end delay, PDR, energy constraints etc. This method reduces the problem of broadcast storm by delivering the information to intended node. Simulation of the proposed work gives the improved results on PDR, latency and connection overhead.

NEW TENDENCIES IN TEXT EXISTENCE: THE VARIABLE AND THE DYNAMIC

Review of the monograph of Doctor of Philology, Professor of Voronezh State University Ludmila I. Grishaeva “Variation of Text in Communication“ (L.I. Grishaeva. Voronezh: Nauka-Unipress, 2020. — 291 p. ISBN 978-5- 4292-0207-5). The monograph accumulates the results of a long-term research performed by the author and her scientific school that reflect rapid developments of text linguistics of the early 21st century. As an independent scientific discipline, this field represents an important theoretical and methodological basis, important also for dissertation research the results of which are included in the book. The monograph under review consists of an introduction, five chapters and a conclusion. L. I. Grishaeva skillfully substantiates the concept of text varying, proceeding from the textual-grammatical mechanisms of fixation, activation and translation of the information about the world. The book gives the detailed coverage to the issues of varying of semantic and syntactic text structure at micro and macro levels. Taking into consideration numerous factors that determine the essence and limits of text variation a wide range of topics significant for the text, communicative stylistics and media linguistics are considered in the monograph. They all lay at the intersection of disciplines and provide a deep explanation of how the principles of dividing the information flow, fit to various communicative situations, mean primly the cultural decoding and encoding of messages. Achievement of pragmatic and intentional effects by the speech sender in the communication process is illustrated by a number of relevant examples of the most representative types of German-language media texts. It is the media text with its maximum communicative and functional potential that reflects the fine tuning by the solution of communicative and cognitive tasks; it distinctively manifests the influence and role of language cultures, which are optimal for confirming or refuting the theory postulated in the book.

Two-point FFT-based high capacity image steganography using calendar based message encoding

In this work, we show how to hide a maximum of 8 bits of secret data into the pixel difference value. Adjacent pixel pairs are chosen in a non-sequential manner in the spatial domain without using any seed or key. In spite of having high average embedding capacity and embedding efficiency, our algorithm can withstand visual, structural and statistical attacks. We compare our work with state-of-the-art works and also show that our work is capable of resisting the series of tests provided by the benchmark “StirMark”.

Improved lattice-based CCA2-secure PKE in the standard model

Based on the identity-based encryption (IBE) from lattices by Agrawal et al. (Eurocrypt’10), Micciancio and Peikert (Eurocrypt’12) presented a CCA1-secure public-key encryption (PKE), which has the best known efficiency in the standard model and can be used to obtain a CCA2-secure PKE from lattices by using the generic BCHK transform (SIAM J Comput, 2006) with a cost of introducing extra overheads to both computation and storage for the use of other primitives such as signatures and commitments. In this paper, we propose a more efficient standard model CCA2-secure PKE from lattices by carefully combining a different message encoding (which encodes the message into the most significant bits of the LWE’s “secret term”) with several nice algebraic properties of the tag-based lattice trapdoor and the LWE problem (such as unique witness and additive homomorphism). Compared to the best known lattice-based CCA1-secure PKE in the standard model due to Micciancio and Peikert (Eurocrypt’12), we not only directly achieve the CCA2-security without using any generic transform (and thus do not use signatures or commitments), but also reduce the noise parameter roughly by a factor of 3. This improvement makes our CCA2-secure PKE more efficient in terms of both computation and storage. In particular, when encrypting a 256-bit (respectively, 512-bit) message at 128-bit (respectively, 256-bit) security, the ciphertext size of our CCA2-secure PKE is even 33%–44% (respectively, 36%–46%) smaller than that of their CCA1-secure PKE.

Implementation Of Triangle Chain Cipher Algorithm in Security Message of Social Media

Messages sent on social media can be seen or used and obtained by others. Given the current many types of text messages that must not be known by others, or secret messages. Because social media is free, users cannot request security facilities for their messages. The triangle chain cipher algorithm is one of the encryption algorithms that operates based on classical encryption (cryptography), especially in character substitution techniques. Each character will be substituted based on the key and multiplier that has been determined based on the formula that applies in this algorithm. This algorithm encodes text messages twice and always depends on the results of the previous process. This is what underlies the complexity of solving this encryption coding algorithm. Encoding of messages especially in text messages is one of the most important things to do in improving the security of text messages from various levels of crime committed by people who are not entitled and not responsible. The implementation of the triangle chain cipher algorithm in encrypting text messages can make it difficult for anyone who is able to access and obtain text messages to understand and understand, damage, distribute, steal text messages or other actions that can harm the parties to the text message.

Single-Trace Attacks on Message Encoding in Lattice-Based KEMs

In this article, we propose single-trace side-channel attacks against lattice-based key encapsulation mechanisms (KEMs) that are the third-round candidates of the national institute of standards and technology (NIST) standardization project. Specifically, we analyze the message encoding operation in the encapsulation phase of lattice-based KEMs to obtain an ephemeral session key. We conclude that a single-trace leakage implies a whole key recovery: the experimental results realized on a ChipWhisperer UFO STM32F3 target board achieve a success rate of 100% for $\mathsf {CRYSTALS-KYBER}$ and $\mathsf {SABER}$ regardless of an optimization level and those greater than 79% for $\mathsf {FrodoKEM}$ . We further demonstrate that the proposed attack methodologies are not restricted to the above algorithms but are widely applicable to other NIST post-quantum cryptography (PQC) candidates, including $\mathsf {NTRU Prime}$ and $\mathsf {NTRU}$ .