This paper proposes an architecture for biometric electronic identification document (e-ID) system based on Blockchain for citizens identity verification in transactions corresponding to the notary, registration, tax declaration and payment, basic health services and registration of economic activities, among others. To validate the user authentication, a biometric e-ID system is used to avoid spoofing and related attacks. Also, to validate the document a digital certificate is used with the corresponding public and private key for each citizen by using a user’s PIN. The proposed transaction validation process was implemented on a Blockchain system in order to record and verify the transactions made by all citizens registered in the electoral census, which guarantees security, integrity, scalability, traceability, and no-ambiguity. Additionally, a Blockchain network architecture is presented in a distributed and decentralized way including all the nodes of the network, database and government entities such as national register and notary offices. The results of the application of a new consensus algorithm to our Blockchain network are also presented showing mining time, memory and CPU usage when the number of transactions scales up.

In this paper we give an overview of the Blockchain. We explain quickly how it works thanks to the hash function and the distributed architecture. Then come the descriptions of the two most famous consensus algorithms: Proof of Work and Proof of Stake. We also present some security issues for each algorithm. This paper contains a little explanation of others consensus algorithms that are inspired of these two. Finally, a new consensus algorithm for private Blockchain is presented.

A wide range of IDS implementations with anomaly detection modules have been deployed. In general, those modules depend on intrusion knowledge databases, such as Knowledge Discovery Dataset (KDD99), Center for Applied Internet Data Analysis (CAIDA) or Community Resource for Archiving Wireless Data at Dartmouth (CRAWDAD), among others. Once the database is analyzed and a machine learning method is employed to generate detectors, some classes of new detectors are created. Thereafter, detectors are supposed to be deployed in real network environments in order to achieve detection with good results for false positives and detection rates. Since the traffic behavior is quite different according to the user’s network activities over available services, restrictions and applications, it is supposed that behavioral-based detectors are not well suited to all kind of networks. This paper presents the differences of detection results between some network scenarios by applying traditional detectors that were calculated with artificial neural networks. The same detector is deployed in different scenarios to measure the efficiency or inefficiency of static training detectors.

Trust models provide a framework to create and manage trust relationships among the different entities of a public key infrastructure (PKI). These trust relationships are verified through the certification path validation process, which involves: path discovery, signature verification and revocation status checking. When trust relationships are bidirectional, multiple paths can exist between two entities, which increase the runtime of the path discovery process. In addition, validation of long paths can be difficult, especially when storage and processing capacities of the verifier are limited. In this paper, we propose a protocol to establish a hierarchical trust model from a PKI with unidirectional and bidirectional trust relationships. This protocol makes more efficient the path validation process since in a hierarchical model, trust relationships are unidirectional and paths are easy to find. In addition, our protocol allows setting a maximum path length, so it can be adapted to the features of users' terminals.

Context: Self-sovereign identity (SSI) enables the creation of user-centric, privacy-by-design, secure, and decentralized identity-management systems. The aim of this paper is to carry out a bibliometric analysis of the scientific production on SSI during the period 2017-2022. Method: A complete bibliometric analysis of all publications on SSI indexed in Scopus and Web of Science was carried out. A corpus of 143 articles was examined by processing their bibliographic metadata on a bibliometric tool. In order to do this, the Bibliometrix packageand the R programming language were used. Results: A bibliometric characterization of the publications on SSI was obtained for the 2017 − 2022 period. The most important keywords used in these publications were identified, as well as their use tendencies throughout this period. Moreover, the most influential authors in the area and the most relevant publication sources were also identified. Conclusions: The results of the bibliometric analysis show that Lotka’s and Bradford’s laws apply for academic publications on SSI, which means that the most relevant publications in this area are concentrated in a relatively small group of authors and journals. Paul Jenkins, Nitin Naik, Yang Liu and Aijun An were the most impactful authors, and Lecture notes in computer science, Frontiers in blockchain and IEEE were the most influential journals. Finally, the keyword analysis showed that Blockchain, Authentication, Identity management, Electronic document identification systems, and Digital identity are currently the most relevant concepts for SSI. Contexto: La identidad auto-soberana (SSI, por sus siglas en inglés) permite la creación de sistemas de gestión de identidad centrados en el usuario, con privacidad desde el diseño, seguros y descentralizados. El objetivo de este artículo es realizar un análisis bibliométrico de la producción científica sobre SSI durante el período 2017 − 2022. Método: Se realizó una análisis bibliométrico completo de las publicaciones sobre SSI indexadas en Scopus y Web of Science. Se examinó un corpus de 143 artículos mediante el procesamiento de sus metadatos bibliográficos en una herramienta de análisis bibliométrico. Para ello, el paquete Bibliometrix y el lenguaje de programación R fueron usados. Resultados: Se obtuvo una caracterización bibliométrica de las publicaciones sobre SSI durante el período 2017 − 2022. Se identificaron las palabras clave más importantes, así como las tendencias de uso de las mismas en este periodo. Además, se determinaron los autores de mayor influencia en el área y las fuentes de publicación más relevantes. Conclusiones: Los resultados del análisis bibliométrico completo muestran que la ley de Lotka y la ley de Bradford se cumplen en las publicaciones sobre SSI. Esto quiere decir que las publicaciones de mayor alcance e impacto están concentradas en unos pocos autores y revistas. Paul Jenkins, Nitin Naik , Yang Liu y Aijun An resultaron ser los autores más representativos, y Lecture notes in computer science, IEEE Access y Frontiers in blockchain resultaron ser las revistas más influyentes. Finalmente, el análisis de las palabras clave mostró que Blockchain, Authentication, Identity management, Electronic document identification systems y Digital identity son actualmente los conceptos más importantes para la investigación sobre SSI.

Trust models provide a framework to create and manage trust relationships among the different entities of a Public Key Infrastructure (PKI). These trust relationships are verified through the certification path validation process, which involves: path discovery, signature verification and revocation status checking. When trust relationships are bidirectional, multiple paths can exist between two entities, which increase the runtime of the path discovery process. In addition, validation of long paths can be difficult, especially when storage and processing capacities of the verifier are limited. In this paper, we propose a protocol to establish a hierarchical trust model from a hybrid PKI. This protocol makes more efficient certification path discovery since in a hierarchical model, trust relationships are unidirectional and paths are easy to find. In addition, our protocol does not require issuing new certificates and allows setting a maximum path length, so it can be adapted to the features of users’ terminals.