Another look at non-standard discrete log and Diffie-Hellman problems by Koblitz Neal, Menezes Alfred

Subjects: Get full text

A new CCA-secure encryption based on the Gap Hashed Diffie-Hellman problem by Asbullah, Muhammad Asyraf, Kamel Ariffin, Muhammad Rezal

Get full text

Improved lower bound for Diffie–Hellman problem using multiplicative group of a finite field as auxiliary group by Kushwaha Prabhat

Subjects: “…lower bound for the diffie–hellman problem…”
Get full text

Triple receiver public key encryption cryptosystem by ZHAO Liutao, WANG Caiqun, ZHONG Lin, LIU Jidong, WU Dan

Subjects: Get full text

Password Authenticated Key Exchange and Protected Password Change Protocols by Ting-Yi Chang, Min-Shiang Hwang, Chou-Chen Yang

Subjects: Get full text

An improved secure designated server public key searchable encryption scheme with multi-ciphertext indistinguishability by Junling Guo, Lidong Han, Guang Yang, Xuejiao Liu, Chengliang Tian

Subjects: Get full text

Security Analysis and Improvement of Strongly Secure Certificateless Digital Signature Scheme by YE Sheng-nan, CHEN Jian-hua

Subjects: “…certificateless signature|bilinear pairings|security analysis|elliptic curve discrete diffie-hellman problem|random oracle model…”
Get full text

A Security-Mediated Encryption Scheme Based on ElGamal Variant by Boon Chian Tea, Muhammad Rezal Kamel Ariffin, Amir Hamzah Abd. Ghafar, Muhammad Asyraf Asbullah

Subjects: “…computational diffie-hellman problem…”
Get full text

Publicly Verifiable Multi-stage Secret Sharing on General Access Structures by SONG Yun, WANG Ningning, XIAO Menglin, SHAO Zhiyi

Subjects: “…monotone span program (msp); multi-stage secret sharing; bilinear pairing; computational diffie-hellman and decisional bilinear diffie-hellman problems; provably secure…”
Get full text

Revocable identity‐based matchmaking encryption in the standard model by Zhe Jiang, Xiwen Wang, Kai Zhang, Junqing Gong, Jie Chen, Haifeng Qian

“…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

A lightweight attribute-based signcryption scheme based on cloud-fog assisted in smart healthcare. by Yanzhong Sun, Xiaoni Du, Shufen Niu, Siwei Zhou

“…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

An efficient identification protocol secure against concurrent-reset attacks by Wu J., Stinson D. R.

“…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

A Backward Unlinkable Secret Handshake Scheme with Revocation Support in the Standard Model by Yamin Wen, Zheng Gong, Lingling Xu

“…In particular, the BU-RSH scheme is provably secure in the standard model by assuming the intractability of the `-hidden strong Diffie-Hellman problem and the subgroup decision problem.…”
Get full text

Privacy Protection for Telecare Medicine Information Systems with Multiple Servers Using a Biometric-based Authenticated Key Agreement Scheme by Chin-Laung Lei, Yun-Hsin Chuang

“…The security of the proposed scheme is based on the elliptic curve decisional Diffie-Hellman problem assumption and hash function assumption. …”
Get full text

An improved lightweight certificateless generalized signcryption scheme for mobile-health system by Caixue Zhou

“…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

Practical Three-Factor Authentication Protocol Based on Elliptic Curve Cryptography for Industrial Internet of Things by Xingwen Zhao, Dexin Li, Hui Li

“…Based on the elliptic curve Diffie–Hellman problem, we present a protocol achieving desirable forward and backward secrecy. …”
Get full text

Enhanced smartcard-based password-authenticated key agreement using extended chaotic maps. by Tian-Fu Lee, Chia-Hung Hsiao, Shi-Han Hwang, Tsung-Hung Lin

“…The session security of this enhanced scheme is based on the extended chaotic map-based Diffie-Hellman problem, and is proven in the real-or-random and the sequence of games models. …”
Get full text

MDBV: Monitoring Data Batch Verification for Survivability of Internet of Vehicles by Jingwei Liu, Qingqing Li, Huijuan Cao, Rong Sun, Xiaojiang Du, Mohsen Guizani

“…Additionally, MDBV is proved to be secure in the random oracle model assuming the intractability of the computational Diffie-Hellman problem. In consideration of the network survivability and performance, the proposed MDBV can decrease the computation overhead and is more suitable for IoV.…”
Get full text

Dynamic multi-keyword searchable encryption scheme by Chenghao YUAN, Yong LI, Shuang REN

“…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

Improved and Provably Secure ECC-Based Two-Factor Remote Authentication Scheme with Session Key Agreement by Fairuz Shohaimay, Eddie Shahril Ismail

“…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