Sharif Digital Repository

In smart antenna systems, The localization and direction of desired source(s) must be known. In this paper, we introduce a method called "DMSAE" (Direction finding of Multiple Sources by Alternating Eliminations) to find the radio directions of signals impinging on an arbitrary antenna array and the number of the signals. This method which is based on the Minimum Variance Distortionless Response (MVDR) algorithm, can not only detect the direction and the number of sources, simultaneously, but also has better resolution ability compared to the other conventional direction finding algorithms. This method can also detect very weak sources when other powerful sources exist in the environment. In... 

In this paper, we study the problem of simulating a DMC channel from another DMC channel. We assume that the input to the channel we are simulating is i.i.d. and that the transmitter and receivers are provided with common randomness at limited rates. We prove bounds for simulating point-to-point, MAC and broadcast channels. As a special case, we recover the achievability part of the result of Cuff for point-to-point channel simulation via a noiseless link and shared randomness  

A specific class of differential cryptanalytic approach, known as Related Key Boomerang Attack, has been successfully applied to several symmetric cryptographic primitives in particular encryption schemes such as Advanced Encryption Standard (AES). In this paper, we propose a new related-key boomerang attack on 8-round AES-256, a couple of ones on 9-round following the work of Gorski et al. In the first one, we attacked 8-round AES-256 with the time complexity of 279 and the data complexity of 259. The extended 8-round attack on 9-round AES-256 is more efficient than previous attacks from both time and data complexity perspectives  

In this paper, a generalized multiple access channel (MAC) model for secret key sharing between three terminals is considered. In this model, there are two transmitters and a receiver where all three terminals receive noisy channel outputs. In addition, there is a one-way public channel from the transmitters to the receiver. Each of the transmitters intends to share a secret key with the receiver by using the MAC and the public channel, where the transmitters are eavesdroppers with respect to each other. Two strategies for secret key sharing are considered, namely, the pregenerated key strategy and the two-stage key strategy. For both of them, inner and outer bounds of the secret key... 

Security techniques have been designed to obtain certain objectives. One of the most important objectives all security mechanisms try to achieve is the availability, which insures that network services are available to various entities in the network when required. But there has not been any certain parameter to measure this objective in network. In this paper we consider availability as a security parameter in ad-hoc networks. However this parameter can be used in other networks as well. We also present the connectivity coefficient of nodes in a network which shows how important is a node in a network and how much damage is caused if a certain node is compromised  

Performance of routing is severely degraded when misbehaving nodes drop packets instead of properly forwarding them. In this paper, we propose a Game-Theoretic Adaptive Multipath Routing (GTAMR) protocol to detect and punish selfish or malicious nodes which try to drop information packets in routing phase and defend against collaborative attacks in which nodes try to disrupt communication or save their power. Our proposed algorithm outranks previous schemes because it is resilient against attacks in which more than one node coordinate their misbehavior and can be used in networks which wireless nodes use directional antennas. We then propose a game theoretic strategy, ERTFT, for nodes to... 

In this paper we study the sum modulo two problem proposed by Körner and Marton. In this source coding problem, two transmitters who observe binary sources X and Y, send messages of limited rate to a receiver whose goal is to compute the sum modulo of X and Y. This problem has been solved for the two special cases of independent and symmetric sources. In both of these cases, the rate pair (H(X|Y), H(Y|X)) is achievable. The best known outer bound for this problem is a conventional cut-set bound, and the best known inner bound is derived by Ahlswede and Han using a combination of Slepian-Wolf and Körner-Marton's coding schemes. In this paper, we propose a new outer bound which is strictly... 

Inserting redundancy to arithmetic codes is a common strategy to add error detection capability to this well-known family of source codes. By using this strategy error correction is possible through some decoding algorithms such as Viterbi decoder. In this paper a system has proposed that uses finite state integer arithmetic codes (FSAC) as a joint source-channel code in combination with a cyclic redundancy check (CRC) and a List Viterbi decoder. The proposed scheme has shown better performance than previous ones. © 2009 IEEE  

Distributed spectrum sensing (DSS) is of great importance in Cognitive Radio, especially under fading or shadowing effects. In order to evaluate the performance of a distributed system, it is commonly compared with the centralized system as an upper performance bound. Now the question is whether or not one can obtain a distributed strategy serving as an upper bound to benchmark any distributed strategy, tighter than that of the centralized scheme. Here, we suggest employing the Neyman-Pearson (NP) fusion rule to achieve an upper bound. Furthermore, the analysis of a randomized fusion rule has been provided, which is a long-existing problem in this field. For this purpose, theoretical... 

A secret key agreement framework involving three users is considered in which each of the users 1 and 2 intends to share a secret key with user 3 and users 1 and 2 are eavesdroppers with respect to each other. There is a generalized discrete memoryless multiple access channel (GDMMAC) from users 1 and 2 to user 3 where the three users receive outputs from the channel. Furthermore, there is a feedback channel from user 3 to users 1 and 2 through which user 3 sends information extracted from the received output from the GDMMAC to increase the key rates. We consider both noiseless and noisy feedback. In the case of noiseless feedback, a public channel of unlimited capacity from user 3 to users... 

In this paper we derive a new upper bound on the quantum key distillation capacity. This upper bound is an extension of the classical bound of Gohari and Anantharam on the source model problem. Our bound strictly improves the quantum extension of reduced intrinsic information bound of Christandl et al. Although this bound is proposed for quantum settings, it also serves as an upper bound for the special case of classical source model, and may improve the bound of Gohari and Anantharam. The problem of quantum key distillation is one in which two distant parties, Alice and Bob, and an adversary, Eve, have access to copies of quantum systems A, B, E respectively, prepared jointly according to... 

In this paper, we study the problem of channel simulation via interactive communication, known as the coordination capacity, in a two-terminal network. We assume that two terminals observe i.i.d. copies of two random variables and would like to generate i.i.d. copies of two other random variables jointly distributed with the observed random variables. The terminals are provided with two-way communication links, and shared common randomness, all at limited rates. Two special cases of this problem are the interactive function computation studied by Ma and Ishwar, and the tradeoff curve between one-way communication and shared randomness studied by Cuff. The latter work had inspired Gohari and... 

Reliability and security are two important subjects in modern digital communications. A secure channel coding scheme provides both of reliability and security in one process to combat problems in an unreliable and insecure channel. In this paper, a secure block turbo coding scheme will be proposed and analyzed. Security and reliability are based on pseudo-random puncturing. Simulation results show that this scheme has superior performance and high security  

In this paper, we investigate the index coding problem in the presence of an eavesdropper. Messages are to be sent from one transmitter to a number of legitimate receivers who have side information about the messages, and share a set of secret keys with the transmitter. We assume perfect secrecy, meaning that the eavesdropper should not be able to retrieve any information about the message set. This problem is a generalization of the Shannon's cipher system. We study the minimum key lengths for zero-error and perfectly secure index coding problems  

'To be considered for the 2017 IEEE Jack Keil Wolf ISIT Student Paper Award' In this paper, we show the equivalency of weak and strong secrecy conditions for a large class of secure network coding problems. When we restrict to linear operations, we show the equivalency of 'perfect secrecy with zero-error constraint' and 'weak secrecy with-error constraint'. © 2017 IEEE  

We propose a general mobility model based on region splitting and mapping each subregion on a multi-server node. By using the theory of multi-class Jackson queueing network with multiserver nodes and employing the product-form solution for such queueing networks, we obtain an analytical form for the spatial traffic distribution in a typical region with specific number of users. To this end, we consider the spatial statistical pattern for new and handoff call arrivals and the ratio between these two types of arrivals. At last, we apply our new model to some simple mobility scenarios and compute the resultant active user's location densities. © 2003 IEEE  

In this paper, we focus on the reverse link traffic analysis of a code-division multiple-access (CDMA) cellular network in dynamic environments. In this respect, we propose a new and flexible traffic model, which takes into account the interference-limitedness attribute of CDMA capacity as well as its soft-handoff feature. This new traffic model is developed according to interference-based call admission control (ICAC) method and a geographical structure with three regions. The main advantage of this traffic model is in its flexibility when we consider different traffic conditions including time-varying status of traffic in the neighboring cells  

Industrial control systems are widely used in industrial sectors and critical infrastructures to monitor and control industrial processes. Recently, the security of industrial control systems has attracted a lot of attention, because these systems are now increasingly interacting with the Internet. Classic systems are suffering from many security problems and with the expansion of Internet connectivity, they are now exposed to new types of threats and cyber-attacks. Addressing this, intrusion detection technology is one of the most important security solutions that is used in industrial control systems to identify potential attacks and malicious activities. In this paper, we propose Stacked... 

In this paper, two methods are proposed for the detection of a band-limited signal in unknown variance white Gaussian noise. The complex amplitude and the frequency of the signal and the noise variance are assumed as unknown parameters. Using wavelet concepts, an orthonormal, fully-decimated filter-bank is employed to decompose the signal into its subband components. It is shown that, in this process, the noise is also decomposed into orthonormal zero-mean components. In the output, if a band-limited target signal is present, the respective single subband component (or two components in marginal cases) containing the target signal presents a non-zero mean. The presence of a non-zero mean... 

For a fading full-duplex decode-and-forward relay channel, the authors analytically derive optimum power allocation schemes subject to individual power constraints at the source and the relay. The authors prove that the problem is a convex optimisation problem over the feasible power set, and by proposing a systematic technique to solve min-max problems, optimum power allocations are derived in closed-forms. Finally, for a Rayleigh-fading channel model, optimum power allocations are derived and the respective achievable rate and an upper bound are evaluated. The implications of the derived theoretical results are discussed through some graphs