kth.sePublications
Change search
Refine search result
1 - 39 of 39
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1. Ahmadian, Zahra
    et al.
    Salimi, Somayeh
    Salahi, Ahmad
    New Attacks on UMTS Network Access2009Conference paper (Refereed)
    Abstract [en]

    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.
    Salimi, Somayeh
    Salahi, Ahmad
    Security Enhancement of UMTS-GSM Interworking Attacks2010In: Elsevier Journal of Computer Networks, ISSN 1389-1286, Vol. 54, no 18, p. 2256-2270Article in journal (Refereed)
    Abstract [en]

    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, P.
    et al.
    Salimi, Somayeh
    KTH.
    Compute-and-forward can buy secrecy cheap2015In: IEEE International Symposium on Information Theory - Proceedings, Institute of Electrical and Electronics Engineers (IEEE), 2015, p. 2475-2479Conference paper (Refereed)
    Abstract [en]

    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.

  • 4. Babaheidarian, P.
    et al.
    Salimi, Somayeh
    KTH, School of Electrical Engineering (EES), Communication Networks.
    Papadimitratos, Panos
    KTH, School of Electrical Engineering (EES), Communication Networks.
    Security in the Gaussian interference channel: Weak and moderately weak interference regimes2016In: 2016 IEEE International Symposium on Information Theory - Proceedings, Institute of Electrical and Electronics Engineers (IEEE), 2016, p. 2434-2438, article id 7541736Conference paper (Refereed)
    Abstract [en]

    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.

  • 5. Babaheidarian, Parisa
    et al.
    Salimi, Somayeh
    Sharif University of Technology, Tehran, Iran.
    Aref, Mohammad Reza
    A New Secret Key Agreement Scheme in a Four-Terminal Network2011In: 12th Canadian Workshop on Information Theory, CWIT 2011, IEEE , 2011, p. 151-154Conference paper (Refereed)
    Abstract [en]

    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.

  • 6. Babaheidarian, Parisa
    et al.
    Salimi, Somayeh
    KTH, School of Electrical Engineering (EES), Communication Networks.
    Papadimitratos, Panos
    KTH, School of Electrical Engineering (EES), Communication Networks.
    Finite-SNR Regime Analysis of The Gaussian Wiretap Multiple-Access Channel2015In: 2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015, 2015, p. 307-314, article id 7447020Conference paper (Refereed)
    Abstract [en]

    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.

  • 7.
    Babaheidarian, Parisa
    et al.
    Sharif University of Technology.
    Salimi, Somayen
    Sharif University of Technology.
    Aref, Mohammad Reza
    Sharif University of Technology.
    Simultanously Generating Multiple keys in a Four-Terminal Network2012In: IET Information Security, ISSN 1751-8709, E-ISSN 1751-8717, Vol. 6, no 3, p. 190-201Article in journal (Refereed)
    Abstract [en]

    A source model including four terminals is considered, where three simultaneously generating three types of keys are intended. Terminals 1, 2 and 3 wish to share a common key, the secret key, which should be kept secret from terminal 4 and simultaneously terminals 1 and 2 intend to share a private key with terminal 3, which should be kept secret from each other. Also, all the keys should be concealed from terminal 4 (the external wiretapper). The authors assume that all terminals including the external wiretapper have access to distinct correlated i.i.d. sources; there is also a noiseless public channel with unlimited capacity among the terminals. The authors have investigated the model on two scenarios of key sharing depending on the direction of the public channel. Rate regions of the keys are derived. It is shown that in some special cases the inner and outer bounds of the capacity regions coincide and the capacity regions are derived.

  • 8. Bafghi, Hamid G.
    et al.
    Salimi, Somayeh
    University of Technology, Tehran, Iran.
    Seyfe, Babak
    Aref, Mohammad Reza
    Cognitive Interference Channel with Two Confidential Messages2010In: ISITA/ISSSTA 2010 - 2010 International Symposium on Information Theory and Its Applications, IEEE , 2010, p. 952-956Conference paper (Refereed)
    Abstract [en]

    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.

  • 9. Bafghi, Hamid G.
    et al.
    Salimi, Somayeh
    Shahed Univ. Tehran, Iran.
    Seyfe, Babak
    Aref, Mohammad Reza
    Secrecy Rate Region in the Interference Channel with Common Information2010In: WITMSE 2010,  proceedings, 2010Conference paper (Other academic)
    Abstract [en]

    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.

  • 10. Farhat, Farshid
    et al.
    Salimi, Somayeh
    Iran Telecommunication Research Center, North Karegar, Tehran, Iran.
    Salahi, Ahmad
    An Extended Authentication and Key Agreement Protocol of UMTS2009In: Information Security Practice And Experience, Proceedings / [ed] Bao, F; Li, H; Wang, G, Springer Berlin/Heidelberg, 2009, p. 230-244Conference paper (Refereed)
    Abstract [en]

    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.

  • 11. Farhat, Farshid
    et al.
    Salimi, Somayeh
    Salahi, Ahmad
    Private Identification, Authentication and Key Agreement Protocol with Security Mode Setup2011Manuscript (preprint) (Other academic)
    Abstract [en]

    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.

  • 12. Fatemi, Mitra
    et al.
    Salimi, Somayeh
    Salahi, Ahmad
    Anonymous Roaming in UMTS Mobile Networks2010In: IET information security, ISSN 1751-8709, Vol. 4, no 2, p. 93-103Article in journal (Refereed)
    Abstract [en]

    A secure roaming protocol for mobile networks is proposed. Roaming has been analysed in some schemes from the security point of view; however, there are vulnerabilities in most of them and so the claimed security level is not achieved. The scheme offered by Wan et al. recently is based on hierarchical identity-based encryption, in which the roaming user and the foreign network mutually authenticate each other without the help of the home network. Although the idea behind this proposal is interesting, it contradicts technical considerations such as routing and billing. The proposed protocol makes use of similar functions used in Wan et al.'s scheme but contributes a distinguished structure that overcomes the previous shortcomings and achieves a higher possible level of security in mobile roaming as well as enhancing the security of the key issuing procedure.

  • 13. Fatemi, Mitra
    et al.
    Salimi, Somayeh
    Salahi, Ahmad
    Improved EndSec: A Practical Protocol for Securing Core Network Signaling in UMTS2009Conference paper (Refereed)
    Abstract [en]

    The offered services in the third generation of mobile communication (UMTS) have necessitated the existence of reliable network security. The original core network security protocol called MapSec only provides the security for Map signaling and is unable to assure the end-to-end security. One of the proposed solutions to these shortcomings is the EndSec protocol which is computationally complex and increases the significantly increses the signaling load on the link. We also show that EndSec is susceptible against a kind of active attack. In this paper, in addition to explaining the EndSec pitfalls, we present an enhancement using bilinear maps which resolves all the mentioned drawbacks.

  • 14. Fouladi, Roja
    et al.
    Salimi, Somayeh
    Network Security Group, ICT Security Faculty, Iran Telecommunication Research Center (ITRC), Tehran, Iran.
    Gharaee, Hossein
    Analysis of an adjacent 3G network corruption influence on WLAN/3G interworking access2011In: Proceedings of the 2011 International Conference on Computational Aspects of Social Networks, CASoN'11, IEEE , 2011, p. 158-162Conference paper (Refereed)
    Abstract [en]

    In this article, we investigate the user access, i.e., the average number of times of a mobile user entrance, to a Wireless Local Area Network (WLAN) cell in a WLAN and third generation (3G) telecommunication coupled network when an attack causes harm to its adjacent network. The adjacent network is a 3G network. The considered attack is a removal attack that makes a 3G cell, in an adjacent network, disabled to support its services. To do the study, regular Markov chain model is applied. This study shows the dependency of user access to the structure of its adjacent network.

  • 15. Fouladi, Roja
    et al.
    Salimi, Somayeh
    ICT Security Faculty, Iran Telecommunication Research Center (ITRC), Tehran, Iran.
    Salahi, Ahmad
    A Graph Based Security Dependency Analysis of Data Communication Networks to Their Topology2009In: Proceedings of 2009 4th International Conference on Computer Science and Education, ICCSE 2009, New York: IEEE , 2009, p. 284-288Conference paper (Refereed)
    Abstract [en]

    Infrastructure networks like power systems can be suitable media for data communication, either as broadband which it is called BPL (Broadband over Power Line) or narrowband which it is known PLC (Power Line Carrier). Also it is claimed that security robustness of complex communication networks like the Internet to an intentional attack (that brings down network nodes) depends on their topology. In this article, we investigate the dependency of BPL data communication network (as a kind of communication networks) security robustness against the intentional attack to the topology of power system that has been ignored in past studies. The analysis is based on graph theory. We derived two security criteria (biggest cluster size and cluster diameter) for our assessment. It is shown that by changing the structure of power system, the security robustness of the data communication network will be varied. This study brightens the way for future layout development of combined data communication networks with different infrastructures.

  • 16. Fouladi, Roja
    et al.
    Salimi, Somayeh
    ITRC, Tehran, Iran.
    Salahi, Ahmad
    The Analysis of WLAN/3G Interworking Access Based on a Mobility Model2009In: ICCSSE 200: Proceedings Of 2009 4th International Conference On Computer Science & Education, New York: IEEE , 2009, p. 333-338Conference paper (Refereed)
    Abstract [en]

    In this article, we investigate the user access to a Wireless Local Area Network (WLAN) cell in a WLAN and third generation (3G) telecommunication networks interworking. To do the study, it is supposed that a mobile user moves in a typical Location Area (LA). The spotted LA is a 5(star)5 square (includes cells without any overlap). The cells are under the coverage of 3G providers. One cell is allocated to WLAN. Two goals are tracked in this paper. The first is to find a cell which its removal (i.e., to be disabled to support services) would result in the least entrance probability of a user to WLAN cell. Provisioning more security features for this cell would improve the user access. The second is to find the best cell for WLAN establishment in the LA which the highest level of WLAN cell entry would result. To do the study, regular Markov chain is applied. Also, it is supposed that the user walks randomly according to an unbiased mobility pattern. This study shows the dependency of user access (i.e., to network services) to the LA structure which has been ignored before.

  • 17.
    Gabry, Frédéric
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Salimi, Somayen
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Thobaben, Ragnar
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    High SNR performance of amplify-and-forward relaying in Rayleigh fading wiretap channels2013In: 2013 Iran Workshop on Communication and Information Theory, IWCIT 2013, IEEE , 2013, p. 6555771-Conference paper (Refereed)
    Abstract [en]

    This paper investigates amplify-and-forward (AF) relaying for secrecy in quasi-static Rayleigh fading channels. We consider a four-node network where a helping node intends to enhance secrecy of the transmission between the source and the destination in presence of a passive eavesdropper. In this scenario, the common assumption of full CSI on the eavesdropper's channels is not realistic, and thus, we study the performance of cooperation from an outage perspective. Starting from the secrecy outage probability, we introduce a novel measure, the conditional secrecy outage probability to analyze the performance of AF. In particular, we derive closed-form expressions for AF for these two secrecy measures under a high SNR assumption. Moreover, we use numerical examples to illustrate our results and to characterize the effect of the nodes' geometry. We also show numerically how AF improves the secrecy performance in comparison to direct transmission in terms of outage probability and secure throughput.

  • 18.
    Gerami, Majid
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Xiao, Ming
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Salimi, Somayeh
    KTH, School of Electrical Engineering (EES), Communication Networks.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Secure Partial Repair in Wireless Caching Networks with Broadcast Channels2015In: 2015 IEEE Conference on Communications and NetworkSecurity, CNS 2015, 2015, p. 353-360, article id 7346846Conference paper (Refereed)
    Abstract [en]

    We study security in partial repair in wireless caching networks where parts of the stored packets in the caching nodes are susceptible to be erased. Let us denote a caching node that has lost parts of its stored packets as a sick caching node and a caching node that has not lost any packet as a healthy caching node. In partial repair, a set of caching nodes ( among sick and healthy caching nodes) broadcast information to other sick caching nodes to recover the erased packets. The broadcast information from a caching node is assumed to be received without any error by all other caching nodes. All the sick caching nodes then are able to recover their erased packets, while using the broadcast information and the non-erased packets in their storage as side information. In this setting, if an eavesdropper overhears the broadcast channels, it might obtain some information about the stored file. We thus study secure partial repair in the senses of information-theoretically strong and weak security. In both senses, we investigate the secrecy caching capacity, namely, the maximum amount of information which can be stored in the caching network such that there is no leakage of information during a partial repair process. We then deduce the strong and weak secrecy caching capacities, and also derive the sufficient finite field sizes for achieving the capacities. Finally, we propose optimal secure codes for exact partial repair, in which the recovered packets are exactly the same as erased packets.

  • 19. Jahandideh, Vahid
    et al.
    Salimi, Somayeh
    Sharif University of Technology, Tehran, Iran.
    Salmasizadeh, Mahmoud
    Deterministic multiple access wiretap channel2010In: Proceedings 2010 IEEE International Conference on Information Theory and Information Security, ICITIS 2010, IEEE , 2010, p. 998-1001Conference paper (Refereed)
    Abstract [en]

    Two-user Multiple Access Channel with a Wire- Tapper (MAC-WT) is considered. A general outer bound for the secrecy capacity region is given. Also, we have defined the Deterministic MAC-WT, where the channel input of each user is a deterministic function of the channel output and the channel input of the other user. For this network single-letter inner and outer bounds for the secrecy capacity region are given. Furthermore, it is shown that in the Deterministic MAC-WT, if the wiretapper channel is a degraded version of the main channel, inner and outer bounds meet and the secrecy capacity region is characterized.

  • 20. Jahandideh, Vahid
    et al.
    Salimi, Somayeh
    Salmasizadeh, Mahmoud
    Secrecy Capacity of Wiretap Channel for a New Scenario and Designing Code for Wiretap Channel2010Conference paper (Refereed)
    Abstract [en]

    The concept of information theoretic security is introduced. Secrecy capacity of two receiver broadcast channel for a new scenario is derived in which it is assumed that the legitimate receiver has access to a noisy version of eavesdroppers channel outputs. Also the ideas of code designing to achieve zero error on main channel and perfect secrecy on the eavesdropper's channel, without invoking complicated capacity achieving codes are provided

  • 21.
    Naghibi, Farshad
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Salimi, Somayeh
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    On Transmission of a Remote Source With Secrecy Constraints Over Noisy Channels2014In: Proceedings of the IEEE Global Conference on Signal and Information Processing (GlobalSIP), 2014, p. 746-749Conference paper (Refereed)
    Abstract [en]

    The problem of transmitting a remote source via multiple agents to a single destination is considered with secrecy constraints. In particular, noisy versions of a source are observed by multiple agents who then encode and transmit their observations to a decoder over dedicated noisy channel. The decoder should be able to reconstruct the remote source within a certain distortion limit. In addition, there exists an eavesdropper with correlated side information to the source who is capable of wiretapping the links from the agents to the decoder so as to extract as much information as possible about the source. Therefore, the agents should encode their observations in such a way that while as less information as possible is leaked to the eavesdropper the decoder can satisfy the distortion constraint. For this problem, we study the tradeoffs among agents' transmission rates, experienced distortion at the destination, and equivocation rates at the eavesdropper, and provide an achievable region.

  • 22.
    Naghibi, Farshad
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Salimi, Somayeh
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    The CEO Problem With Secrecy Constraints2015In: IEEE Transactions on Information Forensics and Security, ISSN 1556-6013, E-ISSN 1556-6021, Vol. 10, no 6Article in journal (Refereed)
    Abstract [en]

    We study a lossy source coding problem with secrecy constraints in which a remote information source should be transmitted to a single destination via multiple agents in the presence of a passive eavesdropper. The agents observe noisy versions of the source and independently encode and transmit their observations to the destination via noiseless rate-limited links. The destination should estimate the remote source based on the information received from the agents within a certain mean distortion threshold. The eavesdropper, with access to side information correlated to the source, is able to listen in on one of the links from the agents to the destination in order to obtain as much information as possible about the source. This problem can be viewed as the so-called CEO problem with additional secrecy constraints. We establish inner and outer bounds on the ratedistortion- equivocation region of this problem. We also obtain the region in special cases where the bounds are tight. Furthermore, we study the quadratic Gaussian case and provide the optimal rate-distortion-equivocation region when the eavesdropper has no side information and an achievable region for a more general setup with side information at the eavesdropper.

  • 23.
    Naghibi, Farshad
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Salimi, Somayeh
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    The CEO Problem with Secrecy Constraints2014In: 2014 IEEE International Symposium on Information Theory (ISIT), IEEE , 2014, p. 756-760Conference paper (Refereed)
    Abstract [en]

    A lossy source coding problem with secrecy constraints is considered where a remote information source should be transmitted to a single destination via multiple agents in the presence of an eavesdropper. The agents observe noisy versions of the source and independently encode and transmit their observations to the destination via noiseless rate-limited links. Unbeknownst to the agents, an eavesdropper intercepts one of the links from the agents to the destination to learn as much as possible about the source. The destination should estimate the remote source subject to a mean distortion threshold. This problem can be viewed as the CEO problem with addition of secrecy constraints. We establish inner and outer bounds on the rate-distortion-equivocation region. In addition, we provide the optimal rate-distortion-equivocation region for the quadratic Gaussian case when the eavesdropper has no side information.

  • 24.
    Naghibi, Farshad
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Salimi, Somayeh
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Thobaben, Ragnar
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    The Lossless CEO Problem with Security Constraints2013In: Proceedings of the 10th International Symposium on Wireless Communication Systems (ISWCS), VDE Verlag GmbH, 2013, p. -238Conference paper (Refereed)
    Abstract [en]

    In this paper, we investigate the problem of transmitting a remote information source to a single destination via multiple agents in the presence of an eavesdropper. The agents observe noisy versions of the source, then, compress and transmit their observations to the destination via noiseless rate-limited links. The destination should reconstruct the remote source based on the information received from the agents. The eavesdropper, with access to side information correlated with the source, can eavesdrop one of the links from the agents to the destination to obtain as much information as possible about the source. For this problem, we determine the rates at which the agents should transmit such that the destination can recover the source while the equivocation at the eavesdropper node is maximized. We derive inner and outer bounds on the compression-equivocation region. Furthermore, we obtain the compression-equivocation region in special cases where the bounds are tight.

  • 25.
    Naghibi, Farshad
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Thobaben, Ragnar
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Salimi, Somayeh
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Layered LDPC Convolutional Codes for Compression of Correlated Sources under Adversarial Attacks2012In: 2012 International Symposium on Information Theory and Its Applications, ISITA 2012, IEICE , 2012, p. 165-169Conference paper (Refereed)
    Abstract [en]

    We consider the problem of code design for compression of correlated sources under adversarial attacks. A scenario with three correlated sources is considered in which at most one source is compromised by an adversary. The theoretical minimum achievable sum-rate for this scenario was derived by Kosut and Tong. We design layered LDPC convolutional codes for this problem, assuming that one of the sources is available at the common decoder as side information. We demonstrate that layered LDPC convolutional codes constitute a sequence of nested codes where each sub-code is capacity-achieving for the binary symmetric channels used to model the correlation between sources, and therefore, can ideally achieve the theoretical minimum sum-rate. Simulated performance results for moderate block length show a small gap to the theoretical limit, and as the block length increases the gap vanishes.

    Download full text (pdf)
    isita2012
  • 26.
    Salimi, Somayeh
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Gabry, Frédéric
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Pairwise key agreement over a generalized multiple access channel: Capacity bounds and game-theoretic analysis2013In: Proceedings of the Tenth International Symposium on Wireless Communication Systems (ISWCS 2013), IEEE Computer Society, 2013, p. 219-223Conference paper (Refereed)
    Abstract [en]

    A pairwise key agreement between three users is considered in which each pair of the users wishes to agree on a secret key hidden from the remaining user. The three users communicate through a noisy channel where two users transmit the channel inputs and all the three users receive noisy outputs from the channel. In this setup, inner and outer bounds of the secret key capacity region are derived as well as a special case where the two bounds match. Furthermore, an achievable secret key rate region is derived for AWGN channels. In this Gaussian setup, we investigate the interaction between the two transmitting users from a game-theoretic perspective and we analyze the Nash equilibrium of the non-cooperative game considering two strategies for the transmitting users: power control and cooperative jamming. Finally we illustrate our results through numerical simulations.

  • 27.
    Salimi, Somayeh
    et al.
    KTH, School of Electrical Engineering (EES), Communication Networks.
    Jorswieck, Eduard
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Papadimitratos, Panos
    KTH, School of Electrical Engineering (EES), Communication Networks.
    Key Agreement over an Interference Channel with Noiseless Feedback: Achievable Region & Distributed Allocation2015In: IEEE Conference on Communications and Network Security (CNS), Institute of Electrical and Electronics Engineers (IEEE), 2015, p. 59-64, article id 7346811Conference paper (Refereed)
    Abstract [en]

    Secret key establishment leveraging the physical layer as a source of common randomness has been investigated in a range of settings. We investigate the problem of establishing, in an information-theoretic sense, a secret key between a user and a base-station (BS) (more generally, part of a wireless infrastructure), but for two such user-BS pairs attempting the key establishment simultaneously. The challenge in this novel setting lies in that a user can eavesdrop another BS-user communications. It is thus paramount to ensure the two keys are established with no leakage to the other user, in spite the interference across neighboring cells. We model the system with BS-user communication through an interference channel and user-BS communication through a public channel. We find the region including achievable secret key rates for the general case that the interference channel (IC) is discrete and memoryless. Our results are examined for a Gaussian IC. In this setup, we investigate the performance of different transmission schemes for power allocation. The chosen transmission scheme by each BS essentially affects the secret key rate of the other BS-user. Assuming base stations are trustworthy but that they seek to maximize the corresponding secret key rate, a game-theoretic setting arises to analyze the interaction between the base stations. We model our key agreement scenario in normal form for different power allocation schemes to understand performance without cooperation. Numerical simulations illustrate the inefficiency of the Nash equilibrium outcome and motivate further research on cooperative or coordinated schemes.

  • 28. Salimi, Somayeh
    et al.
    Salmasizadeh, Mahmoud
    Aref, Mohammad Reza
    Generalized Secure Distributed Source Coding2009Conference paper (Refereed)
  • 29. Salimi, Somayeh
    et al.
    Salmasizadeh, Mahmoud
    Aref, Mohammad Reza
    Generalized Secure Distributed Source Coding with Side Information2010In: IET Communications, ISSN 1751-8628, E-ISSN 1751-8636, Vol. 4, no 18, p. 2262-2272Article in journal (Refereed)
    Abstract [en]

    New inner and outer bounds on the achievable compression-equivocation rate region for generalised secure data compression with side information are given that do not match in general. In this setup, two senders, Alice and Charlie intend to transmit information to Bob via channels with limited capacity so that he can reliably reconstruct their observations. The eavesdropper, Eve, has access to one of the channels at each instant and is interested in the source of the same channel at the time. Bob and Eve also have their own observations, which are correlated with Alice's and Charlie's observations. In this model, two equivocation and compression rates are defined with respect to the sources of Alice and Charlie. Furthermore, different special cases are discussed where the inner and outer bounds match. Our model covers the previously obtained results as well.

  • 30. Salimi, Somayeh
    et al.
    Salmasizadeh, Mahmoud
    Aref, Mohammad Reza
    Key Agreement over Multiple Access Channel Using Feedback Channel2011Conference paper (Refereed)
    Abstract [en]

    In this paper, the effect of using an insecure and noiseless feedback channel in increasing secret key rates is investigated. There is a generalized discrete memoryless multiple access channel (GDMMAC) between two transmitters and a receiver where, in addition to the receiver, both of the transmitters receive noisy channel outputs. Furthermore, an insecure and noiseless feedback channel exists from the receiver to the transmitters. Each of the transmitters intends to share a secret key with the receiver while keeping it concealed from the other transmitter. For this setup, an inner bound of the secret key capacity region is derived. For some special cases, the secret key capacity region is obtained, and the effect of the feedback channel usage is discussed through a binary-erasure example as well as in the Gaussian case.

  • 31. Salimi, Somayeh
    et al.
    Salmasizadeh, Mahmoud
    Aref, Mohammad Reza
    Rate Regions of Secret Key Sharing in a New Source Model2011In: IET Communications, ISSN 1751-8628, Vol. 5, no 4, p. 443-455Article in journal (Refereed)
    Abstract [en]

    A source model for secret key generation between terminals is considered. Two users, namely users 1 and 2, at one side communicate with another user, namely user 3, while at the other side via a public channel where three users can observe i.i.d. outputs of correlated sources. Each of users 1 and 2 intends to share a secret key with user 3 where user 1 acts as a wiretapper for user 2 and vice versa. In this model, two situations are considered: communication from users 1 and 2 to user 3 (the forward key strategy) and from user 3 to users 1 and 2 (the backward key strategy). In both situations, the goal is sharing a secret key between user 1 and user 3 while leaking no effective information about that key to user 2, and simultaneously, sharing another secret key between user 2 and user 3 while leaking no effective information about the latter key to user 1. This model is motivated by wireless communications when considering user 3 as a base station and users 1 and 2 as network users. For both the forward and backward key strategies, inner and outer bounds of secret key capacity regions are derived. In special situations where one of users 1 and 2 is only interested in wiretapping and not key sharing, the results agree with that of Ahlswede and Csiszar. Also, the authors investigate some special cases in which the inner bound coincides with the outer bound and secret key capacity region is deduced.

  • 32. Salimi, Somayeh
    et al.
    Salmasizadeh, Mahmoud
    Aref, Mohammad Reza
    Secret Key Rate Region of Multiple Access Channel Model2010Conference paper (Refereed)
    Abstract [en]

    A channel model for secret key generation between three terminals is considered. In this model, there is a two-user generalized multiple access channel (MAC) in which, in addition to the receiver, both transmitters receive noisy channel outputs. There is also a one-way public channel from the transmitters to the receiver. In this model, each of the transmitters intends to share a secret key with the receiver using the MAC and the public channel where the transmitters are eavesdroppers with respect to each other. In this setup, the channel outputs at the transmitters are only used for eavesdropping and not as inputs to the encoders. For the secret key rate pair, we derive the inner bound of the secret key capacity region. Thorough an example, it is shown that unlike the broadcast channel model, using a one-way public channel from the transmitters to the receiver is beneficial.

  • 33.
    Salimi, Somayeh
    et al.
    Sharif University of Technology, Tehran, Iran.
    Salmasizadeh, Mahmoud
    Aref, Mohammad Reza
    Secret key sharing in a new source model: Rate regions2010In: 2010 Australian Communications Theory Workshop, AusCTW 2010, IEEE , 2010, p. 117-122Conference paper (Refereed)
    Abstract [en]

    A source model for secret key generation between terminals is considered. Two users, namely users 1 and 2, at one side communicate with another user, namely user 3, at the other side via public channels where three users can observe i.i.d outputs of correlated sources. Each of users 1 and 2 intends to share a secret key with user 3 where user 1 acts as a wiretapper for user 2 and vice versa. In this model, two situations are considered: communication from users 1 and 2 to user 3 (forward key strategy) and from user 3 to users 1 and 2 (backward key strategy). This model is motivated by wireless communications when considering user 3 as a base station and users 1 and 2 as network users. In this paper, for both forward and backward key strategies, inner and outer bounds of secret key capacity regions are derived. In special attitudes where one of users 1 and 2 are only interested in wiretapping and not key sharing, our results agree with that of Ahlswede and Csiszar. Also, we investigate some special cases in which inner bound coincides on outer bound and secret key capacity region is deduced.

  • 34. Salimi, Somayeh
    et al.
    Salmasizadeh, Mahmoud
    Aref, Mohammad Reza
    Golic, Jovan Dj.
    Key Agreement over Multiple Access Channel2011In: IEEE Transactions on Information Forensics and Security, ISSN 1556-6013, E-ISSN 1556-6021, Vol. 6, no 3, p. 775-790Article in journal (Refereed)
    Abstract [en]

    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 pre-generated key strategy and the two-stage key strategy. For both of them, inner and outer bounds of the secret key capacity region are derived. Furthermore, the effect of the public channel is discussed and the two strategies are compared. In both strategies, it is assumed that the channel outputs at the transmitters are only used for eavesdropping and not as inputs to the encoders. The effect of this assumption in the presence of the public channel is analyzed for some Gaussian MACs.

  • 35.
    Salimi, Somayeh
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Secret key agreement using correlated sources over the generalized multiple access channel2012In: Information Theory Workshop (ITW), 2012 IEEE, IEEE , 2012, p. 467-471Conference paper (Refereed)
    Abstract [en]

    A secret key agreement setup between 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. The three users observe i.i.d. outputs of correlated sources and there is a generalized discrete memoryless multiple access channel (GDMMAC) from users 1 and 2 to user 3 for communication between the users. The secret key agreement is established using the correlated sources and the GDMMAC. In this setup, inner and outer bounds of the secret key capacity region are investigated. Moreover, for a special case where the channel inputs and outputs and the sources form Markov chains in some order, the secret key capacity region is derived. Also a Gaussian case is considered in this setup.

  • 36.
    Salimi, Somayeh
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Golić, Jovan Dj.
    Salmasizadeh, Mahmoud
    Aref, Mohammad Reza
    Key agreement over a generalized multiple access channel using noiseless and noisy feedback2013In: IEEE Journal on Selected Areas in Communications, ISSN 0733-8716, E-ISSN 1558-0008, Vol. 31, no 9, p. 1765-1778Article in journal (Refereed)
    Abstract [en]

    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 1 and 2 is used only once. In the case of noisy feedback, a noisy broadcast channel (BC) from user 3 to users 1 and 2 can be repeatedly used, like GDMMAC. In both setups, inner bounds of the secret key capacity region are derived. The secret key capacity region is derived in some special cases where the channel inputs and outputs form Markov chains in certain orders. For illustration, the corresponding results are also derived and discussed for Gaussian channels. The cases with noiseless feedback, noisy feedback, and no feedback at all are compared with each other.

  • 37.
    Salimi, Somayeh
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Salmasizadeh, Mahmoud
    Aref, Mohammad Reza
    Pairwise secret key agreement using the source common randomness2012In: Wireless Communication Systems (ISWCS), 2012 International Symposium on, IEEE , 2012, p. 751-755Conference paper (Refereed)
    Abstract [en]

    A secret key agreement setup between three users is considered in which each pair of them wishes to agree on a secret key hidden from the remaining user. The three users observe i.i.d. outputs of correlated sources and there is a noiseless public channel from each user for communication to the others. In this setup, inner and outer bounds of the secret key capacity region is derived. Moreover, some special cases are obtained in which the inner bound coincides the explicit outer bound. Also a binary-erasure example is presented through which the results are examined.

  • 38. Sonee, Amir
    et al.
    Salimi, Somayeh
    Sharif University of Technology, Tehran, Iran.
    Salmasizadeh, Mahmoud
    A New Achievable Rate-Equivocation Region for the Relay-Eavesdropper Channel2010In: Proceedings - 2010 18th Iranian Conference on Electrical Engineering, ICEE 2010, IEEE , 2010, p. 188-193Conference paper (Refereed)
    Abstract [en]

    In this paper, we propose an information-theoretic scheme which achieves a new rate-equivocation region for the four-terminal relay-eavesdropper channel. The coding scheme used to achieve this region is a combination of the partial decode and forward, compress and forward and noise forwarding strategies. In this strategy the relay cooperates with the source to have both a reliable and secure communication by decoding some part of the source message, compressing the received signal and also sending the codewords independent of the transmitted message. Using this scheme we can obtain the perfect secrecy capacity of the semi- deterministic and deterministic relay channels.

  • 39. Sonee, Amir
    et al.
    Salimi, Somayeh
    Sharif University of Technology, Tehran, Iran.
    Salmasizadeh, Mahmoud
    Generalized multiple-access relay channel with confidential messages2010In: ISITA/ISSSTA 2010 - 2010 International Symposium on Information Theory and Its Applications, IEEE , 2010, p. 1024-1029Conference paper (Refereed)
    Abstract [en]

    In this paper, we propose information theoretic schemes that achieve the rate-equivocation regions for the multiple-access relay channel with confidential messages. This channel consists of two users that play the role of eavesdropper for each other's message and a relay that helps them to have a reliable and secure communication. The relay can itself be an eavesdropper of the users messages. The first coding scheme used for achievability is noise forwarding strategy and the second is the combination of noise forwarding with the compress and forward strategy. In the first one, relay cooperates with the users to have a confidential communication by sending codewords independent of the secret messages. In the second one, in addition to sending independent codewords, relay also sends compressed version of the received signals. Using these schemes, we derive the inner bounds for the capacity-equivocation region of the described model.

1 - 39 of 39
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf