Paper Info
Title
TrustedPals: secure multiparty computation implemented with smart cards
Abstract
We study the problem of Secure Multi-party Computation (SMC) in a model where individual processes contain a tamper-proof security module, and introduce the TrustedPals framework, an efficient smart card based implementation of SMC for any number of participating entities in such a model. Security modules can be trusted by other processes and can establish secure channels between each other. However, their availability is restricted by their host, that is, a corrupted party can stop the computation of its own security module as well as drop any message sent by or to its security module. We show that in this model SMC can be implemented by reducing it to a fault-tolerance problem at the level of security modules. Since the critical part of the computation can be executed locally on the smart card, we can compute any function securely with a protocol complexity which is polynomial only in the number of processes (that is, the complexity does not depend on the function which is computed), in contrast to previous approaches.
Year
DOI
Venue
2006
10.1007/11863908_3
ESORICS
Keywords
Field
DocType
protocol complexity,tamper-proof security module,own security module,model smc,secure multiparty computation,secure multi-party computation,fault-tolerance problem,smart card,security module,efficient smart card,trustedpals framework,it security,fault tolerant,secure multi party computation
Trusted third party,Secure multi-party computation,Computer science,Computer security,Smart card,Communication channel,Fault tolerance,Secure two-party computation,Computer security model,Computation,Distributed computing
Conference
Volume
ISSN
ISBN
4189
0302-9743
3-540-44601-X
Citations 
PageRank 
References 
21
0.85
16
Authors
5
Name
Order
Citations
PageRank
Milan Fort1210.85
Felix Freiling243735.37
Lucia Draque Penso319620.46
Zinaida Benenson423524.76
Dogan Kesdogan535542.53