-
1
A new CCA-secure encryption based on the Gap Hashed Diffie-Hellman problem
Published 2013Get full text
Article -
2
A Security-Mediated Encryption Scheme Based on ElGamal Variant
Published 2021-10-01Subjects: “…computational diffie-hellman problem…”
Get full text
Article -
3
Publicly Verifiable Multi-stage Secret Sharing on General Access Structures
Published 2023-05-01Subjects: “…monotone span program (msp); multi-stage secret sharing; bilinear pairing; computational diffie-hellman and decisional bilinear diffie-hellman problems; provably secure…”
Get full text
Article -
4
Revocable identity‐based matchmaking encryption in the standard model
Published 2023-07-01“…In particular, the authors give an effective and simple construction of RIB‐ME in the standard model, whose security is reduced to the hardness of decisional bilinear Diffie—Hellman problem and computational Diffie—Hellman problem. …”
Get full text
Article -
5
A lightweight attribute-based signcryption scheme based on cloud-fog assisted in smart healthcare.
Published 2024-01-01“…Security analysis confirms that the proposed scheme achieves indistinguishability under chosen ciphertext attack and existential unforgeability under chosen message attack if the computational bilinear Diffie-Hellman problem and the decisional bilinear Diffie-Hellman problem holds. …”
Get full text
Article -
6
An efficient identification protocol secure against concurrent-reset attacks
Published 2009-12-01“…Then we propose an extremely simple identification protocol and prove that its CR2 security is equivalent to the hardness of the Strong Diffie–Hellman problem.…”
Get full text
Article -
7
An improved lightweight certificateless generalized signcryption scheme for mobile-health system
Published 2019-01-01“…The confidentiality of our improved scheme can be reduced to the computational Diffie–Hellman problem, and the unforgeability, the Elliptic Curve Discrete Logarithm problem. …”
Get full text
Article -
8
Practical Three-Factor Authentication Protocol Based on Elliptic Curve Cryptography for Industrial Internet of Things
Published 2022-10-01“…Based on the elliptic curve Diffie–Hellman problem, we present a protocol achieving desirable forward and backward secrecy. …”
Get full text
Article -
9
Dynamic multi-keyword searchable encryption scheme
Published 2023-04-01“…Users of cloud storage often outsource their data to cloud servers to save local storage resources.However, cloud storage data is out of the user’s physical control, which may lead to malicious theft or disclosure of private data on cloud.At present, dynamic searchable encryption schemes are mostly based on symmetric searchable encryption, which need to establish a secure key sharing channel in advance, and cannot be directly applied to data sharing in cloud storage scenarios.For the secure sharing scenario of multi-party data in cloud storage, a dynamic multi-keyword searchable encryption scheme was proposed.The forward index was constructed by a cuckoo filter to enable data owners to perform documents and index dynamic updates.The conjunctive multi-keywords search was supported by combining bilinear pairing with Lagrangian interpolation polynomials.To reduce the computational overhead in the ciphertext retrieval phase, a combination of inverted index and forward index was constructed to improve the retrieval efficiency of cloud server.This scheme is provably secure with the indistinguishability in adaptively chosen keyword attack under decision linear Diffie-Hellman problem.Simulation experiments were conducted to analyze the execution efficiency of the scheme for keyword search and index update in different datasets.The results show that the scheme effectively avoids the linear correlation between the retrieval time and the number of ciphertexts, and reduces the computational overhead in the update operation with a large amount of data.…”
Get full text
Article -
10
Improved and Provably Secure ECC-Based Two-Factor Remote Authentication Scheme with Session Key Agreement
Published 2022-12-01“…Recently, a two-factor authentication scheme using hard problems in elliptic curve cryptography (ECC)—the elliptic curve discrete logarithm problem (ECDLP), elliptic curve computational Diffie–Hellman problem (ECCDHP), and elliptic curve factorization problem (ECFP)—was developed, but was unable to address several infeasibility issues while incurring high communication costs. …”
Get full text
Article -
11
An Improved Proxy Re-Encryption Scheme for IoT-Based Data Outsourcing Services in Clouds
Published 2020-12-01“…The proposed scheme is provably secure assuming the hardness of the bilinear inverse Diffie–Hellman problem (BIDHP). In particular, our scheme is bidirectional and supports the functionality of multi-hop, which allows an uploaded ciphertext to be transformed into a different one multiple times. …”
Get full text
Article -
12
On the cryptographic properties of “Limonnik-3” AKE scheme
Published 2019-06-01“…A formal security proof in a modified Canetti-Krawczyk model is deduced, provided that the gap decision Diffie-Hellman problem, connected to the discrete logarithm in the group of points of an elliptic curve, is computationally hard. …”
Get full text
Article -
13
An Enhanced Privacy-Preserving Authentication Scheme for Vehicle Sensor Networks
Published 2017-12-01“…The security of our proposed scheme is proven under the random oracle model based on the assumption of the computational Diffie–Hellman problem.…”
Get full text
Article -
14
A certificateless aggregate signature scheme for security and privacy protection in VANET
Published 2022-05-01“…The scheme is proven to be secure against the Type-1 ( A 1 ) and Type-2 ( A 2 ) adversaries in the random oracle model under the computational Diffie–Hellman problem assumption. Then, the performance evaluation demonstrates that our proposed scheme is more suitable for deployment in vehicular ad hoc network environments.…”
Get full text
Article -
15
QBPP: Quality of services–based location privacy protection method for location-based services in cloud-enabled Internet of vehicles
Published 2019-07-01“…To achieve better performance, this article presents a conditional anonymity method that does not use bilinear pairings to address the problem of privacy disclosure by using discrete logarithm problem and Diffie–Hellman problem. Moreover, asymmetric key algorithms are used in the Internet of vehicles environment to reduce the cost. …”
Get full text
Article -
16
Message sharing scheme based on edge computing in IoV
Published 2023-11-01“…Based on the computational Diffie-Hellman problem, it is demonstrated that the proposed scheme is secure under the random oracle model. …”
Get full text
Article -
17
Certificateless Aggregate Signcryption Scheme with Publicly Verifiable Pairless Operation
Published 2022-11-01“…In the random oracle model, the confidentiality and unforgeability of the scheme are reduced to the solving of computational Diffie-Hellman problem and discrete logarithm problem in polynomial time, which proves the security of the scheme. …”
Get full text
Article -
18
The Magic of ELFs
Published 2021“…Next, we give a construction of ELFs relying on the exponential hardness of the decisional Diffie–Hellman problem, which is plausible in elliptic curve groups. …”
Get full text
Article -
19
Self-Bilinear Map from One Way Encoding System and <i>i𝒪</i>
Published 2024-01-01“…Since the map itself reveals information about the underlying cyclic group, the Decisional Diffie–Hellman Problem (DDH) and the computational Diffie–Hellman (CDH) problem may be solved easily in some specific groups. …”
Get full text
Article -
20
An Anonymous Authentication and Key Establish Scheme for Smart Grid: FAuth
Published 2017-09-01“…The proposed scheme is based on bilinear maps and the computational Diffie–Hellman problem. We changed the way the smart meter parties registered at Key Generation Center, making the proposed scheme robust against various potential attacks that could be launched by the Key Generation Center, as the scheme could avoid the private key of the smart meter parties from leaking to the Key Generation Center. …”
Get full text
Article