Results 151 to 160 of about 1,230 (176)

Machine-Checking Unforgeability Proofs for Signature Schemes with Tight Reductions to the Computational Diffie-Hellman Problem

2021 IEEE 34th Computer Security Foundations Symposium (CSF), 2021
Digital signatures based on the Discrete Logarithm (DL) problem often suffer from long signature sizes, and reductions made loose by the use of Pointcheval and Stern’s Forking Lemma. At EUROCRYPT 2003, Goh and Jarecki provided the first forking-free proof of unforgeability for a DL-based signature scheme—rooting its security in the hardness of the ...
François Dupressoir, Sara Zain
openaire   +3 more sources

Computational Diffie-Hellman Problem

, 2011
Igor E Shparlinski, Shparlinski Igor
exaly   +4 more sources

On Relationship of Computational Diffie-Hellman Problem and Computational Square-Root Exponent Problem

Lecture Notes in Computer Science, 2011
The Computational Square-Root Exponent Problem (CSREP), which is a problem to compute a value whose discrete logarithm is a square root of the discrete logarithm of a given value, was proposed in the literature to show the reduction between the discrete logarithm problem and the factoring problem.
Fangguo Zhang, Ping Wang 0005
openaire   +3 more sources

Strongly Secure Authenticated Key Exchange Protocol Based on Computational Diffie-Hellman Problem. [PDF]

IACR Cryptol. ePrint Arch., 2008
Currently, there are a lot of authenticated key exchange (AKE) protocols in literature. However, the security proofs of this kind of protocols have been established to be a non-trivial task.
Hai Huang, Zhenfu Cao
openaire   +2 more sources

New concurrent digital signature scheme based on the computational Diffie-Hellman problem

The Journal of China Universities of Posts and Telecommunications, 2010
Abstract Based on strong designated verifiers signatures, a new fair concurrent signature scheme is proposed. Compared with the previous concurrent signature schemes, even if a keystone must be chosen by the initial signer, the matching signer will easily get the keystone through an extraction algorithm.
Wen QIN, Nan-run ZHOU
openaire   +1 more source

Secure and Efficient Identity-Based Proxy Signature Scheme in the Standard Model Based on Computational Diffie–Hellman Problem

Arabian Journal for Science and Engineering, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hu, Xiaoming, Zhang, Xiaojun, Wang, Jian, Xu, Huajie, Tan, Wenan, Yang, Yinchun   +5 more
openaire   +1 more source

Revocable Identity-Based Encryption from the Computational Diffie-Hellman Problem

2018
An Identity-based encryption (IBE) simplifies key management by taking users’ identities as public keys. However, how to dynamically revoke users in an IBE scheme is not a trivial problem. To solve this problem, IBE scheme with revocation (namely revocable IBE scheme) has been proposed.
Ziyuan Hu, Shengli Liu 0001, Kefei Chen, Joseph K. Liu   +3 more
openaire   +1 more source

Using the Modified Diffie–Hellman Problem to Enhance Client Computational Performance in a Three-Party Authenticated Key Agreement

Arabian Journal for Science and Engineering, 2017
A three-party authenticated key agreement (3PAKA) scheme is a protocol that enables a pair of registered clients to establish session keys via the help of a trusted server such that each client pre-shares its secret key with the server only. This approach greatly improves the scalability of key agreement protocols and provides better user convenience ...
openaire   +1 more source

On the Application of Computational Diffie-Hellman Problem to ID-Based Signatures from Pairings on Elliptic Curves

2014
The paper presents the application of the Computational Diffie-Hellman problem to ID-based signatures with pairings on elliptic curves in the random oracle model. It focusses on the security of the scheme.It also understands the fundamentals of provable security as applied in cryptography.
openaire   +1 more source

Separating Decision Diffie–Hellman from Computational Diffie–Hellman in Cryptographic Groups

Journal of Cryptology, 2003
Antoine Joux, Joux Antoine
exaly