期刊
2014 IEEE 27TH COMPUTER SECURITY FOUNDATIONS SYMPOSIUM (CSF)
卷 -, 期 -, 页码 184-198出版社
IEEE COMPUTER SOC
DOI: 10.1109/CSF.2014.21
关键词
-
Secure multi-party computation systems are commonly built from a small set of primitive components. The composability of security notions has a central role in the analysis of such systems, as it allows us to deduce security properties of complex protocols from the properties of its components. We show that the standard notions of universally composable security are overly restrictive in this context and can lead to protocols with sub-optimal performance. As a remedy, we introduce a weaker notion of privacy that is satisfied by simpler protocols and is preserved by composition. After that we fix a passive security model and show how to convert a private protocol into a universally composable protocol. As a result, we obtain modular security proofs without performance penalties.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据