ID-based threshold digital signature schemes on the elliptic curve discrete logarithm problem
From MaRDI portal
Publication:556108
DOI10.1016/j.amc.2004.06.033zbMath1072.94012OpenAlexW2091490260MaRDI QIDQ556108
Erl-Huei Lu, Pin-Chang Su, Henry Ker-Chang Chang
Publication date: 13 June 2005
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2004.06.033
Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Unnamed Item
- A non-interactive public-key distribution system
- The discrete logarithm problem on elliptic curves of trace one
- Elliptic Curve Cryptosystems
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Monte Carlo Methods for Index Computation (mod p)
- Reducing elliptic curve logarithms to logarithms in a finite field
- Group-oriented (t, n) threshold digital signature scheme and digital multisignature
- Evaluation of discrete logarithms in a group of 𝑝-torsion points of an elliptic curve in characteristic 𝑝