DHA-KD: Dynamic Hierarchical Agent Based Key Distribution in Group Communication
Confidentiality is one of the most nontrivial issues in secrecy of group communication. In order to satisfy confidentiality, symmetric cryptography must be exploited. All symmetric algorithms require a shared key between the members of group. High frequency in the number of joins and leaves of membe...
Gespeichert in:
Hauptverfasser: | , , , , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 306 |
---|---|
container_issue | |
container_start_page | 301 |
container_title | |
container_volume | |
creator | Moulavi, M.A. Nasiri, J.A. Bahmani, B. Parvar, H. Sadeghizadeh, M. Naghibzadeh, M. |
description | Confidentiality is one of the most nontrivial issues in secrecy of group communication. In order to satisfy confidentiality, symmetric cryptography must be exploited. All symmetric algorithms require a shared key between the members of group. High frequency in the number of joins and leaves of members can cause huge number of messages of data between authorized group members. Although hierarchical group communication is a prominent model, it has not been investigated in security literature as well as other models. There has been an extensive research on satisfying confidentiality in group communications on different architecture other than the hierarchical architecture and the proposed hierarchical models do not use the concept of agents. A concept that brings its own advantages. In this paper, we investigate a new approach to secure key management in hierarchical group communication by means of using intelligent agents. The simulation results show that using agents reduce network bandwidth and improve and achieve more performance comparing with other models. Moreover, using agents makes the architecture more flexible and dynamic preparing it for grid computing technologies. |
doi_str_mv | 10.1109/SNPD.2008.23 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4617387</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4617387</ieee_id><sourcerecordid>4617387</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-7ec8c8ce36a347e4fca1e52e3d4b0896fed3e53c168afab526864a8b2f418f373</originalsourceid><addsrcrecordid>eNotTktPg0AY3MQ0USs3b172D4C7-8E-vCFoMW20iXpuFvhW1xRoeBz499LozGGSmcxkCLnlLOKcmfv3130eCcZ0JOCCBEZppqRJQEgwK3J9ToyQjCeXJBiGH7YAzJLpK7LPizTc5g80n1vb-IoWHnvbV9--skeafmE70kc7YE23ONPcD2Pvy2n0XUt9Szd9N51o1jXN1C6Fs31DVs4eBwz-dU0-n58-siLcvW1esnQXeq6SMVRY6YUI0kKsMHaV5ZgIhDoul7fSYQ2YQMWlts6WiZBaxlaXwsVcO1CwJnd_ux4RD6feN7afD7HkCrSCX3oXTqk</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>DHA-KD: Dynamic Hierarchical Agent Based Key Distribution in Group Communication</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Moulavi, M.A. ; Nasiri, J.A. ; Bahmani, B. ; Parvar, H. ; Sadeghizadeh, M. ; Naghibzadeh, M.</creator><creatorcontrib>Moulavi, M.A. ; Nasiri, J.A. ; Bahmani, B. ; Parvar, H. ; Sadeghizadeh, M. ; Naghibzadeh, M.</creatorcontrib><description>Confidentiality is one of the most nontrivial issues in secrecy of group communication. In order to satisfy confidentiality, symmetric cryptography must be exploited. All symmetric algorithms require a shared key between the members of group. High frequency in the number of joins and leaves of members can cause huge number of messages of data between authorized group members. Although hierarchical group communication is a prominent model, it has not been investigated in security literature as well as other models. There has been an extensive research on satisfying confidentiality in group communications on different architecture other than the hierarchical architecture and the proposed hierarchical models do not use the concept of agents. A concept that brings its own advantages. In this paper, we investigate a new approach to secure key management in hierarchical group communication by means of using intelligent agents. The simulation results show that using agents reduce network bandwidth and improve and achieve more performance comparing with other models. Moreover, using agents makes the architecture more flexible and dynamic preparing it for grid computing technologies.</description><identifier>ISBN: 9780769532639</identifier><identifier>ISBN: 0769532632</identifier><identifier>DOI: 10.1109/SNPD.2008.23</identifier><identifier>LCCN: 2008926015</identifier><language>eng</language><publisher>IEEE</publisher><subject>Agent ; Bandwidth ; Computers ; Cryptography ; Degradation ; Group Communication ; Hierarchical ; Key Distribution ; Load modeling ; Nominations and elections ; Probes</subject><ispartof>2008 Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2008, p.301-306</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4617387$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,777,781,786,787,2052,27906,54901</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4617387$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Moulavi, M.A.</creatorcontrib><creatorcontrib>Nasiri, J.A.</creatorcontrib><creatorcontrib>Bahmani, B.</creatorcontrib><creatorcontrib>Parvar, H.</creatorcontrib><creatorcontrib>Sadeghizadeh, M.</creatorcontrib><creatorcontrib>Naghibzadeh, M.</creatorcontrib><title>DHA-KD: Dynamic Hierarchical Agent Based Key Distribution in Group Communication</title><title>2008 Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing</title><addtitle>SNPD</addtitle><description>Confidentiality is one of the most nontrivial issues in secrecy of group communication. In order to satisfy confidentiality, symmetric cryptography must be exploited. All symmetric algorithms require a shared key between the members of group. High frequency in the number of joins and leaves of members can cause huge number of messages of data between authorized group members. Although hierarchical group communication is a prominent model, it has not been investigated in security literature as well as other models. There has been an extensive research on satisfying confidentiality in group communications on different architecture other than the hierarchical architecture and the proposed hierarchical models do not use the concept of agents. A concept that brings its own advantages. In this paper, we investigate a new approach to secure key management in hierarchical group communication by means of using intelligent agents. The simulation results show that using agents reduce network bandwidth and improve and achieve more performance comparing with other models. Moreover, using agents makes the architecture more flexible and dynamic preparing it for grid computing technologies.</description><subject>Agent</subject><subject>Bandwidth</subject><subject>Computers</subject><subject>Cryptography</subject><subject>Degradation</subject><subject>Group Communication</subject><subject>Hierarchical</subject><subject>Key Distribution</subject><subject>Load modeling</subject><subject>Nominations and elections</subject><subject>Probes</subject><isbn>9780769532639</isbn><isbn>0769532632</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2008</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotTktPg0AY3MQ0USs3b172D4C7-8E-vCFoMW20iXpuFvhW1xRoeBz499LozGGSmcxkCLnlLOKcmfv3130eCcZ0JOCCBEZppqRJQEgwK3J9ToyQjCeXJBiGH7YAzJLpK7LPizTc5g80n1vb-IoWHnvbV9--skeafmE70kc7YE23ONPcD2Pvy2n0XUt9Szd9N51o1jXN1C6Fs31DVs4eBwz-dU0-n58-siLcvW1esnQXeq6SMVRY6YUI0kKsMHaV5ZgIhDoul7fSYQ2YQMWlts6WiZBaxlaXwsVcO1CwJnd_ux4RD6feN7afD7HkCrSCX3oXTqk</recordid><startdate>200808</startdate><enddate>200808</enddate><creator>Moulavi, M.A.</creator><creator>Nasiri, J.A.</creator><creator>Bahmani, B.</creator><creator>Parvar, H.</creator><creator>Sadeghizadeh, M.</creator><creator>Naghibzadeh, M.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200808</creationdate><title>DHA-KD: Dynamic Hierarchical Agent Based Key Distribution in Group Communication</title><author>Moulavi, M.A. ; Nasiri, J.A. ; Bahmani, B. ; Parvar, H. ; Sadeghizadeh, M. ; Naghibzadeh, M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-7ec8c8ce36a347e4fca1e52e3d4b0896fed3e53c168afab526864a8b2f418f373</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Agent</topic><topic>Bandwidth</topic><topic>Computers</topic><topic>Cryptography</topic><topic>Degradation</topic><topic>Group Communication</topic><topic>Hierarchical</topic><topic>Key Distribution</topic><topic>Load modeling</topic><topic>Nominations and elections</topic><topic>Probes</topic><toplevel>online_resources</toplevel><creatorcontrib>Moulavi, M.A.</creatorcontrib><creatorcontrib>Nasiri, J.A.</creatorcontrib><creatorcontrib>Bahmani, B.</creatorcontrib><creatorcontrib>Parvar, H.</creatorcontrib><creatorcontrib>Sadeghizadeh, M.</creatorcontrib><creatorcontrib>Naghibzadeh, M.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Moulavi, M.A.</au><au>Nasiri, J.A.</au><au>Bahmani, B.</au><au>Parvar, H.</au><au>Sadeghizadeh, M.</au><au>Naghibzadeh, M.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>DHA-KD: Dynamic Hierarchical Agent Based Key Distribution in Group Communication</atitle><btitle>2008 Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing</btitle><stitle>SNPD</stitle><date>2008-08</date><risdate>2008</risdate><spage>301</spage><epage>306</epage><pages>301-306</pages><isbn>9780769532639</isbn><isbn>0769532632</isbn><abstract>Confidentiality is one of the most nontrivial issues in secrecy of group communication. In order to satisfy confidentiality, symmetric cryptography must be exploited. All symmetric algorithms require a shared key between the members of group. High frequency in the number of joins and leaves of members can cause huge number of messages of data between authorized group members. Although hierarchical group communication is a prominent model, it has not been investigated in security literature as well as other models. There has been an extensive research on satisfying confidentiality in group communications on different architecture other than the hierarchical architecture and the proposed hierarchical models do not use the concept of agents. A concept that brings its own advantages. In this paper, we investigate a new approach to secure key management in hierarchical group communication by means of using intelligent agents. The simulation results show that using agents reduce network bandwidth and improve and achieve more performance comparing with other models. Moreover, using agents makes the architecture more flexible and dynamic preparing it for grid computing technologies.</abstract><pub>IEEE</pub><doi>10.1109/SNPD.2008.23</doi><tpages>6</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISBN: 9780769532639 |
ispartof | 2008 Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2008, p.301-306 |
issn | |
language | eng |
recordid | cdi_ieee_primary_4617387 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | Agent Bandwidth Computers Cryptography Degradation Group Communication Hierarchical Key Distribution Load modeling Nominations and elections Probes |
title | DHA-KD: Dynamic Hierarchical Agent Based Key Distribution in Group Communication |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-19T13%3A32%3A49IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=DHA-KD:%20Dynamic%20Hierarchical%20Agent%20Based%20Key%20Distribution%20in%20Group%20Communication&rft.btitle=2008%20Ninth%20ACIS%20International%20Conference%20on%20Software%20Engineering,%20Artificial%20Intelligence,%20Networking,%20and%20Parallel/Distributed%20Computing&rft.au=Moulavi,%20M.A.&rft.date=2008-08&rft.spage=301&rft.epage=306&rft.pages=301-306&rft.isbn=9780769532639&rft.isbn_list=0769532632&rft_id=info:doi/10.1109/SNPD.2008.23&rft_dat=%3Cieee_6IE%3E4617387%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4617387&rfr_iscdi=true |