TY - GEN
T1 - Composable formal security analysis
T2 - 35th International Colloquium on Automata, Languages and Programming, ICALP 2008
AU - Canetti, Ran
PY - 2008
Y1 - 2008
N2 - A security property of a protocol is composable if it remains intact even when the protocol runs alongside other protocols in the same system. We describe a method for asserting composable security properties, and demonstrate its usefulness. In particular, we show how this method can be used to provide security analysis that is formal, relatively simple, and still does not make unjustified abstractions of the underlying cryptographic algorithms in use. It can also greatly enhance the feasibility of automated security analysis of systems of realistic size.
AB - A security property of a protocol is composable if it remains intact even when the protocol runs alongside other protocols in the same system. We describe a method for asserting composable security properties, and demonstrate its usefulness. In particular, we show how this method can be used to provide security analysis that is formal, relatively simple, and still does not make unjustified abstractions of the underlying cryptographic algorithms in use. It can also greatly enhance the feasibility of automated security analysis of systems of realistic size.
UR - http://www.scopus.com/inward/record.url?scp=49049110708&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-70583-3_1
DO - 10.1007/978-3-540-70583-3_1
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:49049110708
SN - 3540705821
SN - 9783540705826
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 1
EP - 13
BT - Automata, Languages and Programming - 35th International Colloquium, ICALP 2008, Proceedings
Y2 - 7 July 2008 through 11 July 2008
ER -