Abstract
We present a name-passing calculus that can be regarded as a simplified π-calculus equipped with a cryptographic table. The latter is a data structure representing the relationships among names. We illus- trate how the calculus may be used for modelling cryptographic protocols relying on symmetric shared keys and verifying secrecy and authenticity properties. Following classical approaches [3], we formulate the verifica- tion task as a reachability problem and prove its decidability assuming finite principals and bounds on the sorts of the messages synthesized by the attacker.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
M. Abadi and A. Gordon. A calculus for cryptographic protocols: the spi calculus. In Proc. ACM Computer and Comm. Security, 1997.
M. Abadi and A. Gordon. A bisimulation method for cryptographic protocols. In Proc. ESOP 98, Springer Lect. Notes in Comp. Sci. 1382, 1998.
D. Dolev and A. Yao. On the security of public key protocols. IEEE Trans. on Information Theory, 29(2):198–208, 1983.
A. Huima. Efficient infinite-state analysis of security protocols. In Proc. Formal methods and security protocols, FLOC Workshop, Trento, 1999.
G. Lowe. Breaking and fixing the Needham-Schroeder public-key protocol using FDR. In Proc. TACAS, Springer Lect. Notes in Comp. Sci. 1996, 1996.
L. Paulson. Proving properties of security protocols by induction. In Proc. IEEE Computer Security Foundations Workshop, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Amadio, R.M., Prasad, S. (1999). The Game of the Name in Cryptographic Tables. In: Thiagarajan, P.S., Yap, R. (eds) Advances in Computing Science — ASIAN’99. ASIAN 1999. Lecture Notes in Computer Science, vol 1742. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46674-6_3
Download citation
DOI: https://doi.org/10.1007/3-540-46674-6_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66856-5
Online ISBN: 978-3-540-46674-1
eBook Packages: Springer Book Archive