Secure Failure Detection and Consensus in TrustedPals
- 21 February 2012
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 9 (4) , 610-625
Abstract
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.Keywords
This publication has 29 references indexed in Scilit:
- Message-efficient omission-tolerant consensus with limited synchrony2009
- Secure function evaluation with ordered binary decision diagrams2006
- TrustedPals: Secure Multiparty Computation Implemented with Smart Cards2006
- Gracefully Degrading Fair Exchange with Security Modules2005
- Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation2005
- Revisiting Failure Detection and Consensus in Omission Failure EnvironmentsLecture Notes in Computer Science, 2005
- Automatic generation of two-party computations2003
- Failure detectors in omission failure environments1997
- Asynchronous secure computations with optimal resilience (extended abstract)1994
- Asynchronous secure computation1993