An Efficient Keys Agreement for Multi-party's Communication

Group key agreement problem is important in many modern collaborative and distributed applications. In this paper, based on bilinear pairings cryptosystem, an efficient constant-round keys agreement is proposed for multi-party's communication, which can not only establish a group key for all pa...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Zhang Peng, Ye Chengqing, Li Xin, Ma Xuying
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 269
container_issue
container_start_page 267
container_title
container_volume
creator Zhang Peng
Ye Chengqing
Li Xin
Ma Xuying
description Group key agreement problem is important in many modern collaborative and distributed applications. In this paper, based on bilinear pairings cryptosystem, an efficient constant-round keys agreement is proposed for multi-party's communication, which can not only establish a group key for all participators but also establish key for every party that is a group too. Compared with other constant-round contributory key agreement, it is no need for about half of group members to broadcast messages in second round information exchange, so it saves communication cost largely.
doi_str_mv 10.1109/PDCAT.2005.78
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_1578912</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1578912</ieee_id><sourcerecordid>1578912</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-395eff5d0dc7d0ab313efd310628d3d326d036dae63ba2729ec74f12a15c9e7d3</originalsourceid><addsrcrecordid>eNotzD1PwzAQgGFLgEQpHZlYsjEl3Pnq2BZTFMqHKIKhzJUbn5FRk1ROOuTfowqmV8_yCnGDUCCCvf98rKtNIQFUoc2ZuAJdWiWXoOS5mEnSNlek5KVYDMMPABAaY42diYeqy1YhxCZyN2ZvPA1Z9Z2Y2xNDn7L3436M-cGlcbobsrpv22MXGzfGvrsWF8HtB178dy6-nlab-iVffzy_1tU6j6jVmJNVHILy4Bvtwe0IiYMnhFIaT55k6YFK77iknZNaWm70MqB0qBrL2tNc3P59IzNvDym2Lk1bVNpYlPQLQpxHCQ</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>An Efficient Keys Agreement for Multi-party's Communication</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Zhang Peng ; Ye Chengqing ; Li Xin ; Ma Xuying</creator><creatorcontrib>Zhang Peng ; Ye Chengqing ; Li Xin ; Ma Xuying</creatorcontrib><description>Group key agreement problem is important in many modern collaborative and distributed applications. In this paper, based on bilinear pairings cryptosystem, an efficient constant-round keys agreement is proposed for multi-party's communication, which can not only establish a group key for all participators but also establish key for every party that is a group too. Compared with other constant-round contributory key agreement, it is no need for about half of group members to broadcast messages in second round information exchange, so it saves communication cost largely.</description><identifier>ISSN: 2379-5352</identifier><identifier>ISBN: 0769524052</identifier><identifier>ISBN: 9780769524054</identifier><identifier>DOI: 10.1109/PDCAT.2005.78</identifier><language>eng</language><publisher>IEEE</publisher><subject>Application software ; Broadcasting ; Collaboration ; Collaborative tools ; Computer science ; Costs ; Educational institutions ; Identity-based encryption ; Public key ; Public key cryptography</subject><ispartof>Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05), 2005, p.267-269</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/1578912$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,4036,4037,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1578912$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Zhang Peng</creatorcontrib><creatorcontrib>Ye Chengqing</creatorcontrib><creatorcontrib>Li Xin</creatorcontrib><creatorcontrib>Ma Xuying</creatorcontrib><title>An Efficient Keys Agreement for Multi-party's Communication</title><title>Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)</title><addtitle>PDCAT</addtitle><description>Group key agreement problem is important in many modern collaborative and distributed applications. In this paper, based on bilinear pairings cryptosystem, an efficient constant-round keys agreement is proposed for multi-party's communication, which can not only establish a group key for all participators but also establish key for every party that is a group too. Compared with other constant-round contributory key agreement, it is no need for about half of group members to broadcast messages in second round information exchange, so it saves communication cost largely.</description><subject>Application software</subject><subject>Broadcasting</subject><subject>Collaboration</subject><subject>Collaborative tools</subject><subject>Computer science</subject><subject>Costs</subject><subject>Educational institutions</subject><subject>Identity-based encryption</subject><subject>Public key</subject><subject>Public key cryptography</subject><issn>2379-5352</issn><isbn>0769524052</isbn><isbn>9780769524054</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotzD1PwzAQgGFLgEQpHZlYsjEl3Pnq2BZTFMqHKIKhzJUbn5FRk1ROOuTfowqmV8_yCnGDUCCCvf98rKtNIQFUoc2ZuAJdWiWXoOS5mEnSNlek5KVYDMMPABAaY42diYeqy1YhxCZyN2ZvPA1Z9Z2Y2xNDn7L3436M-cGlcbobsrpv22MXGzfGvrsWF8HtB178dy6-nlab-iVffzy_1tU6j6jVmJNVHILy4Bvtwe0IiYMnhFIaT55k6YFK77iknZNaWm70MqB0qBrL2tNc3P59IzNvDym2Lk1bVNpYlPQLQpxHCQ</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Zhang Peng</creator><creator>Ye Chengqing</creator><creator>Li Xin</creator><creator>Ma Xuying</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>2005</creationdate><title>An Efficient Keys Agreement for Multi-party's Communication</title><author>Zhang Peng ; Ye Chengqing ; Li Xin ; Ma Xuying</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-395eff5d0dc7d0ab313efd310628d3d326d036dae63ba2729ec74f12a15c9e7d3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Application software</topic><topic>Broadcasting</topic><topic>Collaboration</topic><topic>Collaborative tools</topic><topic>Computer science</topic><topic>Costs</topic><topic>Educational institutions</topic><topic>Identity-based encryption</topic><topic>Public key</topic><topic>Public key cryptography</topic><toplevel>online_resources</toplevel><creatorcontrib>Zhang Peng</creatorcontrib><creatorcontrib>Ye Chengqing</creatorcontrib><creatorcontrib>Li Xin</creatorcontrib><creatorcontrib>Ma Xuying</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>Zhang Peng</au><au>Ye Chengqing</au><au>Li Xin</au><au>Ma Xuying</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>An Efficient Keys Agreement for Multi-party's Communication</atitle><btitle>Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)</btitle><stitle>PDCAT</stitle><date>2005</date><risdate>2005</risdate><spage>267</spage><epage>269</epage><pages>267-269</pages><issn>2379-5352</issn><isbn>0769524052</isbn><isbn>9780769524054</isbn><abstract>Group key agreement problem is important in many modern collaborative and distributed applications. In this paper, based on bilinear pairings cryptosystem, an efficient constant-round keys agreement is proposed for multi-party's communication, which can not only establish a group key for all participators but also establish key for every party that is a group too. Compared with other constant-round contributory key agreement, it is no need for about half of group members to broadcast messages in second round information exchange, so it saves communication cost largely.</abstract><pub>IEEE</pub><doi>10.1109/PDCAT.2005.78</doi><tpages>3</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 2379-5352
ispartof Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05), 2005, p.267-269
issn 2379-5352
language eng
recordid cdi_ieee_primary_1578912
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Application software
Broadcasting
Collaboration
Collaborative tools
Computer science
Costs
Educational institutions
Identity-based encryption
Public key
Public key cryptography
title An Efficient Keys Agreement for Multi-party's Communication
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-09T06%3A50%3A17IST&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=An%20Efficient%20Keys%20Agreement%20for%20Multi-party's%20Communication&rft.btitle=Sixth%20International%20Conference%20on%20Parallel%20and%20Distributed%20Computing%20Applications%20and%20Technologies%20(PDCAT'05)&rft.au=Zhang%20Peng&rft.date=2005&rft.spage=267&rft.epage=269&rft.pages=267-269&rft.issn=2379-5352&rft.isbn=0769524052&rft.isbn_list=9780769524054&rft_id=info:doi/10.1109/PDCAT.2005.78&rft_dat=%3Cieee_6IE%3E1578912%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=1578912&rfr_iscdi=true