2017
DOI: 10.1371/journal.pone.0174473
|View full text |Cite
|
Sign up to set email alerts
|

Three-party authenticated key agreements for optimal communication

Abstract: Authenticated key agreements enable users to determine session keys, and to securely communicate with others over an insecure channel via the session keys. This study investigates the lower bounds on communications for three-party authenticated key agreements and considers whether or not the sub-keys for generating a session key can be revealed in the channel. Since two clients do not share any common secret key, they require the help of the server to authenticate their identities and exchange confidential and… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 33 publications
0
5
0
Order By: Relevance
“…We can distinguish several mutual authentication and key agreement schemes. Some of the techniques developed are based on symmetric key mechanisms, using a pre-shared common key [16]- [19]. In particular, Gong et al [16], [19] study the minimum number of communication rounds and messages needed to establish mutual authentication among three different parties, taking into account various assumptions.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…We can distinguish several mutual authentication and key agreement schemes. Some of the techniques developed are based on symmetric key mechanisms, using a pre-shared common key [16]- [19]. In particular, Gong et al [16], [19] study the minimum number of communication rounds and messages needed to establish mutual authentication among three different parties, taking into account various assumptions.…”
Section: Related Workmentioning
confidence: 99%
“…Some of the techniques developed are based on symmetric key mechanisms, using a pre-shared common key [16]- [19]. In particular, Gong et al [16], [19] study the minimum number of communication rounds and messages needed to establish mutual authentication among three different parties, taking into account various assumptions. The disadvantage in these schemes is that the session key is only constructed by the authentication server and the other two entities do not participate in the construction of it, making these schemes vulnerable for key control resilience attacks [20].…”
Section: Related Workmentioning
confidence: 99%
“…In the context of the so-called tripartite schemes, where three entities need to agree on a common key, we can also distinguish several identity-based mutual authentication schemes. Some of the schemes are based on symmetric key mechanisms, using a pre-shared common key [23][24][25][26]. In particular, [23,24] study the minimum amount of communication rounds and messages needed to establish mutual authentication among three different parties, taking into account different assumptions.…”
Section: Related Workmentioning
confidence: 99%
“…Some of the schemes are based on symmetric key mechanisms, using a pre-shared common key [23][24][25][26]. In particular, [23,24] study the minimum amount of communication rounds and messages needed to establish mutual authentication among three different parties, taking into account different assumptions. The disadvantage in these schemes is that the session key is only constructed by the authentication server and the other two entities do not participate in its construction, making these schemes vulnerable for key control resilience attacks [27].…”
Section: Related Workmentioning
confidence: 99%
“…We can distinguish symmetric key based schemes like e.g. [34]- [37], and public key based schemes like e.g. [38]- [40].…”
Section: Fog Architecturementioning
confidence: 99%