Abstract
We introduce a class of tree automata that perform tests on a memory that is updated using function symbol application and projection. The language emptiness problem for this class of tree automata is shown to be in DEXPTIME. We also introduce a class of set constraints with equality tests and prove its decidability by completion techniques and a reduction to tree automata with one memory. Set constraints with equality tests may be used to decide secrecy for a class of cryptographic protocols that properly contains a class of memoryless “ping-pong protocols” introduced by Dolev and Yao.
Partially supported by DoD MURI “Semantic Consistency in Information Exchange,” ONR Grant N00014-97-1-0505, and NSF CCR-9629754.
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. Information and Computation, 148(1), 1999.
A. Aiken. Introduction to set constraint-based program analysis. Science of Computer Programming, 35:79–111, 1999.
R. Amadio and D. Lugiez. On the reachability problem in cryptographic protocols. In Proc. CONCUR’00, volume 1877 of Lecture Notes in Computer Science, 2000.
B. Bogaert and S. Tison. Equality and disequality constraints on brother terms in tree automata. In A. Finkel, editor, Proc. 9th. Symposium on Theoretical Aspects of Comp. Science, Cachan, France, 1992.
I. Cervesato, N. Durgin, P. Lincoln, J. Mitchell, and A. Scedrov. A meta-notation for protocol analysis. In P. Syverson, editor, 12-th IEEE Computer Security Foundations Workshop. IEEE Computer Society Press, 1999.
W. Charatonik and L. Pacholski. Negative set constraints with equality. In Proc. IEEE Symp. on Logic in Computer Science, pages 128–136, Paris, 1994.
W. Charatonik and A. Podelski. Set constraints with intersection. In Proc. IEEE Symposium on Logic in Computer Science, Varsaw, 1997.
J. Clarke and J. Jacobs. A survey of authentication protocol. literature: Version 1.0. Draft paper, 1997.
H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available on: http://www.grappa.univ-lille3.fr/tata, 1997.
D. Dolev, S. Even, and R. Karp. On the security of ping pong protocols. Information and Control, 55:57–68, 1982.
D. Dolev and A. Yao. On the security of public key protocols. In Proc. IEEE Symp. on Foundations of Computer Science, pages 350–357, 1981.
N. Durgin, P. Lincoln, J. Mitchell, and A. Scedrov. Undecidability of bounded security protocols. In Proc. Workshop on formal methods in security protocols, Trento, Italy, 1999.
S. Even and O. Goldreich. On the security of multi-party ping-pong protocols. Technical Report 285, Technion, Haifa, Israel, 1983. Extended abstract appeared in IEEE Symp. Foundations of Computer Science, 1983.
N. Heintze and J. Tygar. A model for secure protocols and their compositions. IEEE transactions on software engineering, 22(1), 1996.
N. Heinze and J. Jaffar. A decision procedure for a class of set constraints. In Proc. IEEE Symp. on Logic in Computer Science, Philadelphia, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Comon, H., Cortier, V., Mitchell, J. (2001). Tree Automata with One Memory, Set Constraints, and Ping-Pong Protocols. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds) Automata, Languages and Programming. ICALP 2001. Lecture Notes in Computer Science, vol 2076. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48224-5_56
Download citation
DOI: https://doi.org/10.1007/3-540-48224-5_56
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42287-7
Online ISBN: 978-3-540-48224-6
eBook Packages: Springer Book Archive