Symmetric Algorithm

14,000,000 Leading Edge Experts on the ideXlab platform

Scan Science and Technology

Contact Leading Edge Experts & Companies

Scan Science and Technology

Contact Leading Edge Experts & Companies

The Experts below are selected from a list of 51567 Experts worldwide ranked by ideXlab platform

Rajkumar Singh Rathore - One of the best experts on this subject based on the ideXlab platform.

  • an efficient distributed group key management using hierarchical approach with ecdh and Symmetric Algorithm
    Computer Engineering and Intelligent Systems, 2012
    Co-Authors: Uday Pratap Singh, Rajkumar Singh Rathore
    Abstract:

    Ensuring secure communication in an ad hoc network is extremely challenging because of the dynamic nature of the network and the lack of centralized management. For this reason, key management is particularly difficult to implement in such networks. Secure group communication is an increasingly popular research area having received much attention in recent years. Group key management is a fundamental building block for secure group communication systems. We will present an efficient many-to-many group key management protocol in distributed group communication. In this protocol, group members are managed in the hierarchical manner logically. Two kinds of keys are used, aSymmetric and Symmetric keys. The leaf nodes in the key tree are the aSymmetric keys of the corresponding group members and all the intermediate node keys are Symmetric keys assigned to each intermediate node. For aSymmetric key, a more efficient key agreement will be introduced. To calculate intermediate node keys, members use codes assigned to each intermediate node key tree. Group members calculate intermediate node keys rather than distributed by a sponsor member. The features of this approach are that, no keys are exchanged between existing members at join, and only one key, the group key, is delivered to remaining members at leave.

Toshihiko Kato - One of the best experts on this subject based on the ideXlab platform.

  • An efficient distributed group key management using hierarchical approach with Diffie-Hellman and Symmetric Algorithm: DHSA
    2011 International Symposium on Computer Networks and Distributed Systems CNDS 2011, 2011
    Co-Authors: Seyed Ali Mortazavi, Alireza Nemaney Pour, Toshihiko Kato
    Abstract:

    This paper proposes an efficient many-to-many group key management protocol in distributed group communication. In this protocol, group members are managed in the hierarchical manner logically. Two kinds of keys are used, aSymmetric and Symmetric keys. The leaf nodes in the key tree are the aSymmetric keys of the corresponding group members and all the intermediate node keys are Symmetric keys assigned to each intermediate node. For aSymmetric key, Diffie-Hellman key agreement is introduced. To calculate intermediate node keys, members use codes assigned to each intermediate node key tree. Group members calculate intermediate node keys rather than distributed by a sponsor member. The features of this approach are that, no keys are exchanged between existing members at join, and only one key, the group key, is delivered to remaining members at leave.

Nurul Hidayah Ab Rahman - One of the best experts on this subject based on the ideXlab platform.

  • email authentication using Symmetric and aSymmetric key Algorithm encryption
    AIP Conference Proceedings, 2017
    Co-Authors: Mohamad Azhar Abdul Halim, Isredza Rahmi, Nurul Azma Abdullah, Nurul Hidayah Ab Rahman
    Abstract:

    Protection of sensitive or classified data from unauthorized access, hackers and other personals is virtue. Storage of data is done in devices such as USB, external hard disk, laptops, I-Pad or at cloud. Cloud computing presents with both ups and downs. However, storing information elsewhere increases risk of being attacked by hackers. Besides, the risk of losing the device or being stolen is increased in case of storage in portable devices. There are array of mediums of communications and even emails used to send data or information but these technologies come along with severe weaknesses such as absence of confidentiality where the message sent can be altered and sent to the recipient. No proofs are shown to the recipient that the message received is altered. The recipient would not find out unless he or she checks with the sender. Without encrypted of data or message, sniffing tools and software can be used to hack and read the information since it is in plaintext. Therefore, an electronic mail authentication is proposed, namely Hybrid Encryption System (HES). The security of HES is protected using aSymmetric and Symmetric key Algorithms. The aSymmetric Algorithm is RSA and Symmetric Algorithm is Advance Encryption Standard. With the combination for both Algorithms in the HES may provide the confidentiality and authenticity to the electronic documents send from the sender to the recipient. In a nutshell, the HES will help users to protect their valuable documentation and data from illegal third party user.Protection of sensitive or classified data from unauthorized access, hackers and other personals is virtue. Storage of data is done in devices such as USB, external hard disk, laptops, I-Pad or at cloud. Cloud computing presents with both ups and downs. However, storing information elsewhere increases risk of being attacked by hackers. Besides, the risk of losing the device or being stolen is increased in case of storage in portable devices. There are array of mediums of communications and even emails used to send data or information but these technologies come along with severe weaknesses such as absence of confidentiality where the message sent can be altered and sent to the recipient. No proofs are shown to the recipient that the message received is altered. The recipient would not find out unless he or she checks with the sender. Without encrypted of data or message, sniffing tools and software can be used to hack and read the information since it is in plaintext. Therefore, an electronic mail authent...

  • email authentication using Symmetric and aSymmetric key Algorithm encryption
    AIP Conference Proceedings, 2017
    Co-Authors: Mohamad Azhar Abdul Halim, Isredza Rahmi, Nurul Azma Abdullah, Chuah Chai Wen, Nurul Hidayah Ab Rahman
    Abstract:

    Protection of sensitive or classified data from unauthorized access, hackers and other personals is virtue. Storage of data is done in devices such as USB, external hard disk, laptops, I-Pad or at cloud. Cloud computing presents with both ups and downs. However, storing information elsewhere increases risk of being attacked by hackers. Besides, the risk of losing the device or being stolen is increased in case of storage in portable devices. There are array of mediums of communications and even emails used to send data or information but these technologies come along with severe weaknesses such as absence of confidentiality where the message sent can be altered and sent to the recipient. No proofs are shown to the recipient that the message received is altered. The recipient would not find out unless he or she checks with the sender. Without encrypted of data or message, sniffing tools and software can be used to hack and read the information since it is in plaintext. Therefore, an electronic mail authentication is proposed, namely Hybrid Encryption System (HES). The security of HES is protected using aSymmetric and Symmetric key Algorithms. The aSymmetric Algorithm is RSA and Symmetric Algorithm is Advance Encryption Standard. With the combination for both Algorithms in the HES may provide the confidentiality and authenticity to the electronic documents send from the sender to the recipient. In a nutshell, the HES will help users to protect their valuable documentation and data from illegal third party user.

Uday Pratap Singh - One of the best experts on this subject based on the ideXlab platform.

  • an efficient distributed group key management using hierarchical approach with ecdh and Symmetric Algorithm
    Computer Engineering and Intelligent Systems, 2012
    Co-Authors: Uday Pratap Singh, Rajkumar Singh Rathore
    Abstract:

    Ensuring secure communication in an ad hoc network is extremely challenging because of the dynamic nature of the network and the lack of centralized management. For this reason, key management is particularly difficult to implement in such networks. Secure group communication is an increasingly popular research area having received much attention in recent years. Group key management is a fundamental building block for secure group communication systems. We will present an efficient many-to-many group key management protocol in distributed group communication. In this protocol, group members are managed in the hierarchical manner logically. Two kinds of keys are used, aSymmetric and Symmetric keys. The leaf nodes in the key tree are the aSymmetric keys of the corresponding group members and all the intermediate node keys are Symmetric keys assigned to each intermediate node. For aSymmetric key, a more efficient key agreement will be introduced. To calculate intermediate node keys, members use codes assigned to each intermediate node key tree. Group members calculate intermediate node keys rather than distributed by a sponsor member. The features of this approach are that, no keys are exchanged between existing members at join, and only one key, the group key, is delivered to remaining members at leave.

Seyed Ali Mortazavi - One of the best experts on this subject based on the ideXlab platform.

  • An efficient distributed group key management using hierarchical approach with Diffie-Hellman and Symmetric Algorithm: DHSA
    2011 International Symposium on Computer Networks and Distributed Systems CNDS 2011, 2011
    Co-Authors: Seyed Ali Mortazavi, Alireza Nemaney Pour, Toshihiko Kato
    Abstract:

    This paper proposes an efficient many-to-many group key management protocol in distributed group communication. In this protocol, group members are managed in the hierarchical manner logically. Two kinds of keys are used, aSymmetric and Symmetric keys. The leaf nodes in the key tree are the aSymmetric keys of the corresponding group members and all the intermediate node keys are Symmetric keys assigned to each intermediate node. For aSymmetric key, Diffie-Hellman key agreement is introduced. To calculate intermediate node keys, members use codes assigned to each intermediate node key tree. Group members calculate intermediate node keys rather than distributed by a sponsor member. The features of this approach are that, no keys are exchanged between existing members at join, and only one key, the group key, is delivered to remaining members at leave.