Mikel Larrea
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Mikel Larrea has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Alberto Lafuente
Distributed Systems Group, University of the Basque Country (UPV/EHU), 48940 Leioa, Spain
6 shared publications - Roberto Cortiñas
Computer Science Faculty, University of the Basque Country UPV/EHU, Paseo M. Lardizábal 1, 20018 Donostia-San Sebastián, Spain
5 shared publications - Iratxe Soraluze
University of the Basque Country, Gipuzkoa, Spain
4 shared publications - Cristian Martín
Univ Basque Country, UPV EHU, San Sebastian 20018, Spain
2 shared publications - Ernesto Jiménez
Universidad Politecnica de Madrid, Madrid, Spain
2 shared publications - Sergio Arévalo
Universidad Politécnica de Madrid
2 shared publications
Latest Publications
- 25 July 2015
- Published by Springer Nature
- p. 333-345
A Connectivity Model for Agreement in Dynamic Systems
- 25 July 2015
- Published by Springer Nature
- p. 333-345
A Connectivity Model for Agreement in Dynamic Systems
- 1 March 2015
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 81 (2) , 383-397
Communication-optimal eventually perfect failure detection in partially synchronous systems
- 1 March 2015
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 81 (2) , 383-397
Communication-optimal eventually perfect failure detection in partially synchronous systems
- 9 June 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Latin America Transactions
- Vol. 12 (3) , 442-448
Boosting Dependable Ubiquitous Computing: A Case Study
Ubiquitous computing has inherent features, e.g., a number of elements in the system with restricted communication and computation capabilities, which make harder to achieve dependability. In this work we explore this research line through the study of TrustedPals, a smartcard-based framework that allows implementing security policies in ubiquitous systems and applications in a decentralized way. The current architecture of TrustedPals uses a consensus algorithm adapted to the omission failure model. In this work, we propose to alternatively use the Paxos algorithm, in order to address more ubiquitous environments.
- 9 June 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Latin America Transactions
- Vol. 12 (3) , 442-448
Boosting Dependable Ubiquitous Computing: A Case Study
Ubiquitous computing has inherent features, e.g., a number of elements in the system with restricted communication and computation capabilities, which make harder to achieve dependability. In this work we explore this research line through the study of TrustedPals, a smartcard-based framework that allows implementing security policies in ubiquitous systems and applications in a decentralized way. The current architecture of TrustedPals uses a consensus algorithm adapted to the omission failure model. In this work, we propose to alternatively use the Paxos algorithm, in order to address more ubiquitous environments.
- 23 January 2013
- Published by Taylor & Francis in International Journal of Parallel, Emergent and Distributed Systems
- Vol. 28 (6) , 537-555
Implementing the weakest failure detector for solving the consensus problem
The concept of unreliable failure detector was introduced by Chandra and Toueg as a mechanism that provides information about process failures. This mechanism has been used to solve several agreement problems, such as the consensus problem. In this paper, algorithms that implement failure detectors in partially synchronous systems are presented. First two simple algorithms of the weakest class to solve the consensus problem, namely the Eventually Strong class (⋄S), are presented. While the first algorithm is wait-free, the second algorithm is f-resilient, where f is a known upper bound on the number of faulty processes. Both algorithms guarantee that, eventually, all the correct processes agree permanently on a common correct process, i.e. they also implement a failure detector of the class Omega (Ω). They are also shown to be optimal in terms of the number of communication links used forever. Additionally, a wait-free algorithm that implements a failure detector of the Eventually Perfect class (⋄P) is presented. This algorithm is shown to be optimal in terms of the number of bidirectional links used forever.
- 23 January 2013
- Published by Taylor & Francis in International Journal of Parallel, Emergent and Distributed Systems
- Vol. 28 (6) , 537-555
Implementing the weakest failure detector for solving the consensus problem
The concept of unreliable failure detector was introduced by Chandra and Toueg as a mechanism that provides information about process failures. This mechanism has been used to solve several agreement problems, such as the consensus problem. In this paper, algorithms that implement failure detectors in partially synchronous systems are presented. First two simple algorithms of the weakest class to solve the consensus problem, namely the Eventually Strong class (⋄S), are presented. While the first algorithm is wait-free, the second algorithm is f-resilient, where f is a known upper bound on the number of faulty processes. Both algorithms guarantee that, eventually, all the correct processes agree permanently on a common correct process, i.e. they also implement a failure detector of the class Omega (Ω). They are also shown to be optimal in terms of the number of communication links used forever. Additionally, a wait-free algorithm that implements a failure detector of the Eventually Perfect class (⋄P) is presented. This algorithm is shown to be optimal in terms of the number of bidirectional links used forever.
- 21 February 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 9 (4) , 610-625
Secure Failure Detection and Consensus in TrustedPals
We present a modular redesign of TrustedPals, a smart card-based security framework for solving Secure Multiparty Computation (SMC). Originally, TrustedPals assumed a synchronous network setting and allowed to reduce SMC to the problem of fault-tolerant consensus among smart cards. We explore how to make TrustedPals applicable in environments with less synchrony and show how it can be used to solve asynchronous SMC. Within the redesign we investigate the problem of solving consensus in a general omission failure model augmented with failure detectors. To this end, we give novel definitions of both consensus and the class oP of failure detectors in the omission model, which we call ◇P(om), and show how to implement ◇P(om) and have consensus in such a system with very weak synchrony assumptions. The integration of failure detection and consensus into the TrustedPals framework uses tools from privacy enhancing techniques such as message padding and dummy traffic.
- 21 February 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 9 (4) , 610-625
Secure Failure Detection and Consensus in TrustedPals
We present a modular redesign of TrustedPals, a smart card-based security framework for solving Secure Multiparty Computation (SMC). Originally, TrustedPals assumed a synchronous network setting and allowed to reduce SMC to the problem of fault-tolerant consensus among smart cards. We explore how to make TrustedPals applicable in environments with less synchrony and show how it can be used to solve asynchronous SMC. Within the redesign we investigate the problem of solving consensus in a general omission failure model augmented with failure detectors. To this end, we give novel definitions of both consensus and the class oP of failure detectors in the omission model, which we call ◇P(om), and show how to implement ◇P(om) and have consensus in such a system with very weak synchrony assumptions. The integration of failure detection and consensus into the TrustedPals framework uses tools from privacy enhancing techniques such as message padding and dummy traffic.
- 1 December 2011
- Published by Elsevier in Journal of Systems and Software
- Vol. 84 (12) , 2186-2195
Communication-efficient leader election in crash–recovery systems
- 1 December 2011
- Published by Elsevier in Journal of Systems and Software
- Vol. 84 (12) , 2186-2195
Communication-efficient leader election in crash–recovery systems
- 1 February 2011
- Published by Elsevier in Information Processing Letters
- Vol. 111 (6) , 262-268
Communication-efficient failure detection and consensus in omission environments
- 1 February 2011
- Published by Elsevier in Information Processing Letters
- Vol. 111 (6) , 262-268
Communication-efficient failure detection and consensus in omission environments
- Open Access
- 24 November 2010
- Published by Elsevier in Information Processing Letters
- Vol. 111 (4) , 194-199
Communication-efficient and crash-quiescent Omega with unknown membership
- 24 November 2010
- Published by Elsevier in Information Processing Letters
- Vol. 111 (4) , 194-199
Open AccessCommunication-efficient and crash-quiescent Omega with unknown membership
- Open Access
Algorithms For Extracting Timeliness Graphs
We consider asynchronous message-passing systems in which some links are timely and processes may crash. Each run defines a timeliness graph among correct processes: (p; q) is an edge of the timeliness graph if the link from p to q is timely (that is, there is bound on communication delays from p to q). The main goal of this paper is to approximate this timeliness graph by graphs having some properties (such as being trees, rings, ...). Given a family S of graphs, for runs such that the timeliness graph contains at least one graph in S then using an extraction algorithm, each correct process has to converge to the same graph in S that is, in a precise sense, an approximation of the timeliness graph of the run. For example, if the timeliness graph contains a ring, then using an extraction algorithm, all correct processes eventually converge to the same ring and in this ring all nodes will be correct processes and all links will be timely. We first present a general extraction algorithm and then a more specific extraction algorithm that is communication efficient (i.e., eventually all the messages of the extraction algorithm use only links of the extracted graph).
Open AccessAlgorithms For Extracting Timeliness Graphs
We consider asynchronous message-passing systems in which some links are timely and processes may crash. Each run defines a timeliness graph among correct processes: (p; q) is an edge of the timeliness graph if the link from p to q is timely (that is, there is bound on communication delays from p to q). The main goal of this paper is to approximate this timeliness graph by graphs having some properties (such as being trees, rings, ...). Given a family S of graphs, for runs such that the timeliness graph contains at least one graph in S then using an extraction algorithm, each correct process has to converge to the same graph in S that is, in a precise sense, an approximation of the timeliness graph of the run. For example, if the timeliness graph contains a ring, then using an extraction algorithm, all correct processes eventually converge to the same ring and in this ring all nodes will be correct processes and all links will be timely. We first present a general extraction algorithm and then a more specific extraction algorithm that is communication efficient (i.e., eventually all the messages of the extraction algorithm use only links of the extracted graph).
- 1 May 2009
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 75 (3) , 178-189
Implementing the Omega failure detector in the crash-recovery failure model
- 1 May 2009
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 75 (3) , 178-189
Implementing the Omega failure detector in the crash-recovery failure model