A new scheme for transmitting sensitive data is proposed, the proposed scheme depends on partitioning the output of a block encryption module using the Chinese Remainder Theorem among a set of channels. The purpose of using the Chinese Remainder Theorem is to hide the cipher text in order to increase the difficulty of attacking the cipher. The theory, implementation and the security of this scheme are described in this paper.
We investigate the problem of secure message transmission in the presence of a "fully generalised" adversary, who disrupts and listens to separate sets of communication wires. We extend previous results by considering the case when these sets may have arbitrary size, providing necessary and sufficient conditions for both one-way and two-way communication.
This paper presents a spatial encryption technique for secured transmission of data in networks. The algorithm is designed to break the ciphered data packets into multiple data which are to be packaged into a spatial template. A secure and efficient mechanism is provided to convey the information that is necessary for obtaining the original data at the receiver-end from its parts in the packets. An authentication code (MAC) is also used to ensure authenticity of every packet.
The Internet is a ubiquitous and affordable communications network suited for e-commerce and medical image communications. Security has become a major issue as data communication channels can be intruded by intruders during transmission. Though, different methods have been proposed and used to protect the transmission of data from illegal and unauthorized access, code breakers have come up with various methods to crack them. DNA based Cryptography brings forward a new hope for unbreakable algorithms. This paper outlines an encryption scheme with DNA technology and JPEG Zigzag Coding for Secure…
We know that large amount of data and information should be transmitted through internet during transactions in E-Governance. Smart E-Governance system should deliver speedy, space efficient, cost effective and secure services among other governments and its citizens utilizing benefits of Information and Communication Technologies (ICT). This paper proposes to develop a space efficient and secured data transmission scheme using Modified Huffman algorithm for compression, which will also yield better bandwidth utilization and inner encryption technique with one way hash function SHA (Secured Ha…
The pilot spoofing attack is considered as an active eavesdropping activity launched by an adversary during the reverse channel training phase. By transmitting the same pilot signal as the legitimate user, the pilot spoofing attack is able to degrade the quality of legitimate transmission and, more severely, facilitate eavesdropping. In an effort to detect the pilot spoofing attack and minimize its damages, in this paper we propose a novel random-training-assisted (RTA) pilot spoofing detection algorithm. In particular, we develop a new training mechanism by adding a random training phase afte…
We propose a novel system for optical encryption based on an optical XOR and optical Linear Feedback Shift Register (oLFSRs). Though we choose LFSR for its ability to process optical signals at line rate, we consider the fact that it offers no cryptographic security. To address the security shortfall, we propose implementation of parallel oLFSRs, whereby the resulting key-stream at line rate is controlled electronically by a nonlinear random number generator at speeds much lower than the optical line rate, which makes the system practically relevant. The analysis of computational security show…
As long as human beings exist on this earth, there will be confidential images intended for limited audience. These images have to be transmitted in such a way that no unauthorized person gets knowledge of them. DNA sequences play a vital role in modern cryptography and DNA sequence based cryptography renders a helping hand for transmission of such confidential images over a public insecure channel as the intended recipient alone can decipher them. This paper outlines an integrated encryption scheme based on DNA sequences and scrambling according to magic square of doubly even order pattern. S…
Privacy Preserving Data Mining is a method which ensures privacy of individual information during mining. Most important task involves retrieving information from multiple data bases which is distributed. The data once in the data warehouse can be used by mining algorithms to retrieve confidential information. The proposed framework has two major tasks, secure transmission and privacy of confidential information during mining. Secure transmission is handled by using elliptic curve cryptography and data distortion for privacy preservation ensuring highly secure environment.
As wireless network technology becomes more and more popular, mutual interference between various signals has become more and more severe and common. Therefore, there is often a situation in which the transmission of its own signal is interfered with by occupying the channel. Especially in a confrontational environment, Jamming has caused great harm to the security of information transmission. So I propose ML-based secure ultra-low power communication, which is an approach to use machine learning to predict future wireless traffic by capturing patterns of past wireless traffic to ensure ultra-…
In Wireless sensor networks (WSNs), All communications between different nodes are sent out in a broadcast fashion. These networks are used in a variety of applications including military, environmental, and smart spaces. Sensors are susceptible to various types of attack, such as data modification, data insertion and deletion, or even physical capture and sensor replacement. Hence security becomes important issue in WSNs. However given the fact that sensors are resources constrained, hence the traditional intensive security algorithms are not well suited for WSNs. This makes traditional secur…
Achieving secure communications in networks has been one of the most important problems in information technology. Dolev, Dwork, Waarts, and Yung have studied secure message transmission in one-way or two-way channels. They only consider the case when all channels are two-way or all channels are one-way. Goldreich, Goldwasser, and Linial, Franklin and Yung, Franklin and Wright, and Wang and Desmedt have studied secure communication and secure computation in multi-recipient (multicast) models. In a ``multicast channel'' (such as Ethernet), one processor can send the same message--simultaneously…
During today's digital age, emails have become a crucial part of communications for both personal and enterprise usage. However, email transmission protocols were not designed with security in mind, and this has always been a challenge while trying to make email transmission more secure. On top of the basic layer of SMTP, POP3, and IMAP protocols to send and retrieve emails, there are several other major security protocols used in current days to secure email transmission such as TLS/SSL, STARTTLS, and PGP/GPG encryption. The most general design used in email transmission architecture is SMTP …
In the model that has become known as "Perfectly Secure Message Transmission"(PSMT), a sender Alice is connected to a receiver Bob through n parallel two-way channels. A computationally unbounded adversary Eve controls t of these channels, meaning she can acquire and alter any data that is transmitted over these channels. The sender Alice wishes to communicate a secret message to Bob privately and reliably, i.e. in such a way that Eve will not get any information about the message while Bob will be able to recover it completely. In this paper, we focus on protocols that work in two transmissio…
We present the design and implementation of the PeerShare, a system that can be used by applications to securely distribute sensitive data to social contacts of a user. PeerShare incorporates a generic framework that allows different applications to distribute data with different security requirements. By using interfaces available from existing popular social networks. PeerShare is designed to be easy to use for both end users as well as developers of applications. PeerShare can be used to distribute shared keys, public keys and any other data that need to be distributed with authenticity and…
Providing the ability to any law enforcement officer to remotely transfer an image from any suspect computer directly to a forensic laboratory for analysis, can only help to greatly reduce the time wasted by forensic investigators in conducting on-site collection of computer equipment. RAFT (Remote Acquisition Forensic Tool) is a system designed to facilitate forensic investigators by remotely gathering digital evidence. This is achieved through the implementation of a secure, verifiable client/server imaging architecture. The RAFT system is designed to be relatively easy to use, requiring min…
Biometrics deals with identity verification of an individual by using certain physiological or behavioral features associated with a person. Biometric identification systems using fingerprints patterns are called AFIS (Automatic Fingerprint Identification System). In this paper a composite method for Fingerprint recognition is considered using a combination of Fast Fourier Transform (FFT) and Sobel Filters for improvement of a poor quality fingerprint image. Steganography hides messages inside other messages in such a way that an "adversary" would not even know a secret message were present. T…
Wireless Sensor Networks (WSNs) are memory and bandwidth limited networks whose main goals are to maximize the network lifetime and minimize the energy consumption and transmission cost. To achieve these goals, dif ferent techniques of compression and clustering have been used. However, security is an open and major issue in WSNs for which different approaches are used, both in centralized and distributed WSNs' environments. This paper presents an adaptive cryptographic scheme for secure transmission of various sensitive parameters, sensed by wireless sensors to the fusion center for further p…
Relay transmission can enhance coverage and throughput, while it can be vulnerable to eavesdropping attacks due to the additional transmission of the source message at the relay. Thus, whether or not one should use relay transmission for secure communication is an interesting and important problem. In this paper, we consider the transmission of a confidential message from a source to a destination in a decentralized wireless network in the presence of randomly distributed eavesdroppers. The source-destination pair can be potentially assisted by randomly distributed relays. For an arbitrary rel…
We consider the problem of perfect (information-theoretically) secure message transmission (PSMT) from a sender $S$ to a receiver $R$ in asynchronous directed networks tolerating dual adversary. The adversary can control at most $t_p$ nodes in a passive fashion and at most $t_f$ nodes in a fail-stop fashion. We achieve PSMT in this setting with a new class of message transmission protocols called the quiescent protocols. Quiescent protocols ensure that the players eventually stop sending messages but in contrast to the usual terminating protocols, these protocols do not require the players to …
An important class of cryptographic applications of relativistic quantum information work as follows. B generates a random qudit and supplies it to A at point P. A is supposed to transmit it at near light speed c to to one of a number of possible pairwise spacelike separated points Q1; : : : ;Qn. A's transmission is supposed to be secure, in the sense that B cannot tell in advance which Qj will be chosen. This poses significant practical challenges, since secure reliable long-range transmission of quantum data at speeds near to c is presently not easy. Here we propose different techniques to o…
Mobile applications (apps) often transmit sensitive data through network with various intentions. Some transmissions are needed to fulfill the app's functionalities. However, transmissions with malicious receivers may lead to privacy leakage and tend to behave stealthily to evade detection. The problem is twofold: how does one unveil sensitive transmissions in mobile apps, and given a sensitive transmission, how does one determine if it is legitimate? In this paper, we propose LeakSemantic, a framework that can automatically locate abnormal sensitive network transmissions from mobile apps. Lea…
High performance computing clusters operating in shared and batch mode pose challenges for processing sensitive data. In the meantime, the need for secure processing of sensitive data on HPC system is growing. In this work we present a novel method for creating secure computing environments on traditional multi-tenant high-performance computing clusters. Our platform as a service provides a customizable, virtualized solution using PCOCC and SLURM to meet strict security requirements without modifying the exist-ing HPC infrastructure. We show how this platform has been used in real-world resear…
In wireless sensor networks (WSNs), the Eschenauer-Gligor (EG) key pre-distribution scheme is a widely recognized way to secure communications. Although connectivity properties of secure WSNs with the EG scheme have been extensively investigated, few results address physical transmission constraints. These constraints reflect real-world implementations of WSNs in which two sensors have to be within a certain distance from each other to communicate. In this paper, we present zero-one laws for connectivity in WSNs employing the EG scheme under transmission constraints. These laws help specify th…
Quantum key distribution (QKD) provides theoretic information security in communications based on the laws of quantum physics. In this work, we report an implementation of quantum-secured data transmission in the infrastructure of Sberbank of Russia in standard communication lines in Moscow. The experiment is realized on the basis of already deployed urban fiber-optics communication channels with significant losses. We realize the decoy-state BB84 QKD protocol using the one-way scheme with polarization encoding for generating keys. Quantum-generated keys are then used for continuous key renewa…
In a secure message transmission (SMT) scenario a sender wants to send a message in a private and reliable way to a receiver. Sender and receiver are connected by $n$ vertex disjoint paths, referred to as wires, $t$ of which can be controlled by an adaptive adversary with unlimited computational resources. In Eurocrypt 2008, Garay and Ostrovsky considered an SMT scenario where sender and receiver have access to a public discussion channel and showed that secure and reliable communication is possible when $n \geq t+1$. In this paper we will show that a secure protocol requires at least 3 rounds…
In this paper, we present an identity (ID) based protocol that secures AODV and TCP so that it can be used in dynamic and attack prone environments of mobile ad hoc networks. The proposed protocol protects AODV using Sequential Aggregate Signatures (SAS) based on RSA. It also generates a session key for each pair of source-destination nodes of a MANET for securing the end-to-end transmitted data. Here each node has an ID which is evaluated from its public key and the messages that are sent are authenticated with a signature/ MAC. The proposed scheme does not allow a node to change its ID throu…
This work considers the secure and reliable information transmission in two-hop relay wireless networks without the information of both eavesdropper channels and locations. While the previous work on this problem mainly studied infinite networks and their asymptotic behavior and scaling law results, this papers focuses on a more practical network with finite number of system nodes and explores the corresponding exact results on the number of eavesdroppers the network can tolerant to ensure a desired secrecy and reliability. For achieving secure and reliable information transmission in a finite…
Secure Message Transmission (SMT) is a two-party cryptographic protocol by which the sender can securely and reliably transmit messages to the receiver using multiple channels. An adversary can corrupt a subset of the channels and commit eavesdropping and tampering attacks over the channels. In this work, we introduce a game-theoretic security model for SMT in which adversaries have some preferences for protocol execution. We define rational "timid" adversaries who prefer to violate security requirements but do not prefer the tampering to be detected. First, we consider the basic setting where…
We study the secure lossy transmission of a vector Gaussian source to a legitimate user in the presence of an eavesdropper, where both the legitimate user and the eavesdropper have vector Gaussian side information. The aim of the transmitter is to describe the source to the legitimate user in a way that the legitimate user can reconstruct the source within a certain distortion level while the eavesdropper is kept ignorant of the source as much as possible as measured by the equivocation. We obtain an outer bound for the rate, equivocation and distortion region of this secure lossy transmission…
This letter focuses on the physical layer security over two-user multiple-input multiple-output (MIMO) non-orthogonal multiple access (NOMA) networks. A linear precoding technique is designed to ensure the confidentiality of the message of each user from its counterpart. This technique first splits the base station power between the two users and, based on that, decomposes the secure MIMO-NOMA channel into two MIMO wiretap channels, and designs the transmit covariance matrix for each channel separately. The proposed method substantially enlarges the secrecy rate compared to existing linear pre…
In wireless sensor networks, the $q$-composite key predistribution scheme is a widely recognized way to secure communications. Although connectivity properties of secure sensor networks with the $q$-composite scheme have been studied in the literature, few results address physical transmission constraints since it is challenging to analyze the network connectivity in consideration of both the $q$-composite scheme and transmission constraints together. These transmission constraints reflect real-world implementations of sensor networks in which two sensors have to be within a certain distance f…
This work considers secure transmission protocol for flexible load-balance control in two-hop relay wireless networks without the information of both eavesdropper channels and locations. The available secure transmission protocols via relay cooperation in physical layer secrecy framework cannot provide a flexible load-balance control, which may significantly limit their application scopes. This paper extends the conventional works and proposes a general transmission protocol with considering load-balance control, in which the relay is randomly selected from the first $k$ preferable assistant r…
As computer systems become more pervasive and complex, security is increasingly important. Secure Transmission refers to the transfer of data such as confidential or proprietary information over a secure channel. Many secure transmission methods require a type of encryption. Secure transmissions are put in place to prevent attacks such as ARP spoofing and general data loss. Hence, in order to provide a better security mechanism, in this paper we propose Enhanced Tiny Encryption Algorithm with Embedding (ETEA), a data hiding technique called steganography along with the technique of encryption …
Information leakage rate is an intuitive metric that reflects the level of security in a wireless communication system, however, there are few studies taking it into consideration. Existing work on information leakage rate has two major limitations due to the complicated expression for the leakage rate: 1) the analytical and numerical results give few insights into the trade-off between system throughput and information leakage rate; 2) and the corresponding optimal designs of transmission rates are not analytically tractable. To overcome such limitations and obtain an in-depth understanding o…
In this paper, we study the problem of secure transmission with covert requirement in untrusted relaying networks. Our considered system model consists of one source, one destination, one untrusted relay, and one Willie. The untrusted relay tries to extract the information signal, while the goal of Willie is to detect the presence of the information signal transmitted by the source, in the current time slot. To overcome these two attacks, we illustrate that the destination and the source should inject jamming signal to the network in phase I and phase II, respectively. Accordingly, the communi…
Internet is one of the most valuable resources for information communication and retrievals. Most multimedia signals today are in digital formats. The digital data can be duplicated and edited with great ease which has led to a need for data integrity and protection of digital data. The security requirements such as integrity or data authentication can be met by implementing security measures using digital watermarking techniques. In this paper a blind speech watermarking algorithm that embeds the watermark signal data in the musical (sequence) host signal by using frequency masking is used. A…
In this paper, wireless power transfer and cooperative jamming (CJ) are combined to enhance physical security in public transportation networks. First, a new secure system model with both fixed and mobile jammers is proposed to guarantee secrecy in the worst-case scenario. All jammers are endowed with energy harvesting (EH) capability. Following this, two CJ based schemes, namely B-CJ-SRM and B-CJ-TPM, are proposed, where SRM and TPM are short for secrecy rate maximization and transmit power minimization, respectively. They respectively maximize the secrecy rate (SR) with transmit power constr…
This work considers the problem of secure and reliable information transmission via relay cooperation in two-hop relay wireless networks without the information of both eavesdropper channels and locations. While previous work on this problem mainly studied infinite networks and their asymptotic behavior and scaling law results, this papers focuses on a more practical network with finite number of system nodes and explores the corresponding exact result on the number of eavesdroppers one network can tolerant to ensure desired secrecy and reliability. We first study the scenario where path-loss …
In this paper, we propose a self-dependent two-way secure communication where two sources exchange confidential messages via a wireless powered untrusted amplify-and-forward (AF) relay and friendly jammer (FJ). By adopting the time switching (TS) architecture at the relay, the data transmission is accomplished in three phases: Phase I) Energy harvesting by the untrusted relay and the FJ through non-information transmissions from the sources, Phase II) Information transmission by the sources and jamming transmissions from the FJ to reduce information leakage to the untrusted relay; and Phase II…
This work considers load-balance control among the relays under the secure transmission protocol via relay cooperation in two-hop wireless networks without the information of both eavesdropper channels and locations. The available two-hop secure transmission protocols in physical layer secrecy framework cannot provide a flexible load-balance control, which may significantly limit their application scopes. This paper proposes a secure transmission protocol in case that the path-loss is identical between all pairs of nodes, in which the relay is randomly selected from the first $k$ preferable as…
Despite extensive research on cryptography, secure and efficient query processing over outsourced data remains an open challenge. This paper continues along with the emerging trend in secure data processing that recognizes that the entire dataset may not be sensitive, and hence, non-sensitivity of data can be exploited to overcome limitations of existing encryption-based approaches. We, first, provide a new security definition, entitled partitioned data security for guaranteeing that the joint processing of non-sensitive data (in cleartext) and sensitive data (in encrypted form) does not lead …
We have evaluated the optimal secrecy rate for Amplify-and-Forward (AF) relay networks with multiple eavesdroppers. Assuming i.i.d. Gaussian noise at the destination and the eavesdroppers, we have devised technique to calculate optimal scaling factor for relay nodes to obtain optimal secrecy rate under both sum power constraint and individual power constraint. Initially, we have considered special channel conditions for both destination and eavesdroppers, which led us to analytical solution of the problem. Contrarily, the general scenario being a non-convex optimization problem, not only lacks…
Wireless physical-layer security is an emerging field of research aiming at preventing eavesdropping in an open wireless medium. In this paper, we propose a novel waveform design approach to minimize the likelihood that a message transmitted between trusted single-antenna nodes is intercepted by an eavesdropper. In particular, with knowledge first of the eavesdropper's channel state information (CSI), we find the optimum waveform and transmit energy that minimize the signal-to-interference-plus-noise ratio (SINR) at the output of the eavesdropper's maximum-SINR linear filter, while at the same…
The problem of $A$ privately transmitting information to $B$ by a public announcement overheard by an eavesdropper $C$ is considered. To do so by a deterministic protocol, their inputs must be correlated. Dependent inputs are represented using a deck of cards. There is a publicly known signature $(a,b,c)$, where $n = a + b + c + r$, and $A$ gets $a$ cards, $B$ gets $b$ cards, and $C$ gets $c$ cards, out of the deck of $n$ cards. Using a deterministic protocol, $A$ decides its announcement based on her hand. Using techniques from coding theory, Johnson graphs, and additive number theory, a nove…
Wyner's work on wiretap channels and the recent works on information theoretic security are based on random codes. Achieving information theoretical security with practical coding schemes is of definite interest. In this note, the attempt is to overcome this elusive task by employing the polar coding technique of Arıkan. It is shown that polar codes achieve non-trivial perfect secrecy rates for binary-input degraded wiretap channels while enjoying their low encoding-decoding complexity. In the special case of symmetric main and eavesdropper channels, this coding technique achieves the secrecy …
We introduce a method for securely delivering a set of messages to a group of clients over a broadcast erasure channel where each client is interested in a distinct message. Each client is able to obtain its own message but not the others'. In the proposed method the messages are combined together using a special variant of random linear network coding. Each client is provided with a private set of decoding coefficients to decode its own message. Our method provides security for the transmission sessions against computational brute-force attacks and also weakly security in information theoreti…
In this paper, we propose a two-way secure communication scheme where two transceivers exchange confidential messages via a wireless powered untrusted amplify-and-forward (AF) relay in the presence of an external jammer. We take into account both friendly jamming (FJ) and Gaussian noise jamming (GNJ) scenarios. Based on the time switching (TS) architecture at the relay, the data transmission is done in three phases. In the first phase, both the energy-starved nodes, the untrustworthy relay and the jammer, are charged by non-information radio frequency (RF) signals from the sources. In the seco…
Despite extensive research on cryptography, secure and efficient query processing over outsourced data remains an open challenge. This paper continues along the emerging trend in secure data processing that recognizes that the entire dataset may not be sensitive, and hence, non-sensitivity of data can be exploited to overcome limitations of existing encryption-based approaches. We propose a new secure approach, entitled query binning (QB) that allows non-sensitive parts of the data to be outsourced in clear-text while guaranteeing that no information is leaked by the joint processing of non-se…
