Abstract
Due to technological advances such as the Internet and mobile computing, Security has become a serious challenge involving several disciplines of Computer Science. In recent years, there has been a growing interest in the analysis of security protocols and one promising approach is the development of formalisms that model communicating processes, in particular Process Calculi. The results are so far encouraging although most remains to be done.
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
References
Amadio, R., Lugiez, D., Vanackere, V.: On the symbolic reduction of processes with cryptographic functions. TCS: Theoretical Computer Science 290 (2003)
Boreale, M., Buscemi, M.G.: A Framework for the Analysis of Security Protocols. In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, p. 483. Springer, Heidelberg (2002)
Crazzolara, F., Winskel, G.: Events in security protocols. In: Samarati, P. (ed.) Proceedings of the 8th ACM Conference on Computer and Communications Security, Philadelphia, PA, USA, pp. 96–105. ACM Press, New York (2001)
Fiore, M., Abadi, M.: Computing symbolic models for verifying cryptographic protocols. In: 14th IEEE Computer Security Foundations Workshop, pp. 160–173. IEEE Computer Society Press, Los Alamitos (2001)
Nielsen, M., Palamidessi, C., Valencia, F.: Temporal concurrent constraint programming: Denotation, logic and applications. Nordic Journal of Computing 9(2), 145–188 (2002)
Pitts, A.M.: Nominal Logic: A First Order Theory of Names and Binding. In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol. 2215, p. 219. Springer, Heidelberg (2001)
Palamidessi, C., Saraswat, V., Victor, B., Valencia, F.: On the expressiveness of recursion vs replication in the asynchronous pi-calculus. In: LICS 2006 (to appear, 2006)
Rossi, F., Montanari, U.: Concurrent semantics for concurrent constraint programming. In: Constraint Programming: Proc. 1993 NATO ASI, pp. 181–220 (1994)
Saraswat, V.: Concurrent Constraint Programming. The MIT Press, Cambridge (1993)
Smolka, G.: The Oz programming model. In: van Leeuwen, J. (ed.) Computer Science Today. LNCS, vol. 1000, pp. 324–343. Springer, Heidelberg (1995)
Saraswat, V., Rinard, M., Panangaden, P.: The semantic foundations of concurrent constraint programming. In: POPL 1991, pp. 333–352 (1991)
Valencia, F.: Decidability of infinite-state timed CCP processes and first-order LTL. Theor. Comput. Sci. 330(3), 577–607 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
López, H.A., Palamidessi, C., Pérez, J.A., Rueda, C., Valencia, F.D. (2006). A Declarative Framework for Security: Secure Concurrent Constraint Programming. In: Etalle, S., Truszczyński, M. (eds) Logic Programming. ICLP 2006. Lecture Notes in Computer Science, vol 4079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11799573_43
Download citation
DOI: https://doi.org/10.1007/11799573_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36635-5
Online ISBN: 978-3-540-36636-2
eBook Packages: Computer ScienceComputer Science (R0)