Zobrazeno 1 - 10
of 41
pro vyhledávání: '"Rolando Trujillo-Rasua"'
Publikováno v:
2022 IEEE 35th Computer Security Foundations Symposium (CSF).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3949bbdb746d970b9df225c4d7b2f982
https://doi.org/10.1109/csf54842.2022.9919655
https://doi.org/10.1109/csf54842.2022.9919655
Active re-identification attacks constitute a serious threat to privacy-preserving social graph publication, because of the ability of active adversaries to leverage fake accounts, a.k.a.sybil nodes, to enforce structural patterns that can be used to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4de6f3487fcf3df54aac735cbbbd84ce
http://orbilu.uni.lu/handle/10993/53953
http://orbilu.uni.lu/handle/10993/53953
Publikováno v:
Network and System Security ISBN: 9783031230196
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2f69616480abcf49692501a3e490935b
https://doi.org/10.1007/978-3-031-23020-2_29
https://doi.org/10.1007/978-3-031-23020-2_29
Publikováno v:
International Journal of Critical Infrastructure Protection. 37:100521
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7f4fc429d9ff00d7d1958180c3f53469
https://doi.org/10.1016/j.ijcip.2022.100521
https://doi.org/10.1016/j.ijcip.2022.100521
This article provides the first analysis of the differentially private computation of three centrality measures, namely eigenvector, Laplacian and closeness centralities, on arbitrary weighted graphs, using the smooth sensitivity approach. We do so b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0ccfd39a43ab7dba63379e9363911e92
Publikováno v:
Computers & Security. 112:102536
Digital technologies are increasingly being adopted in modern supply chains for product traceability, enabling data sharing amongst trading partners, quick availability of product data, and end-to-end visibility of products. This adoption increases t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::82925188aaa513f803bc00f437466c63
https://doi.org/10.1016/j.cose.2021.102536
https://doi.org/10.1016/j.cose.2021.102536
Publikováno v:
Knowledge and Information Systems. 61:485-511
Social network data is typically made available in a graph format, where users and their relations are represented by vertices and edges, respectively. In doing so, social graphs need to be anonymised to resist various privacy attacks. Among these, t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dafdf7de7f20286707e69cfb6bfeb589
https://doi.org/10.1007/s10115-018-1283-x
https://doi.org/10.1007/s10115-018-1283-x
Publikováno v:
Fundamenta Informaticae. 152:273-287
A vertex cover of a graph G = (V, E) is a set X ⊂ V such that each edge of G is incident to at least one vertex of X. The ve cardinality of a vertex cover of G. A dominating set D ⊆ V is a weakly connected dominating set of G if the subgraph G[D]
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6afc1cb6355dcdb4dd006049cbc6993d
https://doi.org/10.3233/fi-2017-1520
https://doi.org/10.3233/fi-2017-1520
Publikováno v:
Applied Mathematics and Computation, 363, 124612. New York, Netherlands: Elsevier (2019).
The characterisation of vertices in a network, in relation to other peers, has been used as a primitive in many computational procedures, such as node localisation and (de-)anonymisation. This article focuses on a characterisation type known as the m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::77fddb92ab45061df615e5e7c6b94f7d
http://orbilu.uni.lu/handle/10993/40570
http://orbilu.uni.lu/handle/10993/40570
Publikováno v:
CCS
Verification of cryptographic protocols is traditionally built upon the assumption that participants have not revealed their long-term keys. However, in some cases, participants might collude to defeat some security goals, without revealing their lon
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b0a9d766cb00d491109935d13bd67b2e
https://doi.org/10.1145/3319535.3345651
https://doi.org/10.1145/3319535.3345651