Privacy through familiarity

This paper considers the problem of transmitting digital data from a source reliably to a legitimate user, subjected to a wiretap at a receiver that employs a fixed decoding strategy. Specifically, we assume that the wiretapper views the same channel output as the legitimate user, but decodes the message using some fixed decoding strategy which might be mismatched with respect to the channel. This model aims to capture the natural situation in privacy where knowledge of the privacy mapping at the source can me modeled as channel statistics. In that case, all observers receive the same data, but have different levels of knowledge, or familiarity, regarding the observed user who uses a privacy mapping. We analyze two different security metrics; probability of error at the eavesdropper and semantic-security, and provide achievable rates under both criteria.

[1]  Alexander Vardy,et al.  A Cryptographic Treatment of the Wiretap Channel , 2012, IACR Cryptol. ePrint Arch..

[2]  Neri Merhav Exact Random Coding Error Exponents of Optimal Bin Index Decoding , 2014, IEEE Transactions on Information Theory.

[3]  Mihir Bellare,et al.  Polynomial-Time, Semantically-Secure Encryption Achieving the Secrecy Capacity , 2012, IACR Cryptol. ePrint Arch..

[4]  Masahito Hayashi,et al.  General nonasymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to the wiretap channel , 2006, IEEE Transactions on Information Theory.

[5]  Imre Csiszár,et al.  Broadcast channels with confidential messages , 1978, IEEE Trans. Inf. Theory.

[6]  Paul W. Cuff A stronger soft-covering lemma and applications , 2015, 2015 IEEE Conference on Communications and Network Security (CNS).

[7]  Silvio Micali,et al.  Probabilistic Encryption , 1984, J. Comput. Syst. Sci..

[8]  Naftali Tishby,et al.  The information bottleneck method , 2000, ArXiv.

[9]  Mihir Bellare,et al.  A concrete security treatment of symmetric encryption , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[10]  Sergio Verdú,et al.  Approximation theory of output statistics , 1993, IEEE Trans. Inf. Theory.

[11]  Matthieu R. Bloch,et al.  Physical-Layer Security: From Information Theory to Security Engineering , 2011 .

[12]  Anelia Somekh-Baruch A General Formula for the Mismatch Capacity , 2015, IEEE Transactions on Information Theory.

[13]  A. D. Wyner,et al.  The wire-tap channel , 1975, The Bell System Technical Journal.

[14]  Paul W. Cuff,et al.  Rate-distortion theory for secrecy systems , 2013, 2013 IEEE International Symposium on Information Theory.

[15]  Flávio du Pin Calmon,et al.  Privacy against statistical inference , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[16]  Cynthia Dwork,et al.  Calibrating Noise to Sensitivity in Private Data Analysis , 2006, TCC.

[17]  Neri Merhav,et al.  Random Coding Error Exponents for the Two-User Interference Channel , 2015, IEEE Transactions on Information Theory.

[18]  Alfonso Martinez,et al.  Mismatched Multi-Letter Successive Decoding for the Multiple-Access Channel , 2016, IEEE Transactions on Information Theory.

[19]  Matthieu R. Bloch,et al.  Strong Secrecy From Channel Resolvability , 2011, IEEE Transactions on Information Theory.

[20]  Ramakrishnan Srikant,et al.  Privacy-preserving data mining , 2000, SIGMOD '00.