A secure and efficient on-line/off-line group key distribution protocol

A secure and efficient on-line/off-line group key distribution protocol

Nowadays, group communications are getting more and more popular. In order to secure the communication, all participating users need to share a common group key in advance. The paper proposes a secure and efficient group key distribution protocol based on Shamir’s secret sharing scheme. In the proto...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Designs, codes, and cryptography codes, and cryptography, 2019-07, Vol.87 (7), p.1601-1620
Hauptverfasser: Meng, Keju, Miao, Fuyou, Yu, Yue
Format: Artikel
Sprache:eng
Schlagworte:
Authentication
Circuits
Coding and Information Theory
Computer Science
Cryptology
Data Structures and Information Theory
Discrete Mathematics in Computer Science
Information and Communication
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 1620
container_issue 7
container_start_page 1601
container_title Designs, codes, and cryptography
container_volume 87
creator Meng, Keju
Miao, Fuyou
Yu, Yue
description Nowadays, group communications are getting more and more popular. In order to secure the communication, all participating users need to share a common group key in advance. The paper proposes a secure and efficient group key distribution protocol based on Shamir’s secret sharing scheme. In the protocol, (1) each user only needs to send registration message in privacy, while all the other messages can be transported in public. Meanwhile, (2) the scheme supports authentication for group keys without any assumption of hard mathematics problem. Moreover, (3) the protocol introduces the notion of on-line/off-line into group key distribution and thus the speeds of group key response and recovery are greatly improved. Analyses show that our scheme is resistant to passive attack, impersonation attack and reply attack.
doi_str_mv 10.1007/s10623-018-0554-6
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2229931787</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2229931787</sourcerecordid><originalsourceid>FETCH-LOGICAL-c268t-74e5cc979d241580d80113a8095919bbd3daa7d342d7dfc854acd1a06dfe6f673</originalsourceid><addsrcrecordid>eNp1kEtLAzEUhYMoWKs_wF3AdexNMnktS_EFBTe6DmkeZWqd1GRm0X_v1BFcubp3cb5z4EPolsI9BVCLSkEyToBqAkI0RJ6hGRWKEyW0PEczMEwQCoxdoqtadwBAObAZelriGv1QInZdwDGl1rex63HuyL7t4iKn9PPgbcnDAX_EIw5t7Uu7Gfo2d_hQcp993l-ji-T2Nd783jl6f3x4Wz2T9evTy2q5Jp5J3RPVROG9USawhgoNQQOl3GkwwlCz2QQenFOBNyyokLwWjfOBOpAhRZmk4nN0N_WOw19DrL3d5aF046RljBnDqdKnFJ1SvuRaS0z2UNpPV46Wgj35spMvO_qyJ19WjgybmDpmu20sf83_Q98USG0e</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2229931787</pqid></control><display><type>article</type><title>A secure and efficient on-line/off-line group key distribution protocol</title><source>SpringerLink Journals</source><creator>Meng, Keju ; Miao, Fuyou ; Yu, Yue</creator><creatorcontrib>Meng, Keju ; Miao, Fuyou ; Yu, Yue</creatorcontrib><description>Nowadays, group communications are getting more and more popular. In order to secure the communication, all participating users need to share a common group key in advance. The paper proposes a secure and efficient group key distribution protocol based on Shamir’s secret sharing scheme. In the protocol, (1) each user only needs to send registration message in privacy, while all the other messages can be transported in public. Meanwhile, (2) the scheme supports authentication for group keys without any assumption of hard mathematics problem. Moreover, (3) the protocol introduces the notion of on-line/off-line into group key distribution and thus the speeds of group key response and recovery are greatly improved. Analyses show that our scheme is resistant to passive attack, impersonation attack and reply attack.</description><identifier>ISSN: 0925-1022</identifier><identifier>EISSN: 1573-7586</identifier><identifier>DOI: 10.1007/s10623-018-0554-6</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Authentication ; Circuits ; Coding and Information Theory ; Computer Science ; Cryptology ; Data Structures and Information Theory ; Discrete Mathematics in Computer Science ; Information and Communication</subject><ispartof>Designs, codes, and cryptography, 2019-07, Vol.87 (7), p.1601-1620</ispartof><rights>Springer Science+Business Media, LLC, part of Springer Nature 2018</rights><rights>Copyright Springer Nature B.V. 2019</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c268t-74e5cc979d241580d80113a8095919bbd3daa7d342d7dfc854acd1a06dfe6f673</cites><orcidid>0000-0001-8682-6003</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s10623-018-0554-6$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s10623-018-0554-6$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,777,781,27905,27906,41469,42538,51300</link.rule.ids></links><search><creatorcontrib>Meng, Keju</creatorcontrib><creatorcontrib>Miao, Fuyou</creatorcontrib><creatorcontrib>Yu, Yue</creatorcontrib><title>A secure and efficient on-line/off-line group key distribution protocol</title><title>Designs, codes, and cryptography</title><addtitle>Des. Codes Cryptogr</addtitle><description>Nowadays, group communications are getting more and more popular. In order to secure the communication, all participating users need to share a common group key in advance. The paper proposes a secure and efficient group key distribution protocol based on Shamir’s secret sharing scheme. In the protocol, (1) each user only needs to send registration message in privacy, while all the other messages can be transported in public. Meanwhile, (2) the scheme supports authentication for group keys without any assumption of hard mathematics problem. Moreover, (3) the protocol introduces the notion of on-line/off-line into group key distribution and thus the speeds of group key response and recovery are greatly improved. Analyses show that our scheme is resistant to passive attack, impersonation attack and reply attack.</description><subject>Authentication</subject><subject>Circuits</subject><subject>Coding and Information Theory</subject><subject>Computer Science</subject><subject>Cryptology</subject><subject>Data Structures and Information Theory</subject><subject>Discrete Mathematics in Computer Science</subject><subject>Information and Communication</subject><issn>0925-1022</issn><issn>1573-7586</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><recordid>eNp1kEtLAzEUhYMoWKs_wF3AdexNMnktS_EFBTe6DmkeZWqd1GRm0X_v1BFcubp3cb5z4EPolsI9BVCLSkEyToBqAkI0RJ6hGRWKEyW0PEczMEwQCoxdoqtadwBAObAZelriGv1QInZdwDGl1rex63HuyL7t4iKn9PPgbcnDAX_EIw5t7Uu7Gfo2d_hQcp993l-ji-T2Nd783jl6f3x4Wz2T9evTy2q5Jp5J3RPVROG9USawhgoNQQOl3GkwwlCz2QQenFOBNyyokLwWjfOBOpAhRZmk4nN0N_WOw19DrL3d5aF046RljBnDqdKnFJ1SvuRaS0z2UNpPV46Wgj35spMvO_qyJ19WjgybmDpmu20sf83_Q98USG0e</recordid><startdate>20190715</startdate><enddate>20190715</enddate><creator>Meng, Keju</creator><creator>Miao, Fuyou</creator><creator>Yu, Yue</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0001-8682-6003</orcidid></search><sort><creationdate>20190715</creationdate><title>A secure and efficient on-line/off-line group key distribution protocol</title><author>Meng, Keju ; Miao, Fuyou ; Yu, Yue</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c268t-74e5cc979d241580d80113a8095919bbd3daa7d342d7dfc854acd1a06dfe6f673</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Authentication</topic><topic>Circuits</topic><topic>Coding and Information Theory</topic><topic>Computer Science</topic><topic>Cryptology</topic><topic>Data Structures and Information Theory</topic><topic>Discrete Mathematics in Computer Science</topic><topic>Information and Communication</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Meng, Keju</creatorcontrib><creatorcontrib>Miao, Fuyou</creatorcontrib><creatorcontrib>Yu, Yue</creatorcontrib><collection>CrossRef</collection><jtitle>Designs, codes, and cryptography</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Meng, Keju</au><au>Miao, Fuyou</au><au>Yu, Yue</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A secure and efficient on-line/off-line group key distribution protocol</atitle><jtitle>Designs, codes, and cryptography</jtitle><stitle>Des. Codes Cryptogr</stitle><date>2019-07-15</date><risdate>2019</risdate><volume>87</volume><issue>7</issue><spage>1601</spage><epage>1620</epage><pages>1601-1620</pages><issn>0925-1022</issn><eissn>1573-7586</eissn><abstract>Nowadays, group communications are getting more and more popular. In order to secure the communication, all participating users need to share a common group key in advance. The paper proposes a secure and efficient group key distribution protocol based on Shamir’s secret sharing scheme. In the protocol, (1) each user only needs to send registration message in privacy, while all the other messages can be transported in public. Meanwhile, (2) the scheme supports authentication for group keys without any assumption of hard mathematics problem. Moreover, (3) the protocol introduces the notion of on-line/off-line into group key distribution and thus the speeds of group key response and recovery are greatly improved. Analyses show that our scheme is resistant to passive attack, impersonation attack and reply attack.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s10623-018-0554-6</doi><tpages>20</tpages><orcidid>https://orcid.org/0000-0001-8682-6003</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 0925-1022
ispartof Designs, codes, and cryptography, 2019-07, Vol.87 (7), p.1601-1620
issn 0925-1022
1573-7586
language eng
recordid cdi_proquest_journals_2229931787
source SpringerLink Journals
subjects Authentication
Circuits
Coding and Information Theory
Computer Science
Cryptology
Data Structures and Information Theory
Discrete Mathematics in Computer Science
Information and Communication
title A secure and efficient on-line/off-line group key distribution protocol
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-19T14%3A05%3A26IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20secure%20and%20efficient%20on-line/off-line%20group%20key%20distribution%20protocol&rft.jtitle=Designs,%20codes,%20and%20cryptography&rft.au=Meng,%20Keju&rft.date=2019-07-15&rft.volume=87&rft.issue=7&rft.spage=1601&rft.epage=1620&rft.pages=1601-1620&rft.issn=0925-1022&rft.eissn=1573-7586&rft_id=info:doi/10.1007/s10623-018-0554-6&rft_dat=%3Cproquest_cross%3E2229931787%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2229931787&rft_id=info:pmid/&rfr_iscdi=true