Securely accessing shared resources with concurrent constraint programming

Authors:
Stefano Bistarelli;Francesco Santini
Affiliations:
Dipartimento di Matematica e Informatica, Università di Perugia, Italy, Istituto di Informatica e Telematica, IIT-CNR, Pisa, Italy;Dipartimento di Matematica e Informatica, Università di Perugia, Italy, Centrum Wiskunde & Informatica, Amsterdam, Netherlands
Venue:
SEFM'12 Proceedings of the 10th international conference on Software Engineering and Formal Methods
Year:
2012

Citing 19
Cited 0

Concurrent constraint programming

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Semiring-based constraint satisfaction and optimization

Journal of the ACM (JACM)
Programming with POSIX threads

Programming with POSIX threads
Coordinating processes with secure spaces

Science of Computer Programming - Special issue on coordination languages and architectures
A Java Middleware for Guaranteeing Privacy of Distributed Tuple Spaces

FIDJI '01 Revised Papers from the International Workshop on Scientific Engineering for Distributed Java Applications
Constraint Handling Rules

Selected Papers from Constraint Programming: Basics and Trends
Access control in collaborative systems

ACM Computing Surveys (CSUR)
On the expressive power of KLAIM-based calculi

Theoretical Computer Science - Expressiveness in concurrency
Soft concurrent constraint programming

ACM Transactions on Computational Logic (TOCL)
Coordination with multicapabilities

Science of Computer Programming
Agent coordination contexts for the formal specification and enactment of coordination and security policies

Science of Computer Programming - Special issue on security issues in coordination models, languages, and systems
Least Privilege and More

IEEE Security and Privacy
Principles of Information Security

Principles of Information Security
Enhancing constraints manipulation in semiring-based formalisms

Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Resource access and mobility control with dynamic privileges acquisition

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A declarative framework for security: secure concurrent constraint programming

ICLP'06 Proceedings of the 22nd international conference on Logic Programming
A secure coordination of agents with nonmonotonic soft Concurrent Constraint Programming

Proceedings of the 27th Annual ACM Symposium on Applied Computing
A Nonmonotonic Soft Concurrent Constraint Language to Model the Negotiation Process

Fundamenta Informaticae
Supporting Secure Coordination in SecSpaces

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

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.