Publish/subscribe mechanism is a typical many-to-many messaging paradigm when multiple applications want to receive the same message or when a group of applications would like to notify each other. Nonetheless, there exist only a few works that address the security issues for content-based publish/subscribe systems formally. Although the security requirements have been partially addressed by Wang et al., there is no formal definition for all of these security requirements in the literature. As a result, most of the existing schemes do not have any security proof and it is difficult to justify whether those schemes are really secure in practice. Furthermore, there is no comprehensive scheme that satisfies the most essential security requirements at the same time. In this paper, we introduce the first security model for important security requirements of content-based publish/subscribe systems. We also give a new security requirement for publisher authenticity, which means that the publisher is authenticated to publish certain types of notification only, and cannot publish other types of notification. We then exhibit a new scheme which fulfills most of the security requirements. Furthermore, we also provide a comprehensive proof for our concrete construction according to the new model. 2014 IOS Press.
[1]
Tatsuaki Okamoto,et al.
Fully Secure Unbounded Inner-Product and Attribute-Based Encryption
,
2012,
ASIACRYPT.
[2]
Jan Camenisch,et al.
An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation
,
2001,
IACR Cryptol. ePrint Arch..
[3]
Allison Bishop,et al.
Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
,
2010,
EUROCRYPT.
[4]
Alexander L. Wolf,et al.
Security issues and requirements for Internet-scale publish-subscribe systems
,
2002,
Proceedings of the 35th Annual Hawaii International Conference on System Sciences.
[5]
Allison Bishop,et al.
New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques
,
2012,
CRYPTO.