The Community for Technology Leaders
2014 IEEE 27th Computer Security Foundations Symposium (CSF) (2014)
Vienna, Austria
July 19, 2014 to July 22, 2014
ISSN: 1063-6900
ISBN: 978-1-4799-4290-9
pp: 184-198
ABSTRACT
Secure multi-party computation systems are commonly built from a small set of primitive components. The compos ability 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 compos able 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 compos able protocol. As a result, we obtain modular security proofs without performance penalties.
INDEX TERMS
Protocols, Ports (Computers), Privacy, Clocks, Cryptography, Computational modeling
CITATION

D. Bogdanov, P. Laud, S. Laur and P. Pullonen, "From Input Private to Universally Composable Secure Multi-party Computation Primitives," 2014 IEEE 27th Computer Security Foundations Symposium (CSF), Vienna, Austria, 2014, pp. 184-198.
doi:10.1109/CSF.2014.21
221 ms
(Ver 3.3 (11022016))