2023
DOI: 10.1016/j.automatica.2023.110908
|View full text |Cite
|
Sign up to set email alerts
|

Differential privacy for symbolic systems with application to Markov Chains

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 12 publications
(2 citation statements)
references
References 42 publications
0
2
0
Order By: Relevance
“…Two differentially private gradient methods were proposed for distributed optimization problems in [33] to ensure both privacy and optimization accuracy. For some non-numerical or symbolic data, a novel differential privacy mechanism was proposed in [34] for protecting sensitive symbolic system trajectories and the results were applied to Markov chains. From the point of systems and control theory, the authors in [35] investigated the relation between differential privacy and strong input observability of the systems and designed a privacy-preserving controller for a tracking problem.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Two differentially private gradient methods were proposed for distributed optimization problems in [33] to ensure both privacy and optimization accuracy. For some non-numerical or symbolic data, a novel differential privacy mechanism was proposed in [34] for protecting sensitive symbolic system trajectories and the results were applied to Markov chains. From the point of systems and control theory, the authors in [35] investigated the relation between differential privacy and strong input observability of the systems and designed a privacy-preserving controller for a tracking problem.…”
Section: Introductionmentioning
confidence: 99%
“…(Necessity). Suppose the system is observable, then x 0 can be uniquely determined from the system of Equation (34). The system yields a unique solution for x 0 , which means there exists at least n rows in O L that are linearly independent.…”
mentioning
confidence: 99%