.png){kind=icon}
.png){kind=icon}
Return
Secure Failure Detection and Consensus in TrustedPals
.png){kind=icon}
PRE
AI
DOI：10.1109/TDSC.2012.23.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 lozenge P of failure detectors in the omission model, which we call lozenge P(om), and show how to implement lozenge 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:
Failure detection
fault-tolerance
smart cards
consensus
secure multiparty computation
message padding
dummy traffic
general omission model
security performance
reliability
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.5
Papers:
2.4K
Citations:
9.6K
Organization
View more organizations