The Community for Technology Leaders
2006 IEEE Symposium on Security and Privacy (S&P'06) (2006)
Berkeley/Oakland, CA
May 21, 2006 to May 24, 2006
ISSN: 1081-6011
ISBN: 0-7695-2574-1
pp: 14 pp.-183
D. Hofheinz , Centrum voor Wiskunde en Informatica, Amsterdam, Netherlands
ABSTRACT
Simulatable security is a security notion for multi-party protocols that implies strong composability features. The main definitional flavours of simulatable security are standard simulatability, universal simulatability, and black-box simulatability. All three come in "computational," "statistical" and "perfect" subflavours indicating the considered adversarial power. Universal and black-box simulatability, in all of their subflavours, are already known to guarantee that the concurrent composition even of a polynomial number of secure protocols stays secure. We show that computational standard simulatability does not allow for secure concurrent composition of polynomially many protocols, but we also show that statistical standard simulatability does. The first result assumes the existence of an interesting cryptographic tool (namely time-lock puzzles), and its proof employs a cryptographic multi-party computation in an interesting and unconventional way
INDEX TERMS
Polynomials, Cryptographic protocols, Computational modeling, Information security, Cryptography, Power system security, Analytical models, Concurrent computing, Information analysis, Privacy
CITATION

D. Hofheinz and D. Unruh, "Simulatable security and polynomially bounded concurrent composability," 2006 IEEE Symposium on Security and Privacy (S&P'06)(SECPRI), Berkeley/Oakland, CA, 2009, pp. 14 pp.-183.
doi:10.1109/SP.2006.36
81 ms
(Ver 3.3 (11022016))