DocumentCode :
1806838
Title :
Simulatable security and polynomially bounded concurrent composability
Author :
Hofheinz, Dennis ; Unruh, Dominique
Author_Institution :
Centrum voor Wiskunde en Informatica, Amsterdam
fYear :
2006
fDate :
21-24 May 2006
Lastpage :
183
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
Keywords :
cryptography; black-box simulatability; computational subflavours; cryptographic multiparty computation; cryptographic tool; multiparty protocols; perfect subflavours; polynomially bounded concurrent composability; reactive Simulatability; secure protocols; simulatable security; standard simulatability; statistical subflavours; time-lock puzzles; universal simulatability; Analytical models; Computational modeling; Concurrent computing; Cryptographic protocols; Cryptography; Information analysis; Information security; Polynomials; Power system security; Privacy; Reactive Simulatability; Universal Composability; concurrent composition.;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Security and Privacy, 2006 IEEE Symposium on
Conference_Location :
Berkeley/Oakland, CA
ISSN :
1081-6011
Print_ISBN :
0-7695-2574-1
Type :
conf
DOI :
10.1109/SP.2006.36
Filename :
1624010
Link To Document :
بازگشت