Results 171 to 180 of about 701 (185)

A Secure Proxy Blind Signature Scheme Based on ECDLP

2009 International Conference on Multimedia Information Networking and Security, 2009
To overcome the secure weakness of the existing proxy blind signature scheme based on ECDLP, an improved scheme is presented. The security of the improved scheme is enhanced by improving on the generate form of the proxy commission and the proxy private key in the proxy phase, the procedure of blinding and unblinding, and the corresponding verification
Zhengming Hu
exaly   +2 more sources

A Study on the Parameter of the Distinguished Point Method in Pollard’s Rho Method for ECDLP

2018 International Symposium on Information Theory and Its Applications (ISITA), 2018
In this research, the choice of the parameter for a method to generate distinguished rational points in Pollard’s Rho method to solve the elliptic curve discrete logarithm problem for Barreto-Naehrig (BN) curves is shown. The structures of random walk paths are confirmed by experiments for several BN curves.
Ken Ikuta, Sho Joichi, Kazuya Kobayashi, Md. Al-Amin Khandaker, Takuya Kusaka, Yasuyuki Nogami   +5 more
openaire   +2 more sources

An intrusion-resilient signature scheme based on ECDLP

2010 IEEE International Conference on Information Theory and Information Security, 2010
Intrusion-resilient signature schemes guarantee stronger security than forward-secure and key-insulated signature scheme. A novel intrusion-resilient signature scheme based on Elliptic Curve Discrete Logarithm Problem (ECDLP) is proposed. The proposed scheme combines the advantages of Elliptic Curve Digital Signature Algorithm (ECDSA) and intrusion ...
null Chenghua Li, null Xingbo Peng
exaly   +2 more sources

A Secure Off-Line Electronic Cash Scheme Based on ECDLP

2009 First International Workshop on Education Technology and Computer Science, 2009
The paper proposes a secure off-line electronic cash scheme based on ECDLP and gives a comprehensive analysis of its three sub protocols: withdrawal, payment, and deposit. It also proved the security of the scheme based on some cryptographic assumptions.
Zhan-gang Wang, Zhen-kai Wan
exaly   +2 more sources

An Efficient Group Signature Scheme Based on ECDLP

2023
Namita Tiwari, Amit Virmani, Ashutosh Tripathi   +2 more
openaire   +1 more source

Can we Beat the Square Root Bound for ECDLP over ?p2 via Representation?

Journal of Mathematical Cryptology, 2020
Alexander May
exaly  

Solving Small Exponential ECDLP in EC-Based Additively Homomorphic Encryption and Applications

IEEE Transactions on Information Forensics and Security, 2023
Weidong Qiu, Peng Tang, Fei Tang
exaly  

On the Computational Complexity of ECDLP for Elliptic Curves in Various Forms Using Index Calculus

Lecture Notes in Computer Science, 2018
Atsuko Miyaji, Chen-Mou Cheng
exaly  

The Fault Attack ECDLP Revisited.

IACR Cryptol. ePrint Arch., 2011
Mingqiang Wang, Xiaoyun Wang 0001, Tao Zhan   +2 more
openaire   +1 more source

On the Feasibility of an ECDLP Algorithm.

IACR Cryptol. ePrint Arch., 2018
openaire   +1 more source