Secure publish and subscribe systems with efficient revocation

Belguith, S ORCID: https://orcid.org/0000-0003-0069-8552, Cui, S, Asghar, MR and Russello, G 2018, Secure publish and subscribe systems with efficient revocation , in: ACM/SIGAPP Symposium On Applied Computing, 9-13 April 2018, Pau, France.

[img] PDF - Published Version
Restricted to Repository staff only

Download (1MB) | Request a copy

Abstract

User revocation is one of the main security issues in publish and subscribe (pub/sub) systems. Indeed, to ensure data confidentiality, the system should be able to remove malicious subscribers without affecting the functionalities and decoupling of authorised subscribers and publishers. To revoke a user, there are solutions, but existing schemes inevitably introduce high computation and communication overheads, which can ultimately affect the system capabilities. In this paper, we propose a novel revocation technique for pub/sub systems that can efficiently remove compromised subscribers without requiring regeneration and redistribution of new keys as well as re-encryption of existing data with those keys. Our proposed solution is such that a subscriber’s interest is not revealed to curious brokers and published data can only be accessed by the authorised subscribers. Finally, the proposed protocol is secure against the collusion attacks between brokers and revoked subscribers.

Item Type: Conference or Workshop Item (Paper)
Additional Information: Proceedings ISBN: 978-1-4503-5191-1
Schools: Schools > School of Computing, Science and Engineering > Salford Innovation Research Centre
Journal or Publication Title: Proceedings of the 33rd Annual ACM Symposium on Applied Computing
Publisher: ACM Digital Library
Depositing User: Dr. Sana Belguith
Date Deposited: 20 May 2019 11:26
Last Modified: 21 May 2019 11:32
URI: http://usir.salford.ac.uk/id/eprint/51371

Actions (login required)

Edit record (repository staff only) Edit record (repository staff only)

Downloads

Downloads per month over past year