Loading...
Search for: key-agreement
0.005 seconds
Total 22 records

    New attacks on UMTS network access

    , Article 2009 Wireless Telecommunications Symposium, WTS 2009, 22 April 2009 through 24 April 2009 ; 2009 ; 9781424425884 (ISBN) Ahmadian, Z ; Salimi, S ; Salahi, A ; Sharif University of Technology
    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. © 2009 IEEE  

    Key agreement over a state-dependent 3-receiver broadcast channel

    , Article 2013 Iran Workshop on Communication and Information Theory ; 2013 ; 9781467350235 (ISBN) Bahrami, M ; Bereyhi, A ; Salehkalaibar, S ; Aref, M. R ; Sharif University of Technology
    2013
    Abstract
    In this paper, we consider the problem of secret key agreement in state-dependent 3-receiver broadcast channels. In the proposed model, there are two legitimate receivers, an eavesdropper and a transmitter where the channel state information is non-causally available at the transmitter. We consider two setups. In the first setup, the transmitter tries to agree on a common key with the legitimate receivers while keeping it concealed from the eavesdropper. Simultaneously, the transmitter agrees on a private key with each of the legitimate receivers that needs to be kept secret from the other legitimate receiver and the eavesdropper. For this setup, we derive inner and outer bounds on the... 

    Pairwise secret key agreement using the source common randomness

    , Article Proceedings of the International Symposium on Wireless Communication Systems, 28 August 2012 through 31 August 2012 ; Aug , 2012 , Pages 751-755 ; 21540217 (ISSN) ; 9781467307604 (ISBN) Salimi, S ; Skoglund, M ; Salmasizadeh, M ; Aref, M. R ; Sharif University of Technology
    2012
    Abstract
    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  

    Key agreement over multiple access channel using feedback channel

    , Article IEEE International Symposium on Information Theory - Proceedings, 31 July 2011 through 5 August 2011 ; August , 2011 , Pages 1970-1974 ; 21578104 (ISSN) ; 9781457705953 (ISBN) Salimi, S ; Salmasizadeh, M ; Aref, M. R ; Sharif University of Technology
    2011
    Abstract
    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... 

    Comments on 'Information-Theoretic Key Agreement of Multiple Terminals - Part I'

    , Article IEEE Transactions on Information Theory ; Volume 63, Issue 8 , 2017 , Pages 5440-5442 ; 00189448 (ISSN) Gohari, A ; Anantharam, V ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2017
    Abstract
    Theorem 5 of A. Gohari, V. Anantharam, IEEE Transactions on Information Theory, vol. 56, no. 8, pp. 3973-3996, 2010, states an upper bound on the secrecy capacity for the source model problem. It has a three page proof given in Appendix B of the paper. Unfortunately, we show that this bound does not provide any improvement over the simpler bound given in Corollary 1 of the paper. We also provide an example of a family of two agent source model problems where the one-way secrecy rate in each direction is zero, but the secrecy rate is nonzero and can be determined exactly as a conditional mutual information. © 1963-2012 IEEE  

    Analysis of Secret Key Agreement in The Channel Model with Side Information

    , M.Sc. Thesis Sharif University of Technology Bahrami, Mohsen (Author) ; Aref, Mohammad Reza (Supervisor)
    Abstract
    In this thesis, the problem of secret key agreement in the channel model with side information is studiedx. In order to investigate the problem, we consider three models according to the different ways of side information availability which are the state-dependent broadcast channel; the state-dependent broadcast channel in presence of public channel and the state-dependent wiretap channel with degraded versions of the channel state information.For the problem of secret key agreement in broadcast channels, two models, the state-dependent wiretap channel and state-dependent three receivers broadcast channel, are considered. We obtain inner and outer bounds of the secret key capacity region for... 

    Analysis of Key Agreement in Secure Networks from the View of Information Theory

    , M.Sc. Thesis Sharif University of Technology Babaheidarian, Parisa (Author) ; Aref, Mohammad Reza (Supervisor)
    Abstract
    In this thesis the problem of simultaneously generating multiple keys among multiple terminals is investigated. After providing a survey on the related works and exploiting the problem of sharing a common secret key and a private key among three terminals, we introduce a new source model which we call it the Four-Terminal model. We consider the problem of generating three kinds of keys among legitimate terminals and investigate the problem under two different scenarios, Backward and Forward scenarios, which depend on the kind of restrictions imposed on the usage of the public channel. We derive an achievable region for the backward scenario, using the combination of superposition coding and... 

    Coordination in Cooperative Networks and Secret Key Agreement Using Common Information

    , M.Sc. Thesis Sharif University of Technology Bereyhi, Ali (Author) ; Aref, Mohammad Reza (Supervisor)
    Abstract
    In order to utilize cooperative resources of a network, we have to investigate cooperative networks and strategies. Information theory, by introducing different concepts such as coordination and common information, gives us a suitable tool to study cooperative networks and using their resources. In this thesis, we investigate coordination and secret key agreement in cooperative networks. Our study consists of two parts. In the first part, we consider coordination and its applications in cooperative networks. For this purpose, we introduce the triangular multiterminal network as a proper model for studying empirical coordination in multiterminal networks and establish an inner and outer... 

    A novel and low-energy PKC-based key agreement protocol for WSNs

    , Article 2013 10th International ISC Conference on Information Security and Cryptology, ISCISC 2013 ; 2013 Ghasemzadeh, H ; Aref, M. R ; Payandeh, A ; Sharif University of Technology
    IEEE Computer Society  2013
    Abstract
    Security is a critical and vital task in WSNs. Recently, key management as the core of a secure communication has received lots of attention, but in most of the proposed methods security has been compromised in favor of reducing energy consumption. Consequently, perfect resiliency has not been achieved by most of the previous works. Hostile environment, ability of adversary to capture the nodes, and dead nodes with sensitive data scattered in the region, calls for a more secure and yet practical method. This paper proposes a novel authentication scheme based on broadcast messages from BS to improve security of key management system. Through simulation it is shown that energy consumption of... 

    New techniques for localization based information theoretic secret key agreement

    , Article 2017 14th International ISC (Iranian Society of Cryptology) Conference on Information Security and Cryptology, ISCISC 2017, 6 September 2017 through 7 September 2017 ; 2018 , Pages 70-76 ; 9781538665602 (ISBN) Kazempour, N ; Mirmohseni, M ; Aref, M. R ; Sharif University of Technology
    Abstract
    We consider a source model for information theoretic secret key agreement based on the distance among the nodes, in a basic system consisting of two legitimate users and an eavesdropper. The legitimate nodes try to agree on a reliable and secure key based on their noisy observation of distance between them. We propose two methods to enhance system utility: 1) Artificial Noise Forwarding (ANF), 2) transmission in different beam directions (multi-antenna transmission). In the first method artificial noise is used to worsen e a vesdropper's distance estimation and in the second method beacon signals are sent in different directions and the virtual distances in different beam directions are used... 

    Enhanced smart-card-based authentication scheme providing forward-secure key agreement

    , Article 1st IFIP International Conference on New Technologies, Mobility and Security, NTMS 2007, Paris, 2 May 2007 through 4 May 2007 ; 2007 , Pages 447-458 ; 9781402062698 (ISBN) Asadpour, M ; Sattarzadeh, B ; Jalili, R ; Sharif University of Technology
    Kluwer Academic Publishers  2007
    Abstract
    Many smart-card-based remote authentication schemes have been proposed recently. In 2004, Yoon et al. presented an improved scheme which is the leading of a research track started from Sun, 2000. In this paper, we illustrate that Yoon et al.'s scheme is vulnerable to the parallel session attack and propose an enhancement of the scheme to resist that attack. In our scheme the parties further establish a forward-secure session key by employing only hash functions to protect the subsequent communications. We also demonstrate that our scheme has better security in comparison to other related works, while it does not incur much computational cost © 2007 Springer  

    Key agreement over multiple access channel

    , Article IEEE Transactions on Information Forensics and Security ; Volume 6, Issue 3 PART 1 , 2011 , Pages 775-790 ; 15566013 (ISSN) Salimi, S ; Salmasizadeh, M ; Aref, M. R ; Golic, J. D ; Sharif University of Technology
    Abstract
    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... 

    GSL-AKA: group-based secure lightweight authentication and key agreement protocol for M2M communication

    , Article 9th International Symposium on Telecommunication, IST 2018, 17 December 2018 through 19 December 2018 ; 2019 , Pages 275-280 ; 9781538682746 (ISBN) Modiri, M. M ; Mohajeri, J ; Salmasizadeh, M ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2019
    Abstract
    Nowadays, one of the most important criterions in designing of different generations of mobile cellular technology is to handle a large number of heterogeneous devices with high security guarantees. The first significant security issue considered in this field is mutual authentication of the devices and the network and key agreement between them. Hence, various authentication and key agreement (AKA) protocols were proposed for Long Term Evolution (LTE) and future 5G networks. However, each of the protocols suffers from security and non-security problems. This paper proposed a group-based secure lightweight authentication and key agreement (GSL- AKA) protocol for machine-to-machine (M2M)... 

    Information Theoretic Secret Key Agreement Based on localization

    , M.Sc. Thesis Sharif University of Technology (Author) ; Aref, Mohammad Reza (Supervisor) ; Mirmohseni, Mahtab (Co-Advisor)
    Abstract
    Sharing secret key is an essential prerequisite of symmetric key cryptography. So, we consider a source model for information theoretic secret key agreement based on the distance among the nodes. Secret key agreement based on information theory, unlike computational models, guarantee full information secrecy, eavesdropper receives no efficient information. The model is a basic system consisting of two legitimate users and an eavesdropper. The legitimate nodes try to agree on a reliable and secure key based on their noisy observation of distance between them. Eavesdropper observes the distance, too. First, we model distance estimation by the nodes to study performance of the system (secret... 

    Secrecy Rates in Wiretap Channels

    , Ph.D. Dissertation Sharif University of Technology Salimi, Somayeh (Author) ; Salmasizadeh, Mahmoud (Supervisor) ; Aref, Mohammad Reza (Supervisor)
    Abstract
    Security has been considered from the information theoretic point of view in different channels such as broadcast, multiple access and relay channels. Due to application of these channels in modern networks such as wireless, sensor and Ad-hoc networks, information theoretic security arguments especially wiretapping, has major significance in these networks. With regard to necessity of confidentiality protection in modern telecommunication services, security from the information theoretic point of view should be considered as well as capacity and achievable rate region considerations in these networks. In this thesis, first, a survey of basic works in the subjects of secrecy capacity and... 

    Key agreement over a generalized multiple access channel using noiseless and noisy feedback

    , Article IEEE Journal on Selected Areas in Communications ; Volume 31, Issue 9 , 2013 , Pages 1765-1778 ; 07338716 (ISSN) Salimi, S ; Skoglund, M ; Golic, J. D ; Salmasizadeh, M ; Aref, M. R ; Sharif University of Technology
    2013
    Abstract
    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... 

    A new secret key agreement scheme in a four-terminal network

    , Article 12th Canadian Workshop on Information Theory, CWIT 2011, 17 May 2011 through 20 May 2011 ; May , 2011 , Pages 151-154 ; 9781457707438 (ISBN) Babaheidarian, P ; Salimi, S ; Aref, M. R ; IEEE; Canadian Society of Information Theory (CSIT); UBC; Faculty of Applied Science; RIM ; Sharif University of Technology
    2011
    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... 

    Securing key exchange and key agreement security schemes for RFID passive tags

    , Article 24th Iranian Conference on Electrical Engineering, ICEE 2016, 10 May 2016 through 12 May 2016 ; 2016 , Pages 1475-1480 ; 9781467387897 (ISBN) Abdolmaleki, B ; Baghery, K ; Akhbari, B ; Alavi, S. M ; Aref, M. R ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2016
    Abstract
    In the last decade, various types of RFID security schemes have been proposed which have tried to provide all security and privacy requirements of end-users. In this paper, we cryptanalyze two new-found key exchange and key agreement security schemes which are proposed by Zhang et al. and Kim in 2012 and 2013 respectively. We present the reveal secret parameter, tag impersonation and traceability attacks on Zhang et al's protocol with success probability '1', and also we show that an attacker can impersonate the tag and the reader of Kim's protocol both with success probabilities '1/4'. We also present some modifications on the structure of studied schemes and propose two modified schemes... 

    Multivariate Mutual Information via Secret-key Agreement

    , M.Sc. Thesis Sharif University of Technology Mostafa Zadflah Chobari, Mohammad (Author) ; Ebrahimi, Javad (Supervisor)
    Abstract
    Shannon (1948) for the first time defined the "mutual information'' parameter for two random variables, but still there is no common definition for multivariate mutual information has been agreed upon, despite the multitude of research on the subject and various proposed definitions. In 2015, a study suggested that the maximum rate of secret-key, in the secret-key agreement problem, is a suitable candidate for defining multivariate mutual information. Csiszár and Narayan's research on the secret-key agreement problem provides an accessible bound for the maximum rate of secret-key rate, which in the bivariate case is the shannon's mutual information. The proposed definition has all expected... 

    Designing a Lightweight Smart Health System with Identity Privacy Protection

    , M.Sc. Thesis Sharif University of Technology Zahedi, Hossein (Author) ; Aref, Mohammad Reza (Supervisor)
    Abstract
    The applications of Internet of Things technology are increasing day by day. In the Internet of Things, various devices are connected to each other with the help of the Internet and perform various operations automatically. Today, this technology has various applications in smart city, smart home, smart car, as well as military industries and industrial factories. One of the newest applications is its use in the field of health and hygiene, which is known as the Internet of Medical Things or Smart Health. With the emergence of new epidemic diseases, the importance of this application becomes more clear. Smart health helps the patient. without going to the hospital and doctor in person, to...