The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Cet article présente pour la première fois un sécurité prouvée schéma de signature avec récupération de message basé sur le logarithme discret à courbe elliptique. Le schéma proposé s'avère sûr au sens le plus fort (c'est-à-dire existentiellement infalsifiable contre les attaques de messages choisis de manière adaptative) dans le modèle oracle aléatoire sous l'hypothèse du logarithme discret. Nous donnons une analyse concrète de la réduction de la sécurité. Lorsque des fonctions de hachage pratiques sont utilisées à la place de fonctions véritablement aléatoires, le schéma proposé est presque aussi efficace que la version à courbe elliptique du schéma de signature de Schnorr et que les schémas existants avec récupération de message tels que la version à courbe elliptique du schéma de Nyberg-Rueppel et Schémas Miyaji.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Masayuki ABE, Tatsuaki OKAMOTO, "A Signature Scheme with Message Recovery as Secure as Discrete Logarithm" in IEICE TRANSACTIONS on Fundamentals,
vol. E84-A, no. 1, pp. 197-204, January 2001, doi: .
Abstract: This paper, for the first time, presents a provably secure signature scheme with message recovery based on the elliptic-curve discrete logarithm. The proposed scheme is proven to be secure in the strongest sense (i.e., existentially unforgeable against adaptively chosen message attacks) in the random oracle model under the discrete logarithm assumption. We give a concrete analysis of the security reduction. When practical hash functions are used in place of truly random functions, the proposed scheme is almost as efficient as the elliptic-curve version of the Schnorr signature scheme and existing schemes with message recovery such as the elliptic-curve version of the Nyberg-Rueppel and Miyaji schemes.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e84-a_1_197/_p
Copier
@ARTICLE{e84-a_1_197,
author={Masayuki ABE, Tatsuaki OKAMOTO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Signature Scheme with Message Recovery as Secure as Discrete Logarithm},
year={2001},
volume={E84-A},
number={1},
pages={197-204},
abstract={This paper, for the first time, presents a provably secure signature scheme with message recovery based on the elliptic-curve discrete logarithm. The proposed scheme is proven to be secure in the strongest sense (i.e., existentially unforgeable against adaptively chosen message attacks) in the random oracle model under the discrete logarithm assumption. We give a concrete analysis of the security reduction. When practical hash functions are used in place of truly random functions, the proposed scheme is almost as efficient as the elliptic-curve version of the Schnorr signature scheme and existing schemes with message recovery such as the elliptic-curve version of the Nyberg-Rueppel and Miyaji schemes.},
keywords={},
doi={},
ISSN={},
month={January},}
Copier
TY - JOUR
TI - A Signature Scheme with Message Recovery as Secure as Discrete Logarithm
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 197
EP - 204
AU - Masayuki ABE
AU - Tatsuaki OKAMOTO
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E84-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2001
AB - This paper, for the first time, presents a provably secure signature scheme with message recovery based on the elliptic-curve discrete logarithm. The proposed scheme is proven to be secure in the strongest sense (i.e., existentially unforgeable against adaptively chosen message attacks) in the random oracle model under the discrete logarithm assumption. We give a concrete analysis of the security reduction. When practical hash functions are used in place of truly random functions, the proposed scheme is almost as efficient as the elliptic-curve version of the Schnorr signature scheme and existing schemes with message recovery such as the elliptic-curve version of the Nyberg-Rueppel and Miyaji schemes.
ER -