An Efficient 3D Elliptic Curve Diffie–Hellman (ECDH) Based Two-Server Password-Only Authenticated Key Exchange Protocol with Provable Security

K, Anitha Kumari; Sadasivam, G. Sudha; Rohini, L.

doi:10.1080/03772063.2016.1176539

Cited by 11 publications

(3 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The function first generates a random prime number p and a generator g of the multiplicative group of integersmodulo p. The cloud's public key y is then generated as g x mod p, where x is a random integer. The shared key SK is then generated as g xy mod p. The confidentiality of the shared key is protected using access control lists (ACLs) [25] and Elliptic Curve Diffie-Hellman (ECDH) [26]. ACLs are used to control who has access to the shared key.…”

Section: Step 3 the Cloud Generates A Shared Key For Secure Multi-par...mentioning

confidence: 99%

Enhancing Cloud Data Privacy with a Scalable Hybrid Approach: HE-DP-SMC

Jaibir Singh

2024

jes

View full text Add to dashboard Cite

Cloud computing has become a popular way to store and access data. However, there are concerns about the privacy of data stored in the cloud. This paper proposes a novel privacy-preserving mechanism that uses a combination of homomorphic encryption, differential privacy, and secure multi-party computation. The mechanism allows users to store their data in the cloud while still ensuring the privacy of their data. The mechanism combines three cryptographic techniques: homomorphic encryption(HE), differential privacy(DP), and secure multi-party computation(SMC). Homomorphic encryption enables computations on encrypted data, ensuring that confidentiality is maintained throughout the storage process. Differential privacy(DP) techniques add an additional layer of protection by injecting controlled noise into query responses, preserving the privacy of individual data items. Secure multi-party computation protocols ensure that computations involving multiple cloud servers are performed securely without compromising the confidentiality of data. The mechanism is efficient and scalable. It can be used to protect the privacy of data in a wide range of applications, including healthcare, finance, and government. The quantitative results obtained from the performance evaluation of the proposed privacy-preserving mechanism reveal valuable insights into its efficiency and effectiveness. The mechanism shows promising results for small to medium-sized datasets. As the dataset size increases, the execution time, communication overhead, and storage requirements also increase proportionally. However, the mechanism maintains its scalability and efficiency. In comparison with baseline systems, the proposed mechanism outperforms systems without privacy-preserving mechanisms and only exhibits slightly slower performance than systems with traditional encryption. The proposed mechanism is a promising new approach to privacy-preserving cloud computing. It provides a strong level of protection against a variety of attacks, while still being efficient and scalable. It has the potential to revolutionize the way we store and share sensitive data..

show abstract

Section: Step 3 the Cloud Generates A Shared Key For Secure Multi-par...mentioning

confidence: 99%

Enhancing Cloud Data Privacy with a Scalable Hybrid Approach: HE-DP-SMC

Jaibir Singh

2024

jes

View full text Add to dashboard Cite

show abstract

“…The publication of Whitfield Diffie and Martin Hellman initiated a revolution in cryptography [32]. The theoretical conceptions of the public key encryption and the digital signature were presented and realized two years after Diffie and Hellman in the RSA cryptosystem by authors Rivest, Shamir, and Adleman [33][34][35][36][37][38][39].…”

Section: Diffie-hellman Protocolmentioning

confidence: 99%

Secure Key Exchange Against Man-in-the-Middle Attack: Modified Diffie-Hellman Protocol

Kara

Laouid

AlShaikh³

et al. 2021

Jurnal Ilmiah Teknik Elektro Komputer Dan Informatika

View full text Add to dashboard Cite

One of the most famous key exchange protocols is Diffie-Hellman Protocol (DHP) which is a widely used technique on which key exchange systems around the world depend. This protocol is simple and uncomplicated, and its robustness is based on the Discrete Logarithm Problem (DLP). Despite this, he is considered weak against the man-in-the-middle attack. This article presents a completely different version of the DHP protocol. The proposed version is based on two verification stages. In the first step, we check if the pseudo-random value α that Alice sends to Bob has been manipulated! In the second step, we make sure that the random value β that Bob sends to Alice is not manipulated. The man-in-the-middle attacker, Eve, can impersonate neither Alice nor Bob, manipulate their exchanged values, or discover the secret encryption key.

show abstract

“…In 2016, Kumari et al . introduced a three‐dimensional two‐server PAKE protocol to deal with text passwords [22]. They also proved the security of their protocol in a well‐defined security model.…”

Section: Related Workmentioning

confidence: 99%