Paper 2022/077

Multiple Noisy Private Remote Source Observations for Secure Function Computation

Onur Gunlu, Matthieu Bloch, and Rafael F. Schaefer

Abstract

The problem of reliable function computation is extended by imposing privacy, secrecy, and storage constraints on a remote source whose noisy measurements are observed by multiple parties. The main additions to the classic function computation problem include 1) privacy leakage to an eavesdropper is measured with respect to the remote source rather than the transmitting terminals' observed sequences; 2) the information leakage to a fusion center with respect to the remote source is considered as another privacy leakage metric; 3) two transmitting node observations are used to compute a function. Inner and outer bounds on the rate regions are derived for lossless single-function computation with two transmitting nodes, which recover previous results in the literature, and for special cases that consider invertible functions simplified bounds are established.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Preprint. Minor revision.
Keywords
secure function computationsremote sourceinformation theoretic security
Contact author(s)
onur guenlue @ uni-siegen de
History
2022-05-20: revised
2022-01-20: received
See all versions
Short URL
https://ia.cr/2022/077
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2022/077,
      author = {Onur Gunlu and Matthieu Bloch and Rafael F.  Schaefer},
      title = {Multiple Noisy Private Remote Source Observations for Secure Function Computation},
      howpublished = {Cryptology ePrint Archive, Paper 2022/077},
      year = {2022},
      note = {\url{https://eprint.iacr.org/2022/077}},
      url = {https://eprint.iacr.org/2022/077}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.