Fake Messages Research Articles

Фейкові новини в українському медіапросторі: технології експериментальних проектів

The article considers dissemination of experimental fake messages by research organizations through analysis of media and audience feedback. The objective of the research is to study the main techniques of fake creation on the basis of experimental fakes traced in the Ukrainian information space. The methods used in the article are the following: analysis – to study the state of media landscape as to availability of fake news; the system method – to establish the ways of fake dissemination; the systematization method – to determine fakes’ features and characteristics. The preconditions, reasons and specifics of creation and intentional dissemination of false information in the society are studied in the article. As a result of the research, the role of pilot projects related to fake dissemination as part of popularization of ideas of media literacy and media education has been identified. It is analyzed the impact of experimental fake news on the media and the general public, in particular on dissemination of messages by the users in social networks. Simultaneously the thesis that regional journalists automatically rewrite and repost the Ukrainian mass media is refuted, as we have traced their professional response to dissemination of false information. The verification of facts (fact checking) is mandatory for journalists and necessary for every consumer of information, as making the media responsible for the facts is not an indication of media literacy.

Methods and Algorithms for Pseudo-probabilistic Encryption with Shared Key

As a method for providing security of the messages sent via a public channel in the case of potential coercive attacks there had been proposed algorithms and protocols of deniable encryption. The lasts are divided on the following types: 1) schemes with public key, 2) schemes with shares secret key, and 3) no-key schemes. There are introduced pseudo-probabilistic symmetric ciphers that represent a particular variant of implementing deniable encryption algorithms. It is discussed application of the pseudo-probabilistic encryption for constructing special mechanisms of the information protection including steganographic channels hidden in ciphertexts. There are considered methods for designing stream and block pseudo-probabilistic encryption algorithms that implement simultaneous ciphering fake and secret messages so that the generated ciphertext is computationally indistinguishable from the ciphertext obtained as output of the probabilistic encryption of the fake message. The requirement of the ciphertext indistinguishability from the probabilistic encryption has been used as one of the design criteria. To implement this criterion in the construction scheme of the pseudo-probabilistic ciphers it is included step of bijective mapping pairs of intermediate ciphertext blocks of the fake and secret messages into a single expanded block of the output ciphertext. Implementations of the pseudo-probabilistic block ciphers in which algorithms for recovering the fake and secret messages coincide completely are also considered. There are proposed general approaches to constructing no-key encryption protocols and randomized pseudo-probabilistic block ciphers. Concrete implementations of the cryptoschemes of such types are presented.

TrustVote: Privacy-Preserving Node Ranking in Vehicular Networks

The Internet of Vehicles is the network of connected vehicles and transport infrastructure units [roadside units (RSUs)], which utilizes emerging wireless systems (4G, 5G, LTE) for the communication and sharing of information. The network of connected vehicles enables users to disseminate critical information about events happening on the road (for example, accidents, traffic congestions, and hazards). The exchange of information between vehicles and RSUs could improve the driving experience and road safety, as well as help drivers to identify the hazardous and safe routes in a timely manner. The sharing of critical information between vehicles is advantageous to the driver; however, at the same time, malicious actors could mislead drivers by spreading fraudulent and fake messages. Fraudulent messages can have a negative impact on the infrastructure, and more significantly, have potential to cause threats to life. It is, therefore, essential that vehicles can evaluate the credibility of those who send messages (vehicles or RSUs) before taking any action. In this paper, we present TrustVote, a collaborative crowdsourcing-based vehicle reputation system that enables vehicles to evaluate the credibility of other vehicles in a connected vehicular network. The TrustVote system allows participating vehicles to hide their rating/feedback scores and the list of interacted vehicles under a homomorphic cryptographic layer, which can only be unfolded as an aggregate. The proposed approach also considers the trust weight of a vehicle providing the rating scores while computing the aggregate reputation of the vehicles. A prototype of TrustVote is developed and its performance is evaluated in terms of the computational and communication overheads.

Password typographical error resilience in honey encryption

Honey encryption (HE) is a novel password-based encryption scheme that is secure against brute-force attacks even if users’ passwords have min-entropy. However, in HE, decryption with an incorrect key produces fake messages that appear valid. Hence, password typographical errors may confuse even legitimate users. This has been one of the most challenging problems in HE. To tackle this challenge, we propose three types of protocols that enable legitimate users to detect password typographical errors in HE. We conducted a theoretical analysis and performed an IRB-approved user study with 150 participants to compare the performance of each scheme. We also analyzed the security of the proposed schemes against online and offline brute-force attacks. The results from the user study and theoretical analysis show that the proposed schemes can effectively solve the typographical error problem of HE, which can detect typographical errors with 99% accuracy.

Authenticating On-Body Backscatter by Exploiting Propagation Signatures

The vision of battery-free communication has made backscatter a compelling technology for on-body wearable and implantable devices. Recent advances have facilitated the communication between backscatter tags and on-body smart devices. These studies have focused on the communication dimension, while the security dimension remains vulnerable. It has been demonstrated that wireless connectivity can be exploited to send unauthorized commands or fake messages that result in device malfunctioning. The key challenge in defending these attacks stems from the minimalist design in backscatter. Thus, in this paper, we explore the feasibility of authenticating an on-body backscatter tag without modifying its signal or protocol. We present SecureScatter, a physical-layer solution that delegates the security of backscatter to an on-body smart device. To this end, we profile the on-body propagation paths of backscatter links, and construct highly sensitive propagation signatures to identify on-body backscatter links. We implement our design in a software radio and evaluate it with different backscatter tags that work at 2.4 GHz and 900 MHz. Results show that our system can identify on-body devices at 93.23% average true positive rate and 3.18% average false positive rate.

Keyless Authentication and Authenticated Capacity

We consider the problem of keyless message authentication over noisy channels in the presence of an active adversary. Different from the existing models, in our model, the legitimate users do not have any pre-shared key for authentication. Instead, we use the noisy channel connecting the legitimate users for authentication. The main idea is to utilize the noisy channel connecting the legitimate users to distinguish a legitimate message from a fake message, by generating an output at the receiver that is difficult for the adversary to replicate through its noisy channel. By interpreting the message authentication as a hypothesis testing problem, we investigate the authentication exponent and the authenticated channel capacity of the noisy channel. In the authentication exponent problem, for a given message rate, we investigate the speed at which the optimal successful attack probability can be driven to zero. We fully characterize the authentication exponent for the zero-rate message case and provide both an upper bound and a lower bound on the exponent for the non-zero message rate case. In the authenticated capacity problem, we study the largest data transmission rate under which the attacker’s optimal successful attack probability can still be made arbitrarily small. We establish an all or nothing result. In particular, we show that the authenticated channel capacity is the same as the classic channel capacity if a simulatability condition is not satisfied, while the authenticated capacity will be zero if this condition is satisfied. We also provide efficient algorithms to check this condition. We further show that our results are robust to modeling uncertainties about the eavesdropper’s channels.

Pseudo-probabilistic block ciphers and their randomization

There is considered implementation of the plan-ahead share-key deniable encryption algorithms that produce the cryptogram that satisfy criterion of the computational indistinguishability from probabilistic encryption of the fake message. This paper introduces a general design of the pseudo-probabilistic block ciphers. The proposed method includes encryption of the secret message block and the fake message block followed by a transformation procedure mapping the pair of intermediate ciphertext blocks into a single block of the output ciphertext. The transformation procedure is implemented in the following two variants: (1) simultaneous encryption of the intermediate ciphertext blocks and (2) solving the system of two linear congruencies. The second variant provides natural possibility to construct pseudo-probabilistic block ciphers in which recovering fake or secret message is performed using the same single decryption algorithm. To provide higher security there are proposed randomized pseudo-probabilistic ciphers. There are also considered designs with different size of the input data blocks corresponding to fake and secret messages.

Anonymity-based intra–inter and multiple layer service dependent security-aware packet scheduling algorithm (AIIMLSDSPS)

ABSTRACTThe concept of anonymity is included for enhancing the efficiency of security aware packet scheduling by introducing, Anonymity-based Intra and inter and multiple layer service dependent security aware packet scheduling algorithm (AIIMLSDSPS). The anonymity of the source locations are often violated by the intruders through traffic analysis and RF localization techniques. The proposed fake source-location method produces the fake sources into the network in order to confuse the intruder. When the original sources send event messages with secured routing policy, the fake sources are generated dynamically. Fake sources then construct several fake paths in the network. Thus, the proposed fake source-location method minimizes the chances of intrusion and reduces the packet loss with minimal latency and reduced overhead. However, as number of fake paths and fake messages increases, energy consumption of each source is also increases.

DoS Attacks in Internet of Things

The Internet of Things (IoT) defines a highly interconnected network of heterogeneous devices where all kinds of communications seem to be possible, even unauthorized ones. As a result, the security requirement for such network becomes critical whilst common standard Internet security protocols are recognized as unusable in this type of networks, particularly due to some classes of IoT devices with constrained resources. Due to the limitations of energy, computation and storage for sensors, although IoT have been widely deployed in many applications such as military, ecological and health-related areas. It is a critical challenge to present the effective and lightweight security protocol to prevent various attacks for IoT, especially for the denial of service (DoS) attack. Normally, the adversaries compromise sensors and launch the DoS attack by replaying redundant messages or making overdose of fake messages. In this paper, we explore the scope of the DoS attack problem in IoT. First we outline the constraints, security requirements, and then explore types of DoS attacks in IoT.

To Share or Not to Share: Tabayyun Made Possible with MyVeri5

The advent of technology today allows us to stay connected with family and friends, especially through social media applications, where communication can take place easily and in a timely manner. Most of the time we use the applications to share important information and urgent messages or news with our dearest ones because we care. But time and time again, we see headlines highlighting the misuse of these applications to spread false rumors and its damaging impacts. From the point of view of technology, there is almost no help at all in verifying the genuineness of a message shared. Users have to go great lengths to verify the news, but responsible users are not common these days. Furthermore the urgency of these messages sometimes calls to our natural instinct to protect our loved ones. Motivated by this challenge, we propose a mobile application; MyVeri5, to facilitate in checking the genuine status of messages. Through MyVeri5, users who want to verify a message can request to do so by forwarding said messages to the system’s server. The system’s server will forward the message to appointed authorized verifiers from appropriate domains for verification. The verified status of the message will be returned to the requesting user, along with his immediate friends list. MyVeri5 has the potential to minimize the impact of fake messages socially and economically, while still servicing the need for urgency to inform the loved ones. It also supports and upholds the concept of tabayyun, which advocates investigation of news before action and dissemination.

On “A new quantum blind signature with unlinkability”

This article points out a security loophole in Shi et al.'s quantum blind signature scheme. By using the modification attack, a message owner can cheat a signature receiver with a fake message---signature pair without being detected.

Trustworthy Event-Information Dissemination in Vehicular Ad Hoc Networks

In vehicular networks, trustworthiness of exchanged messages is very important since a fake message might incur catastrophic accidents on the road. In this paper, we propose a new scheme to disseminate trustworthy event information while mitigating message modification attack and fake message generation attack. Our scheme attempts to suppress those attacks by exchanging the trust level information of adjacent vehicles and using a two-step procedure. In the first step, each vehicle attempts to determine the trust level, which is referred to as truth-telling probability, of adjacent vehicles. The truth-telling probability is estimated based on the average of opinions of adjacent vehicles, and we apply a new clustering technique to mitigate the effect of malicious vehicles on this estimation by removing their opinions as outliers. Once the truth-telling probability is determined, the trustworthiness of a given message is determined in the second step by applying a modified threshold random walk (TRW) to the opinions of the majority group obtained in the first step. We compare our scheme with other schemes using simulation for several scenarios. The simulation results show that our proposed scheme has a low false decision probability and can efficiently disseminate trustworthy event information to neighboring vehicles in VANET.

Screening the covert key using honey encryption to rule out the brute force attack of AES—a survey

AbstractRecently, the major challenging attack is the side channel attack for both symmetric and asymmetric algorithm. Because in both cases, the secret key has to be sent out via a safe secured channel. The advanced encryption standard (AES) is mentioned as the best standard encryption algorithm by the US government, but there is one major attack on the AES that is the brute force attack. So, how to rule out these kinds of attack and how it is implemented effectively in hardware are being discussed in this paper. The honey encryption scheme is an effective algorithm, and it is also being discussed. In this paper, the detailed description of the AES and the methods to improve its speed and how it is integrated with the honey technique have been discussed. The different kinds of attacks and the various solutions are discussed for both of the algorithms. A survey of papers which has used these algorithms for various reasons with different perspective has been given. The honey algorithm creates the fake message for the wrong try of the key puncher. Thus, this is considered as the best algorithm, but it is also has some disadvantages that is also focussed in our survey. Copyright © 2017 John Wiley & Sons, Ltd.

Source Anonymity in WSNs against Global Adversary Utilizing Low Transmission Rates with Delay Constraints.

Wireless sensor networks (WSN) are deployed for many applications such as tracking and monitoring of endangered species, military applications, etc. which require anonymity of the origin, known as Source Location Privacy (SLP). The aim in SLP is to prevent unauthorized observers from tracing the source of a real event by analyzing the traffic in the network. Previous approaches to SLP such as Fortified Anonymous Communication Protocol (FACP) employ transmission of real or fake packets in every time slot, which is inefficient. To overcome this shortcoming, we developed three different techniques presented in this paper. Dummy Uniform Distribution (DUD), Dummy Adaptive Distribution (DAD) and Controlled Dummy Adaptive Distribution (CAD) were developed to overcome the anonymity problem against a global adversary (which has the capability of analyzing and monitoring the entire network). Most of the current techniques try to prevent the adversary from perceiving the location and time of the real event whereas our proposed techniques confuse the adversary about the existence of the real event by introducing low rate fake messages, which subsequently lead to location and time privacy. Simulation results demonstrate that the proposed techniques provide reasonable delivery ratio, delay, and overhead of a real event's packets while keeping a high level of anonymity. Three different analysis models are conducted to verify the performance of our techniques. A visualization of the simulation data is performed to confirm anonymity. Further, neural network models are developed to ensure that the introduced techniques preserve SLP. Finally, a steganography model based on probability is implemented to prove the anonymity of the techniques.

FMSLPP: fake-message based sink location privacy preservation for WSNs against global eavesdroppers

Traditional encryption and authentication methods are not effective in preserving sink’s location privacy from a global adversary that could be monitoring the network’s traffic and time-of-arrival of traffic flows. In this paper, we present a novel method named fake-message based sink location privacy preservation (FMSLPP) to protect sink’s location privacy against global eavesdroppers. In this method, we let sensors generate fake messages with a probability before the sink sends a message, in order to confuse an adversary about the sink’s location. We also make each node have approximately the same traffic volume to protect the sink’s location privacy. Simulation results from two approaches of sensor deployment (random deployment or controlled deployment) indicate that FMSLPP makes it very difficult for the global adversary to identify the location of the sink; at the same time, transmission of fake messages does not impact significantly the network’s performance in terms of network life.

Black hole Attack Detection in AODV-BTR MANET

Security is a vital requirement in mobile ad hoc networks to provide secured communication among mobile nodes. Due to different characteristics of MANETS, it creates a number of consequential challenges to its security design. To overcome the challenges, there is a need to build a powerful security solution that achieves both broad protection and desirable network performance. Mobile Ad hoc Network (MANET) has emerged as a new leading edge of technology to provide communication wherever and whenever required. As the wired network needs established infrastructure for communication but the mobile ad hoc network does not need any infrastructure, centralized management and control. Due to movable nature of nodes in Mobilead hoc network difficult routing between nodes are not very easy task. For this purpose many reactive routing protocols have been implemented like AODV, DSR, and DSDV. In the first part of this work, we propose a new algorithm AODV-BTR to improve existing on demand routing protocol and an attempt has been made to compare the performance of proposed algorithm (AODV-BTR) with existing algorithm AODV. Ad hoc networks are susceptible to many types of attacks; due tomovable nature of nodes it is very difficult to provide security at each node. This paper introduces the black hole attack; in this type of attack mischievous node announce that he is having the shortest path to all nodes in the environment by sending fake route reply message. This paper proposes an easiest way to detect Black hole attacks using DLM technique. DML method presents the solution to detect & remove blackhole attack in reactive protocol called AODV-BTR.

Vehicular Ad hoc Networks: A hybrid approach to data dissemination in exigency situations

Vehicular Ad hoc Network (VANET) is a type of mobile ad hoc network based on short range communications among vehicles moving on roads and between moving vehicles and road side units. Endangerment situations occur when a vehicle met with an accident at accident prone areas. Due to problem of high mobility and dynamic topology the performance of messaging in VANET ceases. To have sustainability in cross-correlated situations the pooling data acquisition requires data collection from multiple sources. In this paper, the data collection is done using Sensors and radio frequency identification (RFID) tags. The raw data collected by the sensors is optimized using Ant-Colony optimization for selecting shortest path dynamically to crossover the danger zone. The data detected by RFID tags is optimized using Artificial Bee Colony algorithm to obtain the information already collected by neighboring nodes. The information collected by VANET nodes will be cross-verified by authenticating with the Web Server for preventing fake message transmission over the network. The multivariate traffic data is well-kept at Web Server for smooth transmission of emergency messages. The process of preserving multivariate data provides elegant solution even on the part of signal failures in global system for mobile communications.

Accessing Social Network Sites Using Work Smartphone for Face Recognition and Authentication

Nowadays, Social Networking Sites (SNS) are increasingly getting the attention of academic, industrial researchers intrigued by their affordances and gradually gaining its importance and became a major method used to share thoughts, video, image, etc., in various domains such as research, politics, religion, academics and development. Apart of its strength points SNS has one major drawback which is the inefficient authentication of users to login. Due to this drawback; different types of fake message, non-social activities, national or personal threats, Numbers, videos and other important things are used for extortion people, which can be posted by some imposters or non-social personals. In spite of the importance of authentication in the social network, a handful number of researches conducted such accessing social network using efficient authentication technique to solve this problem. This study proposed a method to access a social network sites (such as Facebook and twitter) using face recognition techniques at the time of login in the site by Smartphones. Where Local Binary Pattern (LBP) was used to detect users face and the LBP histogram was used for features extraction. The proposed method obtained very promising results in term of accuracy (93.5%) and effectiveness for authentication of user identity.

VANET- based Vehicle Tacking on Message Authentication and Secure Navigation Route

Computing real-time road condition is really tough and it is not achieved using GPS. However, a malicious node can create multiple virtual identities for transmitting fake messages using different forged positions. A malicious vehicle can disseminate false traffic information in order to force other vehicles and vehicular authorities to take incorrect decisions.To overcome these difficulties we propose that vehicle should be authenticated by Trusted Authority (TA) via RSU, only then the navigation query sent to RSU through tamper proof device (in the Vehicle) for identifying best destination route. After authentication, TA generates a reencryption key to requested vehicle for encrypting the query. Based on vehicle request, contacted RSU identifies the shortest path to reach the destination RSU by passing the vehicle request to neighbouring RSU’s. After identification of shortest path, it sends the encrypted message to requested vehicle using re-encryption key. Finally it decrypts the message using its own private key. Moreover, the network checks each vehicle speed for avoid accident based on predecessor and successor vehicle’s speed using chord algorithm. It also implementing priority based vehicle movement so, Network gives high priority in emergency vehicle, it gives medium priority for registered vehicle and it gives low priority for unregistered vehicle.

A Contemporary Solution to Ferret Out and Obviate the Fake Messages in Vehicular Ad Hoc Networks by not Percolating through Web Server

Ad hoc networks are suitable for wide range applications like battlefields, analyzing traffic and during disaster recovery operations. With the development of Vehicular Ad hoc Networks the transmission of emergency messages is considerably progressed to accelerate traffic safety measures. As vehicles communicate with each other by connecting through Internet and by using Road Side Units (RSI), there will be each and every possibility to transmit fake messages by accessing VANET Server by unfair means. This requires attention of filtering of messages before transmission over the network through the Server. In this paper, the proposed approach provides a magnificent solution in identifying and obstructing fake messages before passing through the Server. This leads to attempt a contemporary approach in blocking fake messages that helps in causing unwanted disturbance to the traffic instantly. In addition to that the intended process gives a clear analysis in storing of the sender along with the timely analysis of message transmission for tracking source. Obviously this outperforms in trusting the alerts of post-crash notifications and reducing security issues in VANETs.