Diffie-Hellman key distribution in wireless multi-way relay networks

Published on Oct 1, 2013
· DOI :10.1109/APSIPA.2013.6694207
Ronald Y. Chang12
Estimated H-index: 12
(CIT: Center for Information Technology),
Sian-Jheng Lin13
Estimated H-index: 13
(CIT: Center for Information Technology),
Wei-Ho Chung19
Estimated H-index: 19
(CIT: Center for Information Technology)
Diffie-Hellman protocol is a classical secret key exchange protocol for secure communications. This paper considers the extension of the original two-party Diffie-Hellman protocol to multi-party key distribution in wireless multi-way relay networks where multiple users can only communicate with one another through a single relay. Two efficient key exchange protocols are proposed. A performance comparison with existing methods adapted to the relay networks shows the enhanced efficiency and the originality of the proposed protocols designed specifically for the multi-way relay networks.
  • References (10)
  • Citations (4)
📖 Papers frequently viewed together
2 Authors (Celia Li, Cungang Yang)
5 Citations
2014GLOBECOM: Global Communications Conference
6 Authors (Wenlong Shen, ..., Yu Cheng)
40 Citations
78% of Scinapse members use related papers. After signing in, all features are FREE.
#1Takayuki Shimizu (Dodai: Doshisha University)H-Index: 7
#2Hisato Iwai (Dodai: Doshisha University)H-Index: 12
Last. Hideichi Sasaoka (Dodai: Doshisha University)H-Index: 13
view all 3 authors...
We consider secret key agreement based on radio propagation characteristics in a two-way relaying system where two legitimate parties named Alice and Bob communicate with each other via a trusted relay. In this system, Alice and Bob share secret keys generated from measured radio propagation characteristics with the help of the relay in the presence of an eavesdropper. We present four secret key agreement schemes: an amplify-and-forward (AF) scheme, a signal-combining amplify-and-forward (SC-AF)...
49 CitationsSource
#1Bobak Nazer (BU: Boston University)H-Index: 24
#2Michael Gastpar (University of California, Berkeley)H-Index: 40
When two or more users in a wireless network transmit simultaneously, their electromagnetic signals are linearly superimposed on the channel. As a result, a receiver that is interested in one of these signals sees the others as unwanted interference. This property of the wireless medium is typically viewed as a hindrance to reliable communication over a network. However, using a recently developed coding strategy, interference can in fact be harnessed for network coding. In a wired network, (lin...
267 CitationsSource
Sep 20, 2009 in MOBICOM (ACM/IEEE International Conference on Mobile Computing and Networking)
#1Suman Jana (UofU: University of Utah)H-Index: 23
#2Sriram Nandha Premnath (UofU: University of Utah)H-Index: 7
Last. Srikanth V. Krishnamurthy (UCR: University of California, Riverside)H-Index: 41
view all 6 authors...
We evaluate the effectiveness of secret key extraction, for private communication between two wireless devices, from the received signal strength (RSS) variations on the wireless channel between the two devices. We use real world measurements of RSS in a variety of environments and settings. Our experimental results show that (i) in certain environments, due to lack of variations in the wireless channel, the extracted bits have very low entropy making these bits unsuitable for a secret key, (ii)...
327 CitationsSource
Sep 14, 2008 in MOBICOM (ACM/IEEE International Conference on Mobile Computing and Networking)
#1Suhas Mathur (RU: Rutgers University)H-Index: 13
#2Wade Trappe (RU: Rutgers University)H-Index: 51
Last. Alexander Reznik (InterDigital, Inc.)H-Index: 19
view all 5 authors...
Securing communications requires the establishment of cryptographic keys, which is challenging in mobile scenarios where a key management infrastructure is not always present. In this paper, we present a protocol that allows two users to establish a common cryptographic key by exploiting special properties of the wireless channel: the underlying channel response between any two parties is unique and decorrelates rapidly in space. The established key can then be used to support security services ...
488 CitationsSource
We consider the problem of secret key distribution in a sensor network with multiple scattered sensor nodes and a mobile device that can be used to bootstrap the network. Our main contribution is a set of secure protocols that rely on simple network coding operations to provide a robust and low-complexity solution for sharing secret keys among sensor nodes, including pairwise keys, cluster keys, key revocation, and mobile node authentication. Despite its role as a key enabler for this approach, ...
57 CitationsSource
Sep 29, 2006 in MOBICOM (ACM/IEEE International Conference on Mobile Computing and Networking)
#1Shengli Zhang (CUHK: The Chinese University of Hong Kong)H-Index: 21
#2Soung-chang Liew Sb Sm Ee PhD Smieee Fiee (CUHK: The Chinese University of Hong Kong)H-Index: 38
Last. Patrick P. Lam (CUHK: The Chinese University of Hong Kong)H-Index: 6
view all 3 authors...
A main distinguishing feature of a wireless network compared with a wired network is its broadcast nature, in which the signal transmitted by a node may reach several other nodes, and a node may receive signals from several other nodes simultaneously. Rather than a blessing, this feature is treated more as an interference-inducing nuisance in most wireless networks today (e.g., IEEE 802.11). The goal of this paper is to show how the concept of network coding can be applied at the physical layer ...
1,279 CitationsSource
#1Petar Popovski (AAU: Aalborg University)H-Index: 42
#2Hiroyuki Yomo (AAU: Aalborg University)H-Index: 20
This paper considers relaying techniques that increase the achievable throughput in multi-hop wireless networks by taking advantage of the bi-directional traffic flow. Such a relaying technique is termed relaying with Bi-directional Amplification of Throughput (BAT-relaying). The BAT-relaying is utilizing the concept of anti-packets, defined for bi-directional traffic flows. The relay node combines the anti-packets that are destined for different nodes and broadcasts the combined packet. Two BAT...
342 CitationsSource
#1Rudolf Ahlswede (Bielefeld University)H-Index: 38
#2Ning Cai (CUHK: The Chinese University of Hong Kong)H-Index: 14
Last. Raymond W. Yeung (CUHK: The Chinese University of Hong Kong)H-Index: 38
view all 4 authors...
We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a point-to-point communication network on which a number of information sources are to be multicast to certain sets of destinations. We assume that the information sources are mutually independent. The problem is to characterize the admissible coding rate region. This model subsumes all previously studied models along the same line. We study the problem with one infor...
6,923 CitationsSource
Jan 1, 1996 in CCS (Computer and Communications Security)
#1Michael Steiner (IBM)H-Index: 26
#2Gene Tsudik (IBM)H-Index: 73
Last. Michael Waidner (IBM)H-Index: 52
view all 3 authors...
Ever since a-party Diffie-Hellman key exchange was first proposed in 1976, there have been efforts to extend its simplicity and elegance to a group setting. Notable solutions have been proposed by Ingemarsson et al. (in 1982) and Burmester/Desmedt (in 1994). In this paper, we consider a class of protocols that we call natural extensions of DiffieHellman to the n-party case. After demonstrating the security of the entire class based on the intractability of the Diffie-Hellman problem we introduce...
636 CitationsSource
#1Whitfield Diffie (Stanford University)H-Index: 16
#2Martin E. Hellman (Stanford University)H-Index: 26
Two kinds of contemporary developments in cryptography are examined. Widening applications of teleprocessing have given rise to a need for new types of cryptographic systems, which minimize the need for secure key distribution channels and supply the equivalent of a written signature. This paper suggests ways to solve these currently open problems. It also discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standi...
10.8k CitationsSource
Cited By4
#1Mirko Bottarelli (University of Wolverhampton)H-Index: 1
#2Gregory Epiphaniou (University of Wolverhampton)H-Index: 7
Last. Haider M. Al-Khateeb (University of Wolverhampton)H-Index: 5
view all 5 authors...
Abstract Physical layer security protocols have recently been deployed in the context of Wireless communications. These are derived from the intrinsic characteristics of the communication media for key generation, sharing and randomness extraction. These protocols always seek to exhibit both low computational complexity and energy efficiency, whilst also maintain unconditionally secure communications. We present herein, a comprehensive literature review of existing “state-of-the-art” quantisatio...
2 CitationsSource
Aug 1, 2017 in MWSCAS (International Midwest Symposium on Circuits and Systems)
#1Janhavi KulkarniH-Index: 1
#2Karan NairH-Index: 1
Last. Jonathan JoshiH-Index: 8
view all 6 authors...
This paper explores the use of On-chip cryptographic units for implementing security in low cost wireless sensor networks. The objective of this research is to reduce the deployment time and computational complexity of security protocols in WSNs, whilst keeping security related performance parameters at par with the current state-of-the-art. A method is proposed to continue using simple radio transreceiver for communication while ensuring that the information contained therein is sufficiently se...
Oct 1, 2015 in ITW (Information Theory Workshop)
#1Jhordany Rodriguez Parra (UniSA: University of South Australia)H-Index: 1
#2Terence Chan (UniSA: University of South Australia)H-Index: 18
Last. Siu-Wai Ho (UniSA: University of South Australia)H-Index: 17
view all 4 authors...
Physical Layer Network coding (PLNC) can significantly improve network performance, but some security issues arise due to the limited information available to the forwarders. This paper analyses authentication in networks with PLNC and show theoretical and practical security limits. In particular, we obtain a lower bound for the probability of an attacker being able to insert a false message such that the message is believed to come from a legitimate source. We prove that an information-theoreti...
#1Tao Wang (USF: University of South Florida)H-Index: 5
#2Yao Liu (USF: University of South Florida)H-Index: 23
Last. Athanasios V. Vasilakos (UoWM: University of Western Macedonia)H-Index: 90
view all 3 authors...
Channel reciprocity based key establishment techniques have attracted more and more attention from the wireless security research community for its easy implementation, low computational requirement, and small energy consumption. The basic idea of these techniques is to establish a shared key by utilizing the wireless channel reciprocity, i.e., the transmitter and receiver of one wireless link can observe the same channel simultaneously. In this survey, we reviewed different types of existing te...
54 CitationsSource