In this paper, we formulate the requirements for privacy protecting biometric authentication systems. The secrecy capacity Cs is investigated for the discrete and the continuous case. We present, furthermore, a general algorithm that meets the requirements and achieves Cs as well as Cid (the identification capacity). Finally, we present some practical constructions of the general algorithm and ...

OF THE THESIS Properties of LDGM-LDPC codes With Applications to Secrecy Coding by Manik Raina Thesis Directors: Professor Predrag Spasojević The ensemble of low-density generator-matrix/low-density parity-check (LDGM-LDPC) codes has been proposed in literature. In this thesis, an irregular LDGM-LDPC code is studied as a sub-code of an LDPC code with some randomly punctured outputbits. It is sh...

Wyner’s wiretap channel is extended to parallel broadcast channels and fading channels with multiple receivers. In the first part of the paper, we consider the setup of parallel broadcast channels with one sender, multiple intended receivers, and one eavesdropper. We study the situations where the sender broadcasts either a common message or independent messages to the intended receivers. We de...

Energy harvesting (EH) has attracted a lot of attention in cooperative communication networks studies for its capability of transferring energy from sources to relays. In this paper, we study the secrecy capacity of a cooperative compressed sensing amplify and forward (CCS-AF) wireless network in the presence of eavesdroppers based on an energy harvesting protocol. In this model, the source nod...

Relaying is one of the useful techniques to enhance wireless physical-layer security. Existing literature shows that employing full-duplex relay instead of conventional half-duplex relay improves secrecy capacity and secrecy outage probability, but this is at the price of sophisticated implementation. As an alternative, two-path successive relaying has been proposed to emulate operation of full...

Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 Discrete Memoryless Channels . . . . . . . . . . . . . . . . . . . . . . . . 2 The Binary Symmetric Channel . . . . . . . . . . . . . . . . . . . . . . . 4 Secrecy Capacity of a Channel . . . . . . . . . . . . . . . . . . . . . . . . 9 Secret Key Agreement Rate by Public Discussion . . . . . . . . . . . . . 17 On...

We study the capacity of quantum private information retrieval (QPIR) with multiple servers. In QPIR problem servers, a user retrieves classical file by downloading systems from servers each which contains copy set while identity downloaded is not leaked to server. The defined as maximum rate size over whole dimension systems. When are assumed share prior entanglement, we prove that 1 regardles...

One of the basic problems in cryptography is the generation of a common secret key between two parties, for instance in order to communicate privately. In this paper we consider information-theoretically secure key agreement. Wyner and subsequently Csiszár and Körner described and analyzed settings for secret-key agreement based on noisy communication channels. Maurer as well as Ahlswede and Cs...

This paper studies the value of limited rate cooperation between the transmitters for managing interference and simultaneously ensuring secrecy, in the 2-user Gaussian symmetric interference channel (GSIC). First, the problem is studied in the symmetric linear deterministic IC (SLDIC) setting, and achievable schemes are proposed, based on interference cancelation, relaying of the other user’s d...