System-state-free false data injection attack for nonlinear state estimation in smart grid

published_or_final_versio

Analogue private communication based on hybrid chaotic systems with delays

International audienceSince most of private communication schemes based on chaotic synchronization are not robust again plain-texts attacks, the introduction of delays in the schemes can be regarded as an efficient method to improve the security degree with respect to such attack. As an extension of our recent work, this paper proposes a new analogue private communication scheme based on hybrid chaotic systems with delays. The proposed scheme is based on the notation of weakly left invertibility of switched systems, and an illustrative example is given for the purpose of highlighting the feasibility of the proposed method

Models and Algorithms for Graph Watermarking

We introduce models and algorithmic foundations for graph watermarking. Our frameworks include security definitions and proofs, as well as characterizations when graph watermarking is algorithmically feasible, in spite of the fact that the general problem is NP-complete by simple reductions from the subgraph isomorphism or graph edit distance problems. In the digital watermarking of many types of files, an implicit step in the recovery of a watermark is the mapping of individual pieces of data, such as image pixels or movie frames, from one object to another. In graphs, this step corresponds to approximately matching vertices of one graph to another based on graph invariants such as vertex degree. Our approach is based on characterizing the feasibility of graph watermarking in terms of keygen, marking, and identification functions defined over graph families with known distributions. We demonstrate the strength of this approach with exemplary watermarking schemes for two random graph models, the classic Erd\H{o}s-R\'{e}nyi model and a random power-law graph model, both of which are used to model real-world networks