Pasar al contenido principal

ANALISIS FORENSE AVANZADO

TEC2015-68734-R

•
Nombre agencia financiadora Ministerio de Economía y Competitividad
Acrónimo agencia financiadora MINECO
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos I+D+i Retos de Investigación
Año convocatoria 2015
Plan Estatal 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Unidad de gestión Dirección General de Investigación Científica y Técnica
Centro beneficiario UNIVERSITAT POLITECNICA DE CATALUNYA
Identificador persistente http://dx.doi.org/10.13039/501100003329

Resultados relacionados

Resultados totales (Incluyendo duplicados): 9
Encontrada(s) 1 página(s)

DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Simplicial degree in complex networks. Applications of Topological Data Analysis to Network Science

  • Hernández-Serrano, Daniel
  • Hernández-Serrano, Juan
  • Sánchez-Gómez, Darío
52 pages, 12 figures, 4 tables . -- PACS: 89.75.-k 89.75.Fb 89.75. Hc 2020 MSC; 55U10; 62R40; 91D30; 05C82; 82M99; 82B43; 05E45, Network Science provides a universal formalism for modelling and studying complex systems based on pairwise interactions between agents. However, many real networks in the social, biological or computer sciences involve interactions among more than two agents, having thus an inherent structure of a simplicial complex. We propose new notions of higher-order degrees of adjacency for simplices in a simplicial complex, allowing any dimensional comparison among them and their faces, which as far as we know were lacked in the literature. We introduce multi-parameter boundary and coboundary operators in an oriented simplicial complex and also a novel multi-combinatorial Laplacian is defined, which generalises the graph and combinatorial Laplacian. To illustrate the potential applications of these theoretical results, we perform a structural analysis of higher-order connectivity in simplicial-complex networks by studying the associated distributions with these simplicial degrees in 17 real-world datasets coming from different domains such as coauthor networks, cosponsoring Congress bills, contacts in schools, drug abuse warning networks, e-mail networks or publications and users in online forums. We find rich and diverse higher-order connectivity structures and observe that datasets of the same type reflect similar higher-order collaboration patterns. Furthermore, we show that if we use what we have called the maximal simplicial degree (which counts the distinct maximal communities in which our simplex and all its strict sub-communities are contained), then its degree distribution is, in general, surprisingly different from the classical node degree distribution., This work has been supported by Ministerio de Economía y Competitividad (Spain) and the European Union through FEDER funds under grants TIN2017-84844-C2-2-R, MTM2017-86042-P and TEC2015-68734-R, the project STAMGAD 18.J445 / 463AC03 supported by Consejería de Educación (GIR, Junta de Castilla y León, Spain), and the Generalitat de Catalunya grant 2017-SGR-00782., Peer reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Constructions of almost secure frameproof codes with applications to fingerprinting schemes

  • Moreira, Jose
  • Fernández Muñoz, Marcel|||0000-0001-7655-135X
  • Kabatiansky, Grigory
The final publication is available at Springer via http://dx.doi.org/10.1007/s10623-017-0359-z, This paper presents explicit constructions of fingerprinting codes. The proposed constructions use a class of codes called almost secure frameproof codes. An almost secure frameproof code is a relaxed version of a secure frameproof code, which in turn is the same as a separating code. This relaxed version is the object of our interest because it gives rise to fingerprinting codes of higher rate than fingerprinting codes derived from separating codes. The construction of almost secure frameproof codes discussed here is based on weakly biased arrays, a class of combinatorial objects tightly related to weakly dependent random variables., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Incremental k-Anonymous microaggregation in large-scale electronic surveys with optimized scheduling

  • Rebollo Monedero, David|||0000-0002-0783-2382
  • Forné Muñoz, Jorge|||0000-0002-8401-3292
  • Soriano Ibáñez, Miguel|||0000-0003-0457-8531
  • Hernández Baigorri, César
Improvements in technology have led to enormous volumes of detailed personal information made available for any number of statistical studies. This has stimulated the need for anonymization techniques striving to attain a difficult compromise between the usefulness of the data and the protection of our privacy. k-Anonymous microaggregation permits releasing a dataset where each person remains indistinguishable from other k–1 individuals, through the aggregation of demographic attributes, otherwise a potential culprit for respondent reidentification. Although privacy guarantees are by no means absolute, the elegant simplicity of the k-anonymity criterion and the excellent preservation of information utility of microaggregation algorithms has turned them into widely popular approaches whenever data utility is critical. Unfortunately, high-utility algorithms on large datasets inherently require extensive computation. This work addresses the need of running k-anonymous microaggregation efficiently with mild distortion loss, exploiting the fact that the data may arrive over an extended period of time. Specifically, we propose to split the original dataset into two portions that will be processed subsequently, allowing the first process to start before the entire dataset is received, while leveraging the superlinearity of the microaggregation algorithms involved. A detailed mathematical formulation enables us to calculate the optimal time for the fastest anonymization, as well as for minimum distortion under a given deadline. Two incremental microaggregation algorithms are devised, for which extensive experimentation is reported. The theoretical methodology presented should prove invaluable in numerous data-collection applications, including largescale electronic surveys in which computation is possible as the data comes in., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

On non-binary traceability set systems

  • Egorova, Elena
  • Fernández Muñoz, Marcel|||0000-0001-7655-135X
  • Kabatiansky, Grigory
We introduce non-binary IPP set systems with traceability properties that have IPP codes and binary IPP set systems with traceability capabilities as particular cases. We prove an analogue of the Gilbert–Varshamov bound for such systems., Marcel Fernandez: The work of M. Fernández has been supported by the Spanish Government Grant TEC2015- 68734-R and Catalan Government Grant SGR 782., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Simplicial degree in complex networks. Applications of topological data analysis to network science

  • Hernández Serrano, Daniel
  • Hernández Serrano, Juan|||0000-0001-5225-7404
  • Sánchez Gómez, Darío
Network Science provides a universal formalism for modelling and studying complex systems based on pairwise interactions between agents. However, many real networks in the social, biological or computer sciences involve interactions among more than two agents, having thus an inherent structure of a simplicial complex. The relevance of an agent in a graph network is given in terms of its degree, and in a simplicial network there are already notions of adjacency and degree for simplices that, as far as we know, are not valid for comparing simplices in different dimensions. We propose new notions of higher-order degrees of adjacency for simplices in a simplicial complex, allowing any dimensional comparison among them and their faces. We introduce multi-parameter boundary and coboundary operators in an oriented simplicial complex and also a novel multi-combinatorial Laplacian is defined. As for the graph or combinatorial Laplacian, the multi-combinatorial Laplacian is shown to be an effective tool for calculating the higher-order degrees presented here. To illustrate the potential applications of these theoretical results, we perform a structural analysis of higher-order connectivity in simplicial-complex networks by studying the associated distributions with these simplicial degrees in 17 real-world datasets coming from different domains such as coauthor networks, cosponsoring Congress bills, contacts in schools, drug abuse warning networks, e-mail networks or publications and users in online forums. We find rich and diverse higher-order connectivity structures and observe that datasets of the same type reflect similar higher-order collaboration patterns. Furthermore, we show that if we use what we have called the maximal simplicial degree (which counts the distinct maximal communities in which our simplex and all its strict sub-communities are contained), then its degree distribution is, in general, surprisingly different from the classical node degree distribution., This work has been supported by Ministerio de Economía y Competitividad (Spain) and the European Union through FEDER funds under grants TIN2017-84844-C2-1-R, MTM2017-86042-P and TEC2015-68734-R, the project STAMGAD 18.J445 / 463AC03 supported by Consejer´ıa de Educaci´on (GIR, Junta de Castilla y Le´on, Spain), and the Generalitat de Catalunya grant 2017-SGR-00782
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

On non-binary traceability set systems

  • Egorova, Elena
  • Fernández Muñoz, Marcel
  • Kabatiansky, Grigory
We introduce non-binary IPP set systems with traceability properties that have IPP codes and binary IPP set systems with traceability capabilities as particular cases. We prove an analogue of the Gilbert–Varshamov bound for such systems., Marcel Fernandez: The work of M. Fernández has been supported by the Spanish Government Grant TEC2015- 68734-R and Catalan Government Grant SGR 782., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Constructions of almost secure frameproof codes with applications to fingerprinting schemes

  • Moreira, Jose
  • Fernández Muñoz, Marcel
  • Kabatiansky, Grigory
The final publication is available at Springer via http://dx.doi.org/10.1007/s10623-017-0359-z, This paper presents explicit constructions of fingerprinting codes. The proposed constructions use a class of codes called almost secure frameproof codes. An almost secure frameproof code is a relaxed version of a secure frameproof code, which in turn is the same as a separating code. This relaxed version is the object of our interest because it gives rise to fingerprinting codes of higher rate than fingerprinting codes derived from separating codes. The construction of almost secure frameproof codes discussed here is based on weakly biased arrays, a class of combinatorial objects tightly related to weakly dependent random variables., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Simplicial degree in complex networks. Applications of topological data analysis to network science

  • Hernández Serrano, Daniel
  • Hernández Serrano, Juan
  • Sánchez Gómez, Darío
Network Science provides a universal formalism for modelling and studying complex systems based on pairwise interactions between agents. However, many real networks in the social, biological or computer sciences involve interactions among more than two agents, having thus an inherent structure of a simplicial complex. The relevance of an agent in a graph network is given in terms of its degree, and in a simplicial network there are already notions of adjacency and degree for simplices that, as far as we know, are not valid for comparing simplices in different dimensions. We propose new notions of higher-order degrees of adjacency for simplices in a simplicial complex, allowing any dimensional comparison among them and their faces. We introduce multi-parameter boundary and coboundary operators in an oriented simplicial complex and also a novel multi-combinatorial Laplacian is defined. As for the graph or combinatorial Laplacian, the multi-combinatorial Laplacian is shown to be an effective tool for calculating the higher-order degrees presented here. To illustrate the potential applications of these theoretical results, we perform a structural analysis of higher-order connectivity in simplicial-complex networks by studying the associated distributions with these simplicial degrees in 17 real-world datasets coming from different domains such as coauthor networks, cosponsoring Congress bills, contacts in schools, drug abuse warning networks, e-mail networks or publications and users in online forums. We find rich and diverse higher-order connectivity structures and observe that datasets of the same type reflect similar higher-order collaboration patterns. Furthermore, we show that if we use what we have called the maximal simplicial degree (which counts the distinct maximal communities in which our simplex and all its strict sub-communities are contained), then its degree distribution is, in general, surprisingly different from the classical node degree distribution., This work has been supported by Ministerio de Economía y Competitividad (Spain) and the European Union through FEDER funds under grants TIN2017-84844-C2-1-R, MTM2017-86042-P and TEC2015-68734-R, the project STAMGAD 18.J445 / 463AC03 supported by Consejer´ıa de Educaci´on (GIR, Junta de Castilla y Le´on, Spain), and the Generalitat de Catalunya grant 2017-SGR-00782, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Incremental k-Anonymous microaggregation in large-scale electronic surveys with optimized scheduling

  • Rebollo Monedero, David
  • Forné Muñoz, Jorge
  • Soriano Ibáñez, Miguel
  • Hernández Baigorri, César
Improvements in technology have led to enormous volumes of detailed personal information made available for any number of statistical studies. This has stimulated the need for anonymization techniques striving to attain a difficult compromise between the usefulness of the data and the protection of our privacy. k-Anonymous microaggregation permits releasing a dataset where each person remains indistinguishable from other k–1 individuals, through the aggregation of demographic attributes, otherwise a potential culprit for respondent reidentification. Although privacy guarantees are by no means absolute, the elegant simplicity of the k-anonymity criterion and the excellent preservation of information utility of microaggregation algorithms has turned them into widely popular approaches whenever data utility is critical. Unfortunately, high-utility algorithms on large datasets inherently require extensive computation. This work addresses the need of running k-anonymous microaggregation efficiently with mild distortion loss, exploiting the fact that the data may arrive over an extended period of time. Specifically, we propose to split the original dataset into two portions that will be processed subsequently, allowing the first process to start before the entire dataset is received, while leveraging the superlinearity of the microaggregation algorithms involved. A detailed mathematical formulation enables us to calculate the optimal time for the fastest anonymization, as well as for minimum distortion under a given deadline. Two incremental microaggregation algorithms are devised, for which extensive experimentation is reported. The theoretical methodology presented should prove invaluable in numerous data-collection applications, including largescale electronic surveys in which computation is possible as the data comes in., Peer Reviewed, Postprint (published version)