2019
DOI: 10.1016/j.ins.2019.06.032
|View full text |Cite
|
Sign up to set email alerts
|

Privacy-preserving authentication for general directed graphs in industrial IoT

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 27 publications
(15 citation statements)
references
References 8 publications
0
15
0
Order By: Relevance
“…In our scheme, several theoretic definitions also have been based, e.g. Bilinear pairing, Diffie-Hellman Exponent assumption (n-DHE), Strong Diffie-Hellman Problem (n-SDH), Hidden Strong Diffie-Hellman Exponent assumption (n-HSDHE) [16]and a standard digital signature scheme SDS = Gen, Sig, V er [4].…”
Section: Security Assumptionmentioning
confidence: 99%
See 4 more Smart Citations
“…In our scheme, several theoretic definitions also have been based, e.g. Bilinear pairing, Diffie-Hellman Exponent assumption (n-DHE), Strong Diffie-Hellman Problem (n-SDH), Hidden Strong Diffie-Hellman Exponent assumption (n-HSDHE) [16]and a standard digital signature scheme SDS = Gen, Sig, V er [4].…”
Section: Security Assumptionmentioning
confidence: 99%
“…2. This authentication problem solved in [4] utilizes the transitive authentication relationship between superior and subordinate for a directed tree. However, if node v km wants to access the node v qh , we can see that node v km and node v qh belong to different administrator, that is, in the different administrator domain.…”
Section: Transitive Authentication Modelmentioning
confidence: 99%
See 3 more Smart Citations