| Bryce, C., Oriol, M., and Vitek, J. 1999. \A Coordination Model for Agents Based on Secure Spaces", In Coordination Languages and Models: Coordination 99, Amsterdam, April. |
....address both the privacy of hosts and of mobile agents. We did not deal with key distribution explicitly that can be seen as an orthogonal problem. Digital signatures can be smoothly integrated in our framework and the pattern matching extended accordingly. The work that is closer to ours is [4], which introduces the Secure Object Space (SecOS) model. This model is intended to extend Linda with ne grained access control semantics. In SecOS all tuple elds are locked with a key, and each eld must be locked with a di erent key. The basic idea is that a process, upon retrieving a tuple, ....
C. Bryce, M. Oriol, and J. Vitek. A Coordination Model for Agents Based on Secure Spaces. In P. Ciancarini and A. Wolf, editors, Proc. 3rd Int. Conf. on Coordination Models and Languages, number 1594 in LNCS, pages 4-20. Springer-Verlag, 1999.
....the set of languages selected for this study. Language Ref Language Ref Language Ref BAUHAUS [tt] BONITA [25] JAvASPACES [28] EXT. JOYCE LINDA [22] LAw GOVERNED LINDA [20] LIME [21] LINDA [t0] MARS [9] OBJECTIVE LINDA [17] OPENSPACES [13] PARADISE [26] PLINDA [5] RESPECT [12] SCOPES [19] SEcOS [6] SONIA [2] TSPACES [30] WCL [23] Table 1. Languages studied The goal of our work is an implemented object oriented framework in which coordination languages from the Linda family can be expressed and implemented. Such a testbed is rooted in a set of basic concepts common to the languages. The ....
....with it. The security policy is based on roles which leads to a better uncoupling between the agent system and MARS ( 9] The administrator of a site defines roles like reader, writer or manager and maps agent identifies to them. Tuples can also be protected by using cryptography. The SEcOS ([6]) is a LINDA based coordination language that provides secure access to tuple spaces via explicit cryptographic techniques. Agents can retrieve encrypted entries but have to use the corresponding key to reveal the data of the entry. The serious limitation of the model is that any agent can in a ....
C. Bryce, M. Oriol, and J. Vitek. A Coordination Model for Agents Based on Secure Spaces. Lecture Notes in Computer Science, 1594:z120, 1999.
....media. Most commonly, people use Tuple Space Systems (based on Linda[5] for designing open mobile agent systems. While the openness of middleware like Linda like systems is evidently an advantage, it also has a disadvantage of being too open. Not only in terms of security (as addressed in [2]) but also in terms of other non functional concerns, such as performance and robustness. A typical linda like system will not include primitives to take care of these concerns. We aim to handle these without touching the openness of the middleware. Linda like systems (tuple spaces) can have ....
Ciaran Bryce, Manuel Oriol, and Jan Vitek. A Coordination Model for Agents Based on Secure Spaces. In P. Ciancarini and A. Wolf, editors, Proc. 3rd Int. Conf. on Coordination Models and Languages, volume 1594, pages 4-20, Amsterdam, Netherland, 1999. Springer-Verlag, Berlin.
....address both the privacy of hosts and of mobile agents. We did not deal with key distribution explicitly that can be seen as an orthogonal problem. Digital signatures can be smoothly integrated in our framework and the pattern matching extended accordingly. The work that is closer to ours is [7], which introduces the Secure Object Space (SEcOS) model. This model is intended to extend Linda with fine grained access control semantics. In SEcOS all tuple fields are locked with a key, and each field must be locked with a different key. The basic idea is that a process, upon retrieving a ....
C. Bryce, M. Oriol, and J. Vitek. A Coordination Model for Agents Based on Secure Spaces. In P. Ciancarini and A. Wolf, editors, Proc. 3rd Int. Conf. on Coordination Models and Languages, number 1594 in LNCS, pages 4-20. Springer-Verlag, 1999.
.... channel becomes, in effect, multiple named channels, or rather a pool which uses type information to match messages with read requests (a similar but more detailed observation on polymorphism and ambients appears in [1] and starts to look rather similar to the ideas outlined in SecureSpaces [4]. In spirit however, it is much closer to a classical AI component: the blackboard. Thus, our solution to communication takes that principle and implements a simple blackboard at scene ambient level, through which the sub ambients communicate using get and put operations. Thus, in order to send a ....
C. Bryce, M. Oriol, and J. Vitek. A Coordination Model for Agents Based on Secure Spaces. In P. Ciancarini and A. Wolf, editors, Proc. 3rd Int. Conf. on Coordination Models and Languages, volume 1594 of Lecture Notes in Computer Science, pages 4--20, Amsterdam, Netherlands, April
....an access is allowed or not. This method can be used to prevent many inadvertent errors by buggy code. However, it does not provide e#ective means for protection against potentially malicious agents, since it is not possible to rely on typing if the requests come from untrusted sites. The SecOS [3] system attempts to provide secure access to tuplespaces via explicit cryptographic techniques. Under this system, entries in a tuplespace are encrypted, and can be decrypted only by agents holding the correct key. This scheme has several serious limitations. First, it does not protect a tuple ....
C. Bryce, M. Oriol, and J. Vitek. A coordination model for agents based on secure spaces. In P. Cinacrini and A. L. Wolf, editors, Proc. of Coordination'99: Third International Conference on Coordination Models and Languages; LNCS 1594, pages 4--20, April 1999.
....are placed remote (across a WAN) b) Agents x1, xn and tuple space ts share the same controller C. 100 150 200 250 300 350 400 1 2 3 4 5 6 7 8 9 10 throughput n: number of clients assigned to a controller Figure 6: The performance of a controller under a heavy load The SecOS [2] system attempts to provide secure access to tuple spaces via explicit cryptographic techniques. Under this system, entries in a tuple space are encrypted, and can be decrypted only by agents holding the correct key. This scheme has several serious limitations. First, it does not protect a tuple ....
C. Bryce, M. Oriol, and J. Vitek. A coordination model for agents based on secure spaces. In P. Cinacrini and A. L. Wolf, editors, Proc. of Coordination'99: Third International Conference on Coordination Models and Languages; LNCS 1594, pages 4--20, April 1999.
No context found.
C. Bryce, M. Oriol, and J. Vitek. A coordination model for agents based on secure spaces. In P. Ciancarini and A. Wolf, editors, Proceedings of the 3rd Conference on Coordination Languages and Models, volume 1594 of LNCS, pages 4--20. sv, 1999.
....given seal. Programming with channels and portals is sometimes cumbersome. Other communication utilities can be designed to run over the channel mechanism. One example is a shared object space that offers the possibility for associative, asynchronous and anonymous communication between objects [7]. This proposition includes access control mechanisms to protect the contents of entries in the shared space. 3.3 State Capture The state capture mechanism of JavaSeal creates a machine independent portable representation of a seal. The procedure recursively traverses the seal hierarchy rooted ....
C. Bryce, M. Oriol, and J. Vitek. A coordination model for agents based on secure spaces. In P. Ciancarini and A. Wolf, editors, Proceedings of the 3rd Conference on Coordination Languages and Models, volume 1594 of LNCS, pages 4--20. sv, 1999.
No context found.
Bryce, C., Oriol, M., and Vitek, J. 1999. \A Coordination Model for Agents Based on Secure Spaces", In Coordination Languages and Models: Coordination 99, Amsterdam, April.
No context found.
Ciar an Bryce, Manuel Oriol, and Jan Vitek. A coordination model for agents based on secure spaces. In Paolo Ciancarini and Alexander L. Wolf, editors, Coordination Languages and 100 Models, volume 1594 of Lecture Notes in Computer Science, Proceedings of Coordination '99, pages 4--20, 1999.
No context found.
Bryce, C., Oriol, M., and Vitek, J. 1999. \A Coordination Model for Agents Based on Secure Spaces", In Coordination Languages and Models: Coordination 99, Amsterdam, April.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC