A Coordination Model for Agents based on Secure Spaces | Zendy

C. Bryce | Zendy; Manuel Oriola | Zendy; Jan Vitck | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Coordination Model for Agents based on Secure Spaces

Author(s) -

C. Bryce,

Manuel Oriola,

Jan Vitck

Publication year - 1999

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-65836-X

DOI - 10.1007/3-540-48919-3_3

Subject(s) - computer science , key (lock) , structuring , java , tuple space , semantics (computer science) , distributed computing , object (grammar) , encryption , matching (statistics) , element (criminal law) , process (computing) , object oriented programming , programming language , theoretical computer science , computer security , artificial intelligence , statistics , tuple , mathematics , finance , discrete mathematics , political science , law , economics

Shared space coordination models such as Linda are ill-suited for structuring applications composed of erroneous or insecure components. This paper presents the Secure Object Space model. In this model, a data element can be locked with a key and is only visible to a process that presents a matching key to unlock the element. We give a precise semantics for Secure Object Space operations and discuss an implementation in JAVA for a mobile agent system. An implementation of the semantics that employs encryption is also outlined for use in untrusted environments.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research