Privacy Enhancing Identity Based Publisher Subscriber System

Authors(2) :-K.J.Sinduja , C.Kayalvizhi

The provisioning of basic security mechanisms such as authentication and confidentiality is highly challenging in a content based publish/subscribe system. Authentication of publishers and subscribers is difficult to achieve due to the loose coupling of publishers and subscribers. Confidentiality of events and subscriptions conflicts with content-based routing. Hence, new mechanisms are needed to route encrypted events to subscribers without knowing their subscriptions and to allow subscribers and publishers authenticate each other without knowing each other.Our approach allows subscribers to maintain credentials according to their subscriptions. This project is adapted by the pairing-based cryptography mechanisms and symmetric key generation. In over all approach, provides fine-grained key management and the cost for encryption, decryption, and routing is in the order of subscribed attributes. Finally, the evaluations show that providing security is affordable

Authors and Affiliations

K.J.Sinduja
Department of Computer Science, Dhanalakshmi College of Engineering, Chennai, Tamilnadu, India
C.Kayalvizhi
Department of Computer Science, Dhanalakshmi College of Engineering, Chennai, Tamilnadu, India

content based, publisher/subscriber, broker-less, security, identity-based encryption, paired based cryptography, symmetric key

[1] E. Anceaume, M. Gradinariu, A.K. Datta, G. Simon, and A. Virgillito, “A Semantic Overlay for Self- Peer-to-Peer Publish/ Subscribe,” Proc. 26th IEEE Int’l Conf. Distributed Computing Systems (ICDCS), 2006.

[2] J. Bacon, D.M. Eyers, J. Singh, and P.R. Pietzuch, “Access Control in Publish/Subscribe Systems,” Proc. Second ACM Int’l Conf. Distributed Event-Based Systems (DEBS), 2008.

[3] W.C. Barker and E.B. Barker, “SP 800-67 Rev. 1. Recommendation for the Triple Data Encryption Algorithm (TDEA) Block Cipher,” technical report, Nat’l Inst. of Standards & Technology, 2012.

[4] J. Bethencourt, A. Sahai, and B. Waters, “Ciphertext-Policy Attribute-Based Encryption,” Proc. IEEE Symp. Security and Privacy, 2007.

[5] D. Boneh, G.D. Crescenzo, R. Ostrovsky, and G. Persiano, “Public Key Encryption with Keyword Search,” Proc. Int’l Conf. Theory and Applications of Cryptographic Techniques on Advances in Cryptology (EUROCRYPT), 2004.

[6] D. Boneh and M.K. Franklin, “Identity-Based Encryption from the Weil Pairing,” Proc. Int’l Cryptology Conf. Advances in Cryptology, 2001.

[7] S. Choi, G. Ghinita, and E. Bertino, “A Privacy-Enhancing Content-Based Publish/Subscribe System Using Scalar Product Preserving Transformations,” Proc. 21st Int’l Conf. Database and Expert Systems Applications: Part I, 2010.

[8] V. Goyal, O. Pandey, A. Sahai, and B. Waters, “Attribute-Based Encryption for Fine-Grained Access Control of Encrypted Data,” Proc. ACM 13th Conf. Computer and Comm. Security (CCS), 2006.

[9] M. Ion, G. Russello, and B. Crispo, “Supporting Publication and Subscription Confidentiality in Pub/Sub Networks,” Proc. Sixth Int’l ICST Conf. Security and Privacy in Comm. Networks (SecureComm), 2010.

[10] H.-A. Jacobsen, A.K.Y. Cheung, G. Li, B. Maniymaran, V. Muthusamy, and R.S. Kazemzadeh, “The PADRES Publish/ Subscribe System,” Principles and Applications of Distributed Event-Based Systems. IGI Global, 2010.

Publication Details

Published in : Volume 1 | Issue 2 | March-April 2015
Date of Publication : 2015-04-25
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 114-118
Manuscript Number : IJSRSET152225
Publisher : Technoscience Academy

Print ISSN : 2395-1990, Online ISSN : 2394-4099

Cite This Article :

K.J.Sinduja , C.Kayalvizhi, " Privacy Enhancing Identity Based Publisher Subscriber System, International Journal of Scientific Research in Science, Engineering and Technology(IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 1, Issue 2, pp.114-118, March-April-2015.
Journal URL : http://ijsrset.com/IJSRSET152225

Article Preview

Follow Us

Contact Us