kth.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Privacy of Information Sharing Schemes in a Cloud-based Multi-sensor Estimation Problem
KTH, School of Electrical Engineering (EES), Automatic Control.ORCID iD: 0000-0002-3750-0135
KTH, School of Electrical Engineering (EES), Automatic Control.ORCID iD: 0000-0002-7926-5081
KTH, School of Electrical Engineering (EES), Automatic Control.ORCID iD: 0000-0001-9940-5929
2018 (English)In: 2018 Annual American Control Conference (ACC), Institute of Electrical and Electronics Engineers (IEEE), 2018, p. 998-1002, article id 8431192Conference paper, Published paper (Refereed)
Abstract [en]

In this paper, we consider a multi-sensor estimation problem wherein each sensor collects noisy information about its local process, which is only observed by that sensor, and a common process, which is simultaneously observed by all sensors. The objective is to assess the privacy level of (the local process of) each sensor while the common process is estimated using cloud computing technology. The privacy level of a sensor is defined as the conditional entropy of its local process given the shared information with the cloud. Two information sharing schemes are considered: a local scheme, and a global scheme. Under the local scheme, each sensor estimates the common process based on its measurement and transmits its estimate to a cloud. Under the global scheme, the cloud receives the sum of the sensors' measurements. It is shown that, in the local scheme, the privacy level of each sensor is always above a certain level which is characterized using Shannon's mutual information. It is also proved that this result becomes tight as the number of sensors increases. We also show that the global scheme is asymptotically private, i.e., the privacy loss of the global scheme decreases to zero at the rate of O(1/M) where M is the number of sensors.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2018. p. 998-1002, article id 8431192
Series
Proceedings of the American Control Conference, ISSN 0743-1619
National Category
Communication Systems
Identifiers
URN: urn:nbn:se:kth:diva-234705DOI: 10.23919/ACC.2018.8431192ISI: 000591256601010Scopus ID: 2-s2.0-85052564006OAI: oai:DiVA.org:kth-234705DiVA, id: diva2:1246740
Conference
2018 Annual American Control Conference, ACC 2018, Wisconsin Center / Hilton ,Milwauke City Center Milwauke, United States, 27 June 2018 through 29 June 2018
Note

QC 20180910

Part of proceedings: ISBN 978-1-5386-5428-6

Available from: 2018-09-10 Created: 2018-09-10 Last updated: 2024-03-15Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Nekouei, EhsanSkoglund, MikaelJohansson, Karl H.

Search in DiVA

By author/editor
Nekouei, EhsanSkoglund, MikaelJohansson, Karl H.
By organisation
Automatic Control
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 22 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf