A new trust chain model

Agbinya, JI; Umuhoza, D

A new trust chain model

Agbinya, JI Umuhoza, D

Permalink

Publication Type:: Conference Proceeding
Citation:: 24th IEEE International Conference on Advanced Information Networking and Applications Workshops, WAINA 2010, 2010, pp. 1077 - 1084
Issue Date:: 2010-07-26

Closed Access

	Filename	Description	Size
	2009006071OK.pdf		688.36 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Agbinya, JI	en_US
dc.contributor.author	Umuhoza, D	en_US
dc.date.issued	2010-07-26	en_US
dc.identifier.citation	24th IEEE International Conference on Advanced Information Networking and Applications Workshops, WAINA 2010, 2010, pp. 1077 - 1084	en_US
dc.identifier.isbn	9780769540191	en_US
dc.identifier.uri	http://hdl.handle.net/10453/16217
dc.description.abstract	Trust is generally based on the level and quality of interaction with the entity being trusted. In a web service or the Internet, trust is based on the level of successful and unsuccessful interactions. Successful interactions are used to model trust within the context of chains of trust in which an agent is permitted to recommend a service. This is termed trust chain since the agent need to first interact with the service and also next with the requestor of the service. Five trust theorems are proposed and used in four types or instances of interactions modelled and simulated. It is shown that for trust to grow, the length of interaction time need to approach infinity and hence, trust could never be absolute in practical terms. Trust tends towards or asymptotes to an absolute trust but over a very long time. © 2010 IEEE.	en_US
dc.relation.ispartof	24th IEEE International Conference on Advanced Information Networking and Applications Workshops, WAINA 2010	en_US
dc.relation.isbasedon	10.1109/WAINA.2010.171	en_US
dc.title	A new trust chain model	en_US
dc.type	Conference Proceeding
utslib.for	0805 Distributed Computing	en_US
dc.location.activity	Perth, Australia	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
utslib.copyright.status	closed_access
pubs.publication-status	Published	en_US

Abstract:

Trust is generally based on the level and quality of interaction with the entity being trusted. In a web service or the Internet, trust is based on the level of successful and unsuccessful interactions. Successful interactions are used to model trust within the context of chains of trust in which an agent is permitted to recommend a service. This is termed trust chain since the agent need to first interact with the service and also next with the requestor of the service. Five trust theorems are proposed and used in four types or instances of interactions modelled and simulated. It is shown that for trust to grow, the length of interaction time need to approach infinity and hence, trust could never be absolute in practical terms. Trust tends towards or asymptotes to an absolute trust but over a very long time. © 2010 IEEE.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/16217