Citation link:
Files in This Item:
File Description SizeFormat
Onur_Günlü_function computation.pdf383.75 kBAdobe PDFThumbnail
Dokument Type: Article
metadata.dc.title: Function computation under privacy, secrecy, distortion, and communication constraints
Authors: Günlü, Onur 
Institute: Department Elektrotechnik - Informatik 
Free keywords: Information theoretic privacy, Secure function computation, Remote source, Distributed computation
Dewey Decimal Classification: 004 Informatik
Issue Date: 2021
Publish Date: 2022
Source: Entropy, 24 (1), 2022 -
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 a new privacy leakage metric; (3) the function computed is allowed to be a distorted version of the target function, which allows the storage rate to be reduced compared to a reliable function computation scenario, in addition to reducing secrecy and privacy leakages; (4) two transmitting node observations are used to compute a function. Inner and outer bounds on the rate regions are derived for lossless and lossy single-function computation with two transmitting nodes, which recover previous results in the literature. For special cases, including invertible and partially invertible functions, and degraded measurement channels, exact lossless and lossy rate regions are characterized, and one exact region is evaluated as an example scenario.
Finanziert aus dem Open-Access-Publikationsfonds der Universität Siegen für Zeitschriftenartikel
URN: urn:nbn:de:hbz:467-22150
Appears in Collections:Publikationen aus der Universität Siegen

This item is protected by original copyright

Show full item record

Page view(s)

checked on Dec 3, 2022


checked on Dec 3, 2022

Google ScholarTM



This item is licensed under a Creative Commons License Creative Commons