The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
A multi-agent system is called anonymous if an adversary who can observe all the occurrences of events from the system cannot determine who is the "actor agent" of the events. Many agent systems such as e-voting or e-cash systems should guarantee the anonymity property because in such systems agents deal with privacy information. Also, the notion of anonymity can be found in a party game...
Trace anonymity is an extension of the formulation of anonymity by Schneider and Sidiropoulos. To prove the trace anonymity of infinite-state or unbounded systems, we have introduced proof techniques in which we find a binary relation called an anonymous simulation. There are two sorts of anonymous simulation methods — a forward-style method and a backward-style method. In our previous work, we discussed...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.