Abstract
We present a fine-grained security model to enforce the access control on the shared constraint store in Concurrent Constraint Programming (CCP) languages. We show the model for a nonmonotonic version of Soft CCP (SCCP), that is an extension of CCP where the constraints have a preference level associated with them. Crisp constraints can be modeled in the same framework as well. In the considered nonmonotonic soft version (NmSCCP), it is also possible to remove constraints from the store. The language can be used for coordinating agents on a common store of information that represents the set of shared resources. In such scenarios, it is clearly important to enforce the integrity and confidentiality rights on the resources, in order, for instance, to hide part of the information to some agents, or to prevent an agent to consume too many resources.
Work carried out during the tenure of an ERCIM ”Alain Bensoussan” Fellowship Programme. This Programme is supported by the Marie Curie Co-funding of Regional, National and International Programmes (COFUND) of the European Commission.
Research partially supported by MIUR PRIN 20089M932N project: “Innovative and multi-disciplinary approaches for constraint and preference reasoning”, by CCOS FLOSS project “Software open source per la gestione dell’epigrafia dei corpus di lingue antiche”, and by INDAM GNCS project “Fairness, Equità e Linguaggi”.
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.
Similar content being viewed by others
References
Bettini, L., Nicola, R.D.: A Java Middleware for Guaranteeing Privacy of Distributed Tuple Spaces. In: Guelfi, N., Astesiano, E., Reggio, G. (eds.) FIDJI 2002. LNCS, vol. 2604, pp. 175–184. Springer, Heidelberg (2003)
Bistarelli, S., Campli, P., Santini, F.: A secure coordination of agents with nonmonotonic soft concurrent constraint programming. In: Proceedings of the 27th Annual ACM Symposium on Applied Computing, SAC 2012, pp. 1551–1553. ACM, New York (2012)
Bistarelli, S., Gadducci, F.: Enhancing constraints manipulation in semiring-based formalisms. In: ECAI 2006, 17th European Conference on Artificial Intelligenc. Frontiers in Artificial Intelligence and Applications, vol. 141, pp. 63–67. IOS Press (2006)
Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based constraint satisfaction and optimization. Journal of the ACM 44(2), 201–236 (1997)
Bistarelli, S., Montanari, U., Rossi, F.: Soft concurrent constraint programming. ACM Trans. Comput. Logic 7(3), 563–589 (2006)
Bistarelli, S., Santini, F.: A nonmonotonic soft concurrent constraint language to model the negotiation process. Fundam. Inform. 111(3), 257–279 (2011)
Butenhof, D.R.: Programming with POSIX threads. Addison-Wesley Longman Publishing Co., Inc., Boston (1997)
Frühwirth, T.W.: Constraint Handling Rules. In: Podelski, A. (ed.) Constraint Programming: Basics and Trends. LNCS, vol. 910, pp. 90–107. Springer, Heidelberg (1995)
Gorla, D., Pugliese, R.: Resource Access and Mobility Control with Dynamic Privileges Acquisition. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 119–132. Springer, Heidelberg (2003)
Gorrieri, R., Lucchi, R., Zavattaro, G.: Supporting secure coordination in SecSpaces. Fundam. Inform. 73(4), 479–506 (2006)
Handorean, R., Roman, G.C.: Secure sharing of tuple spaces in ad hoc settings. Electr. Notes Theor. Comput. Sci. 85(3) (2003)
López, H.A., Palamidessi, C., Pérez, J.A., Rueda, C., Valencia, F.D.: A Declarative Framework for Security: Secure Concurrent Constraint Programming. In: Etalle, S., Truszczyński, M. (eds.) ICLP 2006. LNCS, vol. 4079, pp. 449–450. Springer, Heidelberg (2006)
McCollum, C.D., Messing, J.R., Notargiacomo, L.: Beyond the pale of MAC and DAC-defining new forms of access control. In: IEEE Symposium on Security and Privacy, pp. 190–200 (1990)
Nicola, R.D., Gorla, D., Pugliese, R.: On the expressive power of KLAIM-based calculi. Theor. Comput. Sci. 356(3), 387–421 (2006)
Omicini, A., Ricci, A., Viroli, M.: Agent coordination contexts for the formal specification and enactment of coordination and security policies. Sci. Comput. Program. 63(1), 88–107 (2006)
Saraswat, V., Rinard, M.: Concurrent constraint programming. In: POPL 1990, pp. 232–245. ACM (1990)
Schneider, F.B.: Least privilege and more. IEEE Security & Privacy 1(5), 55–59 (2003)
Tolone, W., Ahn, G.J., Pai, T., Hong, S.P.: Access control in collaborative systems. ACM Comput. Surv. 37, 29–41 (2005)
Udzir, N.I., Wood, A.M., Jacob, J.L.: Coordination with multicapabilities. Sci. Comput. Program. 64(2), 205–222 (2007)
Vitek, J., Bryce, C., Oriol, M.: Coordinating processes with secure spaces. Sci. Comput. Program. 46(1-2), 163–193 (2003)
Whitman, M.E., Mattord, H.J.: Principles of Information Security, 3rd edn. Course Technology Press, Boston (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bistarelli, S., Santini, F. (2012). Securely Accessing Shared Resources with Concurrent Constraint Programming. In: Eleftherakis, G., Hinchey, M., Holcombe, M. (eds) Software Engineering and Formal Methods. SEFM 2012. Lecture Notes in Computer Science, vol 7504. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33826-7_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-33826-7_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33825-0
Online ISBN: 978-3-642-33826-7
eBook Packages: Computer ScienceComputer Science (R0)