2020
DOI: 10.1016/j.comnet.2020.107192
|View full text |Cite
|
Sign up to set email alerts
|

Group authentication protocol based on aggregated signatures for D2D communication

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 18 publications
(2 citation statements)
references
References 23 publications
0
2
0
Order By: Relevance
“…The CSP works according to the following operations: CSP, AG, and SMs are organized as leafs in a binary tree structure, with a secret SECy calculated from the secret values of the nodes above them, as in the organization adopted in References 22,23. CSP randomly selects a prime number of k‐bits, chooses G1 and G2 (two elliptical curve groups of order p); moreover, a generator point P is considered in G1. A random number xcsp0.12emϵ0.12emZp*$$ {x}_{\mathrm{csp}}\;\epsilon\;{Z}_p^{\ast } $$ is selected as a private key from which a public key is calculated as follows: PKcsp=xnormalcsp*P$$ {\mathrm{PK}}_{\mathrm{csp}}={x_{\mathrm{csp}}}^{\ast }P $$. xcsp$$ {x}_{\mathrm{csp}} $$ and PKcsp$$ {\mathrm{PK}}_{\mathrm{csp}} $$ will be the system master key. A group key GKi$$ {\mathrm{GK}}_i $$ is then calculated from the secrets of each SM and AG located in the tree, from a random number g ϵ0.25emZp*$$ \epsilon\ {Z}_p^{\ast } $$, and from the public key of the system ()normalPKnormalcsp$$ \left({\mathrm{PK}}_{\mathrm{csp}}\right) $$: GKigoodbreak=h2()SECi1SECi2SECij()normalg*PKcsp.$$ {\mathrm{GK}}_i={h}_2\left({\mathrm{SEC}}_{i-1}\oplus {\mathrm{SEC}}_{i-2}\oplus \cdots \oplus {\mathrm{SEC}}_{i-j}\oplus \left(\mathrm{g}\ast {\mathrm{PK}}_{\mathrm{csp}}...…”
Section: Proposed Protocolmentioning
confidence: 99%
“…The CSP works according to the following operations: CSP, AG, and SMs are organized as leafs in a binary tree structure, with a secret SECy calculated from the secret values of the nodes above them, as in the organization adopted in References 22,23. CSP randomly selects a prime number of k‐bits, chooses G1 and G2 (two elliptical curve groups of order p); moreover, a generator point P is considered in G1. A random number xcsp0.12emϵ0.12emZp*$$ {x}_{\mathrm{csp}}\;\epsilon\;{Z}_p^{\ast } $$ is selected as a private key from which a public key is calculated as follows: PKcsp=xnormalcsp*P$$ {\mathrm{PK}}_{\mathrm{csp}}={x_{\mathrm{csp}}}^{\ast }P $$. xcsp$$ {x}_{\mathrm{csp}} $$ and PKcsp$$ {\mathrm{PK}}_{\mathrm{csp}} $$ will be the system master key. A group key GKi$$ {\mathrm{GK}}_i $$ is then calculated from the secrets of each SM and AG located in the tree, from a random number g ϵ0.25emZp*$$ \epsilon\ {Z}_p^{\ast } $$, and from the public key of the system ()normalPKnormalcsp$$ \left({\mathrm{PK}}_{\mathrm{csp}}\right) $$: GKigoodbreak=h2()SECi1SECi2SECij()normalg*PKcsp.$$ {\mathrm{GK}}_i={h}_2\left({\mathrm{SEC}}_{i-1}\oplus {\mathrm{SEC}}_{i-2}\oplus \cdots \oplus {\mathrm{SEC}}_{i-j}\oplus \left(\mathrm{g}\ast {\mathrm{PK}}_{\mathrm{csp}}...…”
Section: Proposed Protocolmentioning
confidence: 99%
“…With the development of cloud computing and cloud storage technology, the authentication process of intelligent mobile devices can also be completed by relying on cloud computing technology to improve the authentication efficiency [13]. In addition, the traditional authentication mode is not suitable for equipment to equipment authentication, which can achieve the security of end-toend authentication and reduce the need of computing cost ripple [14]. In the application scenario of unstable network or no network, offline authentication can improve the reliability of device authentication.…”
Section: Introductionmentioning
confidence: 99%