| 1. |
- Ahmadian, Zahra, et al.
(författare)
-
New Attacks on UMTS Network Access
- 2009
-
Konferensbidrag (refereegranskat)abstract
- In this paper we propose two new attacks on UMTS network. Both attacks exploit the UMTS-GSM interworking and are possible in the GSM access area of UMTS network. The first attack allows the attacker to eavesdrop on the entire traffic of the victim UMTS subscriber in the GERAN coverage of the UMTS network. The second attack is an impersonation attack i.e. the attacker impersonates a genuine UMTS subscriber to a UMTS network and fools the network to provide services at the expense of the victim subscriber in its GERAN coverage.
|
|
| 2. |
- Ahmadian, Zahra, et al.
(författare)
-
Security Enhancement of UMTS-GSM Interworking Attacks
- 2010
-
Ingår i: Elsevier Journal of Computer Networks. - : Elsevier BV. - 1389-1286. ; 54:18, s. 2256-2270
-
Tidskriftsartikel (refereegranskat)abstract
- In this paper we first present three new attacks on Universal Mobile Telecommunication System (UMTS) in access domain. We exploit the interoperation of UMTS network with its predecessor, Global System for Mobile communications (GSMs). Two attacks result in the interception of the entire traffic of the victim UMTS subscriber in the GSM access area of UMTS network. These attacks are applicable, regardless of the strength of the selected GSM encryption algorithm. The third attack is an impersonation attack and allows the attacker to impersonate a genuine UMTS subscriber to a UMTS network and fool the network to provide services at the expense of the victim subscriber. Then, we propose some countermeasures to strengthen the UMTS network against the mentioned attacks with emphasis on the practicality in present networks. The proposed solutions require limited change of the network elements or protocols, insignificant additional computational load on the network elements and negligible additional bandwidth consumption on the network links.
|
|
| 3. |
- Babaheidarian, Parisa, et al.
(författare)
-
A New Secret Key Agreement Scheme in a Four-Terminal Network
- 2011
-
Ingår i: 12th Canadian Workshop on Information Theory, CWIT 2011. - : IEEE. - 9781457707438 ; , s. 151-154
-
Konferensbidrag (refereegranskat)abstract
- A new scenario for simultaneously generating a secret key and two private keys among three Terminals in the presence of an external eavesdropper is considered. Terminals 1, 2 and 3 intend to share a common secret key concealed from the external eavesdropper (Terminal 4) and simultaneously, each of Terminals 1 and 2 intends to share a private key with Terminal 3 while keeping it concealed from each other and from Terminal 4. All four Terminals observe i.i.d. outputs of correlated sources and there is a public channel from Terminal 3 to Terminals 1 and 2. An inner bound of the secret key-private keys capacity region is derived and the single letter capacity regions are obtained for some special cases.
|
|
| 4. |
- Babaheidarian, P., et al.
(författare)
-
Compute-and-forward can buy secrecy cheap
- 2015
-
Ingår i: IEEE International Symposium on Information Theory - Proceedings. - : Institute of Electrical and Electronics Engineers (IEEE). - 9781467377041 ; , s. 2475-2479
-
Konferensbidrag (refereegranskat)abstract
- We consider a Gaussian multiple access channel with K transmitters, a (intended) receiver and an external eavesdropper. The transmitters wish to reliably communicate with the receiver while concealing their messages from the eavesdropper. This scenario has been investigated in prior works using two different coding techniques; the random i.i.d. Gaussian coding and the signal alignment coding. Although, the latter offers promising results in a very high SNR regime, extending these results to the finite SNR regime is a challenging task. In this paper, we propose a new lattice alignment scheme based on the compute-and-forward framework which works at any finite SNR. We show that our achievable secure sum rate scales with log(SNR) and hence, in most SNR regimes, our scheme outperforms the random coding scheme in which the secure sum rate does not grow with power. Furthermore, we show that our result matches the prior work in the infinite SNR regime. Additionally, we analyze our result numerically.
|
|
| 5. |
- Babaheidarian, Parisa, et al.
(författare)
-
Finite-SNR Regime Analysis of The Gaussian Wiretap Multiple-Access Channel
- 2015
-
Ingår i: 2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015. ; , s. 307-314
-
Konferensbidrag (refereegranskat)abstract
- In this work, we consider a K-user Gaussian wiretap multiple-access channel (GW-MAC) in which each transmitter has an independent confidential message for the receiver. There is also an external eavesdropper who intercepts the communications. The goal is to transmit the messages reliably while keeping them confidential from the eavesdropper. To accomplish this goal, two different approaches have been proposed in prior works, namely, i.i.d. Gaussian random coding and real alignment. However, the former approach fails at moderate and high SNR regimes as its achievable result does not grow with SNR. On the other hand, while the latter approach gives a promising result at the infinite SNR regime, its extension to the finite-SNR regime is a challenging task. To fill the gap between the performance of the existing approaches, in this work, we establish a new scheme in which, at the receiver's side, it utilizes an extension of the compute-and-forward decoding strategy and at the transmitters' side it exploits lattice alignment, cooperative jamming, and i.i.d. random codes. For the proposed scheme, we derive a new achievable bound on sum secure rate which scales with log(SNR) and hence it outperforms the i.i.d. Gaussian codes in moderate and high SNR regimes. We evaluate the performance of our scheme, both theoretically and numerically. Furthermore, we show that our sum secure rate achieves the optimal sum secure degrees of freedom in the infinite-SNR regime.
|
|
| 6. |
- Babaheidarian, P., et al.
(författare)
-
Security in the Gaussian interference channel : Weak and moderately weak interference regimes
- 2016
-
Ingår i: 2016 IEEE International Symposium on Information Theory - Proceedings. - : Institute of Electrical and Electronics Engineers (IEEE). - 9781509018062 ; , s. 2434-2438
-
Konferensbidrag (refereegranskat)abstract
- We consider a secure communication scenario through the two-user Gaussian interference channel: each transmitter (user) has a confidential message to send reliably to its intended receiver while keeping it secret from the other receiver. Prior work investigated the performance of two different approaches for this scenario; i.i.d. Gaussian random codes and real alignment of structured codes. While the latter achieves the optimal sum secure degrees of freedom (s.d.o.f.), its extension to finite SNR regimes is challenging. In this paper, we propose a new achievability scheme for the weak and the moderately weak interference regimes, in which the reliability as well as the confidentiality of the transmitted messages are maintained at any finite SNR value. Our scheme uses lattice structure, structured jamming codewords, and lattice alignment in the encoding and the asymmetric compute-and-forward strategy in the decoding. We show that our lower bound on the sum secure rates scales linearly with log(SNR) and hence, it outperforms i.i.d. Gaussian random codes. Furthermore, we show that our achievable result is asymptotically optimal. Finally, we provide a discussion on an extension of our scheme to K > 2 users.
|
|
| 7. |
- Bafghi, Hamid G., et al.
(författare)
-
Cognitive Interference Channel with Two Confidential Messages
- 2010
-
Ingår i: ISITA/ISSSTA 2010 - 2010 International Symposium on Information Theory and Its Applications. - : IEEE. - 9781424460175 ; , s. 952-956
-
Konferensbidrag (refereegranskat)abstract
- In this paper we consider a cognitive interference channel with two confidential messages. In our scenario, although the cognitive transmitter cooperates with the primary sender, the primary and cognitive messages must be secure at unintended receivers. The level of secrecy is measured by the equivocation rate. Also an expression is obtained for the rate-equivocation region of the discrete memoryless cognitive interference channel with confidential primary and secondary messages.
|
|
| 8. |
- Bafghi, Hamid G., et al.
(författare)
-
Secrecy Rate Region in the Interference Channel with Common Information
- 2010
-
Ingår i: WITMSE 2010, proceedings.
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)abstract
- In this paper interference channel with common information and two confidential messages is investigated. There are two senders that need deliver their privative messages and a certain common message.The private messages must be confidential in their corresponding receivers. An achievable rate region and an outer bound for such a channel are obtained and it is shown that these rate regions include some existing results for some related channels.
|
|
| 9. |
- Farhat, Farshid, et al.
(författare)
-
An Extended Authentication and Key Agreement Protocol of UMTS
- 2009
-
Ingår i: Information Security Practice And Experience, Proceedings. - Berlin, Heidelberg : Springer Berlin/Heidelberg. - 9783642008429 ; , s. 230-244
-
Konferensbidrag (refereegranskat)abstract
- Identification, authentication and key agreement protocol of UNITS networks have some weaknesses to provide DoS-attack resistance, mutual freshness, and efficient bandwidth consumption. In this article we consider UMTS AKA and some other proposed schemes. Then we explain the known weaknesses in the previous frameworks suggested for UMTS AKA protocol. After that we propose a new UMTS AKA protocol (called EAKAP) for UMTS mobile network that combines identification stage and AKA stage of UMTS AKA protocol as well as eliminating disadvantages of related works and bringing some new features to improve the UNITS AKA mechanism such as reducing the interactive rounds of the UMTS AKA protocol.
|
|
| 10. |
- Farhat, Farshid, et al.
(författare)
-
Private Identification, Authentication and Key Agreement Protocol with Security Mode Setup
- 2011
-
Annan publikation (övrigt vetenskapligt/konstnärligt)abstract
- Identification, authentication and key agreement protocol of UMTS networks with security mode setup has some weaknesses in the case of mutual freshness of key agreement, DoS-attack resistance, and efficient bandwidth consumption. In this article we consider UMTS AKA and some other proposed schemes. Then we explain the known weaknesses of the previous frameworks suggested for the UMTS AKA protocol. After that we propose a new protocol called private identification, authentication, and key agreement protocol (PIAKAP), for UMTS mobile network. Our suggested protocol combines identification and AKA stages of UMTS AKA protocol while eliminates disadvantages of related works and brings some new features to improve the UMTS AKA mechanism. These features consist of reducing the interactive rounds of the UMTS AKA with security mode setup and user privacy establishment.
|
|
