Generative communication in Linda
ACM Transactions on Programming Languages and Systems (TOPLAS)
KLAIM: A Kernel Language for Agents Interaction and Mobility
IEEE Transactions on Software Engineering
A calculus for cryptographic protocols
Information and Computation
The Java Language Specification
The Java Language Specification
Coordination for Internet Application Development
Autonomous Agents and Multi-Agent Systems
Coordinating processes with secure spaces
Science of Computer Programming - Special issue on coordination languages and architectures
A comparison of three authentication properties
Theoretical Computer Science - Special issue: Algebraic methodology and software technology
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
Coordinating Mobile Agents via Blackboards and Access Rights
COORDINATION '97 Proceedings of the Second International Conference on Coordination Languages and Models
LIME: A Middleware for Physical and Logical Mobility
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Coordination and mobility in CoreLime
Mathematical Structures in Computer Science
IBM Systems Journal
Providing data confidentiality against malicious hosts in Shared Data Spaces
Science of Computer Programming
COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
Combining static analysis and runtime checking in security aspects for distributed tuple spaces
COORDINATION'11 Proceedings of the 13th international conference on Coordination models and languages
A secure coordination of agents with nonmonotonic soft Concurrent Constraint Programming
Proceedings of the 27th Annual ACM Symposium on Applied Computing
A coordination-based access control model for space-based computing
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Hi-index | 0.00 |
In this paper we investigate security problems which occur when exploiting a Linda-like data driven coordination model in an open environment. In this scenario, there is no guarantee that all the agents accessing the shared tuple space are trusted. Starting from a formalization of some typical security properties in the standard Linda coordination model, we present a novel data-driven coordination model which provides mechanisms to support the considered security properties. The first of these mechanisms supports logical partitions of the shared repository: in this way we can restrict the access to tuples stored inside a partition, simply by limiting the access to the partition itself. The second mechanism consists of adding to the tuples some extra information which permits to authenticate the producer of a tuple or to identify its reader/consumer. Finally, we support the possibility to define access control policies based on the kind of operations an agent performs on a tuple, thus discriminating between (destructive) input and (non-destructive) read permissions on each single tuple.