PakeMail: Authentication and Key Management in Decentralized Secure Email and Messaging via PAKE

Sandoval, Itzel Vazquez; Atashpendar, Arash; Lenzini, Gabriele; Ryan, Peter Y. A.

doi:10.1007/978-3-030-90428-9_5

Cited by 3 publications

(3 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is to be clear from Figure 1 that our scheme's performance constraint, namely the entire searchTime, is optimal and reduced in comparison to the existing protocols. Our scheme consumes the searchTime 0.09 s while the existing K. Pak et al [31], Y. Tang et al [32], I. Vazquez Sandoval et al [33] and C. M. Chen et al [34] protocols consume 7.74 s, 0.88 s, 9 s, and 4.9 s, respectively which is higher in comparison to our scheme. Due to the large execution time, all existing protocols have huge computational complexity in real-time execution.…”

Section: Simulation Resultsmentioning

confidence: 63%

“…Figure 2 depicts the proposed scheme visited nodes as well as communication steps along with the diverse 3PAKE protocols explored during the last decade by various researchers. From Figure 2, it is clear that the suggested protocol is capable to visit over the 20 nodes, while the existing K. Pak et al [31], Y. Tang et al [32], I. Vazquez Sandoval et al [33] and C. M. Chen et al [34] protocols visit just over 18, 17, 13, and 15 nodes, respectively. Further, our protocol takes two communication steps in the testing procedure, which is optimal and minimum, while the existing protocols, i.e., K. Pak et al [31], Y. Tang et al [32], I. Vazquez Sandoval et al [33], and C. M. Chen et al [34], take 6, 6, 4, and 5 communication steps, respectively.…”

Section: Simulation Resultsmentioning

confidence: 94%

“…From Figure 2, it is clear that the suggested protocol is capable to visit over the 20 nodes, while the existing K. Pak et al [31], Y. Tang et al [32], I. Vazquez Sandoval et al [33] and C. M. Chen et al [34] protocols visit just over 18, 17, 13, and 15 nodes, respectively. Further, our protocol takes two communication steps in the testing procedure, which is optimal and minimum, while the existing protocols, i.e., K. Pak et al [31], Y. Tang et al [32], I. Vazquez Sandoval et al [33], and C. M. Chen et al [34], take 6, 6, 4, and 5 communication steps, respectively. The authors offered the concept as well as information regarding the AVISPA simulation software and then represented the entire HLPSL coding explanation with the simulation outcomes of the proposed protocol.…”

Section: Simulation Resultsmentioning

confidence: 94%

See 2 more Smart Citations

Security Verification of Social Network Model Using Improved Three-Party Authenticated Key Exchange Protocol

Sinha

Anand

Sandeep³

et al. 2022

Symmetry

View full text Add to dashboard Cite

The proper verification of users plays a vital role during communication over a social network to protect the personal data of users. Multifarious protocols have been implemented to secure the confidential data of the users, but these protocols have various limitations and are incapable of providing secrecy of data against various attacks, such as replay and cryptanalysis attacks. In this article, the authors proposed a novel method for security verification of the social network model using an improved three-party authenticated key exchange (3PAKE) protocol based on symmetric encryption and (ECC) elliptic curve cryptography. The outcome of the paper demonstrates that our proposed algorithm provides the desired secrecy to the confidential data exchange over social networks in real-time and consumes less time in comparison to existing protocols. Our protocol consumes a search time of 0.09 s, overall communication steps took 2 during the verification, and depth plies was 3 along with 20 visited nodes. The 3PAKE protocol has been considered a suitable approach for social network secrecy during information exchange between user and server, thereby providing greater secrecy to the user in data exchange over social networks and more robustness against multifarious known attacks, such as cryptanalysis and replay attacks in real-time.

show abstract