Abstract
We present an analysis that determines when it is possible to multiplex a pair of cryptographic protocols. We present a transformation that improves the coverage of this analysis on common protocol formulations. We discuss the gap between the merely possible and the pragmatic through an optimization that informs a multiplexer. We also address the security ramifications of trusting external parties for this task and evaluate our work on a large repository of cryptographic protocols. We have verified this work using the Coq proof assistant.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Begel, A., McCanne, S., Graham, S.L.: BPF+: exploiting global data-flow optimization in a generalized packet filter architecture. In: Symposium on Communications, Architectures and Protocols (1999)
Bodei, C., Degano, P., Gao, H., Brodo, L.: Detecting and preventing type flaws: a control flow analysis with tags. Electronic Notes in Theoretical Computer Science 194(1), 3–22 (2007)
Cortier, V., Delaitre, J., Delaune, S.: Safely Composing Security Protocols. In: Conference on Foundations of Software Technology and Theoretical Computer Science (2007)
Doghmi, S.F., Guttman, J.D., Thayer, F.J.: Skeletons, homomorphisms, and shapes: Characterizing protocol executions. Electronic Notes in Theoretical Computer Science, vol. 173, pp. 85–102 (2007)
Dolev, D., Yao, A.: On the security of public-key protocols. IEEE Transactions on Information Theory 29, 198–208 (1983)
Fábrega, F.J.T., Herzog, J.C., Guttman, J.D.: Strand spaces: Why is a security protocol correct? In: IEEE Symposium on Security and Privacy (1998)
Guttman, J.D.: Authentication tests and disjoint encryption: a design method for security protocols. Journal of Computer Security 12(3/4), 409–433 (2004)
Guttman, J.D., Herzog, J.C., Ramsdell, J.D., Sniffen, B.T.: Programming cryptographic protocols. In: Trust in Global Computing (2005)
Guttman, J.D., Thayer, F.J.: Protocol independence through disjoint encryption. In: Computer Security Foundations Workshop (2000)
Guttman, J.D., Thayer, F.J.: Authentication tests and the structure of bundles. Theoretical Computer Science 283(2), 333–380 (2002)
Heather, J., Lowe, G., Schneider, S.: How to prevent type flaw attacks on security protocols. In: Computer Security Foundations Workshop (2000)
Hui, M.L., Lowe, G.: Fault-perserving simplifying transformations for security protocols. Journal of Computer Security 9(1-2), 3–46 (2001)
Lee, P., Leone, M.: Optimizing ML with run-time code generation. Programming Language Design and Implementation (1996)
McCarthy, J., Guttman, J.D., Ramsdell, J.D., Krishnamurthi, S.: Compiling cryptographic protocols for deployment on the Web. In: World Wide Web, pp. 687–696 (2007)
Meadows, C.: Identifying potential type confusion in authenticated messages. In: Computer Security Foundations Workshop (2002)
Project EVA. Security protocols open repository (2007), http://www.lsv.ens-cachan.fr/spore/
Song, D.X.: Athena: a new efficient automated checker for security protocol analysis. In: Computer Security Foundations Workshop (1999)
Thayer, F.J., Herzog, J.C., Guttman, J.D.: Strand spaces: Proving security protocols correct. Journal of Computer Security 7(2/3), 191–230 (1999)
The Coq development team. The Coq proof assistant reference manual, 8.1 edn. (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
McCarthy, J., Krishnamurthi, S. (2010). Trusted Multiplexing of Cryptographic Protocols. In: Degano, P., Guttman, J.D. (eds) Formal Aspects in Security and Trust. FAST 2009. Lecture Notes in Computer Science, vol 5983. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12459-4_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-12459-4_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12458-7
Online ISBN: 978-3-642-12459-4
eBook Packages: Computer ScienceComputer Science (R0)