The paper presents first how we can compute sheaf tools for accomplishing our goal, i.e., an authentication method by sheaves. The authors use the most general notion of a sheaf, as a functor on a site, which is a category equipped with a Grothendieck topology. Moreover, they have introduced a notion in sheaf theory, family for matching, in order to simplify the sheaf definition in a computation class of sites called well structured sites. This has given them the possibility to construct an optimal validation algorithm of sheaves. Also, they present an algorithm to generate sheaves. By handling the concepts of Goguen, the behaviour of a system is computed in the internal language of a (pre)sheaf topos. Non-interference by Goguen is also computed in the internal language of a presheaf topos by using predicates.
Consequently, this paper provides computation tools for authentication and for non-interference control. In particular, the authors see that all computation tools are building from the base category that is provided by the architecture of distributed computing systems. It remains for them to try these out. Only, a software built in accordance with the ideas of this paper can provide real examples. The authors plan to implement this in the future.