Repository logo
Communities & Collections
All of DSpace
  • English
  • العربية
  • বাংলা
  • Català
  • Čeština
  • Deutsch
  • Ελληνικά
  • Español
  • Suomi
  • Français
  • Gàidhlig
  • हिंदी
  • Magyar
  • Italiano
  • Қазақ
  • Latviešu
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Српски
  • Svenska
  • Türkçe
  • Yкраї́нська
  • Tiếng Việt
Log In
Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Shanu, P.K."

Filter results by typing the first few letters
Now showing 1 - 4 of 4
  • Results Per Page
  • Sort Options
  • No Thumbnail Available
    Item
    Distribution function based efficient secure group communication using key tree
    (2016) Shanu, P.K.; Chandrasekaran, K.
    There are many applications such as a messaging application, teleconferencing, information service etc. which use a group communication model that provides confidentiality, integrity and authenticity of the messages sent over the group. Thus, it results in a secure group communication. The most important part in deploying a secure group communication model is to reduce the number of encryption and rekeying operations. Most of the known algorithm uses LKH (logical key hierarchy) based protocol in which a key tree or graph is created in hierarchical manner that will be used to multicast the messages at a cost of O(log n), where n is the number of members in the group. Almost all the methods introduced till now are not taking full advantage of the key tree they were mainly concentrated on minimizing the rekeying operations after a leave or a join in the group. We have proposed a simple and elegant method that is based on a distribution function F(S) to multicast the messages to a subset of n members of the group G. Our method takes the full advantage of the key tree, It minimizes the rekey operations with minimum time complexity and also maintain the security requirements for the secure group communication. � 2016 IEEE.
  • No Thumbnail Available
    Item
    Distribution function based efficient secure group communication using key tree
    (Institute of Electrical and Electronics Engineers Inc., 2016) Shanu, P.K.; Chandrasekaran, K.
    There are many applications such as a messaging application, teleconferencing, information service etc. which use a group communication model that provides confidentiality, integrity and authenticity of the messages sent over the group. Thus, it results in a secure group communication. The most important part in deploying a secure group communication model is to reduce the number of encryption and rekeying operations. Most of the known algorithm uses LKH (logical key hierarchy) based protocol in which a key tree or graph is created in hierarchical manner that will be used to multicast the messages at a cost of O(log n), where n is the number of members in the group. Almost all the methods introduced till now are not taking full advantage of the key tree they were mainly concentrated on minimizing the rekeying operations after a leave or a join in the group. We have proposed a simple and elegant method that is based on a distribution function F(S) to multicast the messages to a subset of n members of the group G. Our method takes the full advantage of the key tree, It minimizes the rekey operations with minimum time complexity and also maintain the security requirements for the secure group communication. © 2016 IEEE.
  • No Thumbnail Available
    Item
    Generating Privacy-Preserved Recommendation Using Homomorphic Authenticated Encryption
    (2017) Shanu, P.K.; Chandrasekaran, K.
    Online service providers started to providepersonalized recommendation to the users by collecting userprivate sensitive data. Traditionally the user private data isencrypted using a symmetric encryption algorithm beforestoring it in the cloud to provide another layer of security fordata at rest. It makes users' data secure from third parties, butnot the service provider. We propose a method that generatesrecommendations using homomorphically encrypted data in aprivacy preserved manner to provide protection against serviceprovider. We also verify the correctness of computations doneby a third parties and the service provider over encrypteddata using homomorphic authenticators and some securecryptographic protocols. � 2016 IEEE.
  • No Thumbnail Available
    Item
    Generating Privacy-Preserved Recommendation Using Homomorphic Authenticated Encryption
    (Institute of Electrical and Electronics Engineers Inc., 2017) Shanu, P.K.; Chandrasekaran, K.
    Online service providers started to providepersonalized recommendation to the users by collecting userprivate sensitive data. Traditionally the user private data isencrypted using a symmetric encryption algorithm beforestoring it in the cloud to provide another layer of security fordata at rest. It makes users' data secure from third parties, butnot the service provider. We propose a method that generatesrecommendations using homomorphically encrypted data in aprivacy preserved manner to provide protection against serviceprovider. We also verify the correctness of computations doneby a third parties and the service provider over encrypteddata using homomorphic authenticators and some securecryptographic protocols. © 2016 IEEE.

Maintained by Central Library NITK | DSpace software copyright © 2002-2026 LYRASIS

  • Privacy policy
  • End User Agreement
  • Send Feedback
Repository logo COAR Notify