Finding Trusted Publish/Subscribe Trees - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

Finding Trusted Publish/Subscribe Trees

(1) , (1) , (1)
Stephen Naicken
  • Function : Author
  • PersonId : 1007372
Ian Wakeman
  • Function : Author
  • PersonId : 1007373
Dan Chalmers
  • Function : Author
  • PersonId : 1007374


Publish/Subscribe systems assume that clients and brokers abide by the matching and forwarding protocols. Such an assumption implies implicit trust between all components of the system and has led to security issues being largely ignored. As publish/subscribe is increasingly used in applications where implicit trust can not be assumed, an approach is required to mitigate misbehaviour. We propose the construction and reconfiguration of the event forwarding topology, the publish/subscribe tree (PST), with respect to the trust requirements of the clients. The principal contribution of this paper is a trust metric for PSTs, which aggregates each client’s trust evaluation of a PST to give a socially acceptable trust evaluation and allows for the ordering of PSTs. Additionally, we define the PST trust maximisation problem with overhead budget, which is solved by the PST that maximises trust within an overhead budget for a given advertisement. A tabu search based algorithm for this problem is presented and is shown to scale to large problem instances and give good approximations of the optimal solutions.
Fichier principal
Vignette du fichier
978-3-642-29852-3_12_Chapter.pdf (283.88 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01517643 , version 1 (03-05-2017)


Attribution - CC BY 4.0



Stephen Naicken, Ian Wakeman, Dan Chalmers. Finding Trusted Publish/Subscribe Trees. 6th International Conference on Trust Management (TM), May 2012, Surat, India. pp.174-190, ⟨10.1007/978-3-642-29852-3_12⟩. ⟨hal-01517643⟩
36 View
44 Download



Gmail Facebook Twitter LinkedIn More