The fundamental limits of biometric identification systems under a strong secrecy criterion are investigated. In the previous studies this scenario, trade-off among secrecy, template, privacy- and secrecy-leakages has been revealed in case where there is only one user, while multiple users not discussed yet. study, we consider system with exponentially many users, characterize capacity region r...

In this paper, we investigate power allocation that maximizes the secrecy rate of orthogonal frequency division multiplexing (OFDM) systems under arbitrarily distributed inputs. Considering commonly assumed Gaussian inputs are unrealistic, we focus on secrecy systems with more practical discrete distributed inputs, such as PSK, QAM, etc. While the secrecy rate achieved by Gaussian distributed i...

This paper investigates from the physical layer security (PLS) perspective the fundamental issues of mode selection and spectrum partition in cellular networks with inband device-to-device (D2D) communication. We consider a mode selection scheme allowing each D2D pair to probabilistically switch between the underlay and overlay modes, and also a spectrum partition scheme where the system spectr...

The practice of gamete donation has, until recently, been shrouded in secrecy. The stigma associated with infertility and, in particular, donor insemination has been the main factor contributing to this secrecy. Over the last 20 years, this secrecy and the anonymity of the gamete donors has been challenged. In the first instance, the challenge came from governments in some countries legislating...

This letter proposes a novel UAV-enabled mobile jamming scheme to improve the secrecy rate of ground wiretap channel. Specifically, a UAV is employed to transmit jamming signals to combat against eavesdropping. Such a mobile jamming scheme is particularly appealing since the UAV-enabled jammer can fly close to the eavesdropper and opportunistically jam it by leveraging the UAV’s mobility. We ai...

This study deals with opportunistic relay selection in cooperative networks with secrecy constraints, where an eavesdropper node tries to overhead the source message. Previously reported relay selection techniques are optimised for non-eavesdropper environments and cannot ensure security. Two new opportunistic relay selection techniques, which incorporate the quality of the relay-eavesdropper l...

We derive a lower bound on the secrecy capacity of the compound wiretap channel with channel state information at the transmitter which matches the general upper bound on the secrecy capacity of general compound wiretap channels given by Liang et al. and thus establishing a full coding theorem in this case. We achieve this with a stronger secrecy criterion and the maximum error probability crit...

We present a novel, simple technique for proving secrecy properties for security protocols that manipulate lists of unbounded length, for an unbounded number of sessions. More specifically, our technique relies on the Horn clause approach used in the automatic verifier ProVerif: we show that if a protocol is proven secure by our technique with lists of length one, then it is secure for lists of...

Hwang and Li proposed the first remote user authentication scheme using smart cards to solve the problems of Lamport scheme. Unfortunately, Hwang and Li’s scheme has some security weaknesses. First, ChanChang, ShenLinHwang and then Chang-Hwang pointed out some attacks on Hwang – Li’s scheme. This paper presents a new remote user authentication scheme with forward secrecy, which provides forward...