A Generalized Constraint of Privacy: <inline-formula> <tex-math notation="LaTeX">$\alpha$ </tex-math></inline-formula>-Mutual Information Security

We study the security of a variety of cryptographic tasks including traditional privacy (e.g., seeded extractors, encryptions, commitments, and secret sharing schemes) and differential privacy from the perspective of &#x03B1;-mutual information. As far as we know, encryption scheme, commitment,...

Full description

Bibliographic Details
Main Author: Yanqing Yao
Format: Article
Language:English
Published: IEEE 2019-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/8672471/
id doaj-984d8c6ffafc4bc785dc6fa872f0a87f
record_format Article
spelling doaj-984d8c6ffafc4bc785dc6fa872f0a87f2021-03-29T22:23:21ZengIEEEIEEE Access2169-35362019-01-017361223613110.1109/ACCESS.2019.29052788672471A Generalized Constraint of Privacy: <inline-formula> <tex-math notation="LaTeX">$\alpha$ </tex-math></inline-formula>-Mutual Information SecurityYanqing Yao0https://orcid.org/0000-0001-5071-4907State Key Laboratory of Software Development Environment, Beihang University, Beijing, ChinaWe study the security of a variety of cryptographic tasks including traditional privacy (e.g., seeded extractors, encryptions, commitments, and secret sharing schemes) and differential privacy from the perspective of &#x03B1;-mutual information. As far as we know, encryption scheme, commitment, and differential privacy have been studied via mutual information based on the Shannon entropy. Though Bellare et al. in CRYPTO 2012 have got some results about encryption schemes, the upper bound of mutual information is not the tightest. Though Cuff and Yu in CCS 2016 mentioned the direction of the Re&#x0301;nyi entropy generalization, only a few results about differential privacy were obtained, and even for Shannon entropy, the proof in that paper has some limitations. In this paper, we propose a modular and unified framework to study the relations between statistical security and mutual information security for a series of privacy schemes other than prior work that focused on a special scheme. In addition, we introduce &#x03B1;-mutual information security via the Re&#x0301;nyi entropy for a series of privacy schemes and aim to bridge the gap between statistical security and &#x03B1;-mutual information security. By resorting to an improved upper bound on the difference between the Shannon entropy of two distributions, the convexity of a function, useful equality about statistical distance, and the absolutely homogeneous property of &#x03B1;-norm, we obtain rigorous proofs of their essential equivalence. An extra fruit is that the relations between mutual information security and statistical security of encryption and commitment schemes are improved. Hence, two fundamentally different ways of defining privacy security are connected.https://ieeexplore.ieee.org/document/8672471/Differential privacymutual informationRényi entropystatistical securitytraditional privacy schemes
collection DOAJ
language English
format Article
sources DOAJ
author Yanqing Yao
spellingShingle Yanqing Yao
A Generalized Constraint of Privacy: <inline-formula> <tex-math notation="LaTeX">$\alpha$ </tex-math></inline-formula>-Mutual Information Security
IEEE Access
Differential privacy
mutual information
Rényi entropy
statistical security
traditional privacy schemes
author_facet Yanqing Yao
author_sort Yanqing Yao
title A Generalized Constraint of Privacy: <inline-formula> <tex-math notation="LaTeX">$\alpha$ </tex-math></inline-formula>-Mutual Information Security
title_short A Generalized Constraint of Privacy: <inline-formula> <tex-math notation="LaTeX">$\alpha$ </tex-math></inline-formula>-Mutual Information Security
title_full A Generalized Constraint of Privacy: <inline-formula> <tex-math notation="LaTeX">$\alpha$ </tex-math></inline-formula>-Mutual Information Security
title_fullStr A Generalized Constraint of Privacy: <inline-formula> <tex-math notation="LaTeX">$\alpha$ </tex-math></inline-formula>-Mutual Information Security
title_full_unstemmed A Generalized Constraint of Privacy: <inline-formula> <tex-math notation="LaTeX">$\alpha$ </tex-math></inline-formula>-Mutual Information Security
title_sort generalized constraint of privacy: <inline-formula> <tex-math notation="latex">$\alpha$ </tex-math></inline-formula>-mutual information security
publisher IEEE
series IEEE Access
issn 2169-3536
publishDate 2019-01-01
description We study the security of a variety of cryptographic tasks including traditional privacy (e.g., seeded extractors, encryptions, commitments, and secret sharing schemes) and differential privacy from the perspective of &#x03B1;-mutual information. As far as we know, encryption scheme, commitment, and differential privacy have been studied via mutual information based on the Shannon entropy. Though Bellare et al. in CRYPTO 2012 have got some results about encryption schemes, the upper bound of mutual information is not the tightest. Though Cuff and Yu in CCS 2016 mentioned the direction of the Re&#x0301;nyi entropy generalization, only a few results about differential privacy were obtained, and even for Shannon entropy, the proof in that paper has some limitations. In this paper, we propose a modular and unified framework to study the relations between statistical security and mutual information security for a series of privacy schemes other than prior work that focused on a special scheme. In addition, we introduce &#x03B1;-mutual information security via the Re&#x0301;nyi entropy for a series of privacy schemes and aim to bridge the gap between statistical security and &#x03B1;-mutual information security. By resorting to an improved upper bound on the difference between the Shannon entropy of two distributions, the convexity of a function, useful equality about statistical distance, and the absolutely homogeneous property of &#x03B1;-norm, we obtain rigorous proofs of their essential equivalence. An extra fruit is that the relations between mutual information security and statistical security of encryption and commitment schemes are improved. Hence, two fundamentally different ways of defining privacy security are connected.
topic Differential privacy
mutual information
Rényi entropy
statistical security
traditional privacy schemes
url https://ieeexplore.ieee.org/document/8672471/
work_keys_str_mv AT yanqingyao ageneralizedconstraintofprivacyinlineformulatexmathnotationlatexalphatexmathinlineformulamutualinformationsecurity
AT yanqingyao generalizedconstraintofprivacyinlineformulatexmathnotationlatexalphatexmathinlineformulamutualinformationsecurity
_version_ 1724191756945195008