2006
DOI: 10.1093/ietisy/e89-d.3.1288
|View full text |Cite
|
Sign up to set email alerts
|

Zero-Knowledge Hierarchical Authentication in MANETs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
8
0

Year Published

2007
2007
2015
2015

Publication Types

Select...
3
3
2

Relationship

2
6

Authors

Journals

citations
Cited by 11 publications
(8 citation statements)
references
References 0 publications
0
8
0
Order By: Relevance
“…The proposal scheme is based on the [3] and [4] where the authentication method based on zero-knowledge proof (ZKP), is a cryptographic protocol. The prover tries to prove possession of a certain piece of information to verifier without revealing anything about it.…”
Section: Related Workmentioning
confidence: 99%
“…The proposal scheme is based on the [3] and [4] where the authentication method based on zero-knowledge proof (ZKP), is a cryptographic protocol. The prover tries to prove possession of a certain piece of information to verifier without revealing anything about it.…”
Section: Related Workmentioning
confidence: 99%
“…During the authentication procedure, the prover, denoted A, must answer to a number of challenges issued by the verifier, denoted B. The admission control included in the authentication proposal described below uses the general scheme of ZKP described in [2] based on the graph isomorphism problem, for the particular case of the Hamiltonian Cycle Problem (HCP), which involves the determination of whether a cycle that visits each node exactly once exists in a graph.…”
Section: Components Of the Proposalmentioning
confidence: 99%
“…Until now very few publications have mentioned the proposal of authentication systems for ad-hoc networks using ZKPs [6] [2] [13], and none of them has dealt with the related problem of topology changes in the network. A recent ZKP-based hierarchical proposal for MANETs related with the one proposed here was described in [4], where two different security levels were defined through the use of a hard-on-average graph problem, and no topology changes were considered.…”
Section: Introductionmentioning
confidence: 99%