Allerton 2015 Paper Abstract

Close

Paper ThB2.4

Issa, Ibrahim (Cornell University), Wagner, Aaron (Cornell University)

Measuring Secrecy by the Probability of a Successful Guess

Scheduled for presentation during the Invited Session "Information Theory and Applications" (ThB2), Thursday, October 1, 2015, 11:30−11:50, Solarium

53rd Annual Allerton Conference on Communication, Control, and Computing, Sept 29-Oct 2, 2015, Allerton Park and Retreat Center, Monticello, IL, USA

This information is tentative and subject to change. Compiled on November 19, 2019

Keywords Information Theory, Security and Trust, Reliable and Trustworthy Networks

Abstract

A secrecy system in which both the legitimate receiver and an eavesdropper are allowed some distortion is studied. The eavesdropper is allowed to make one guess, and the considered secrecy metric is the exponent of the probability that the guess is within an acceptable distortion level. A subsequent notion of information leakage is suggested. In the absence of any shared key between the transmitter and the legitimate receiver, a single-letter characterization of the highest achievable exponent is provided. Moreover, asymptotically-optimal universal strategies for both the primary user and the eavesdropper are demonstrated, where universality means independence of the source statistics. When a secret key is shared between the transmitter and the legitimate receiver, and a rate constraint is imposed, upper and lower bounds on the optimal exponent are given. Certain sufficient conditions for the bounds to meet are provided, and examples where they apply are discussed.

 

 

All Content © PaperCept, Inc..


This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2019 PaperCept, Inc.
Page generated 2019-11-19  13:08:06 PST  Terms of use