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
Une chaîne de hachage H pour une fonction de hachage hachage(·) est une séquence de valeurs de hachage ⟨ xn, xn-1, ..., x0 ⟩, où x0 est une valeur secrète, xi est généré par xi = hachage(xi-1) pour 1 ≤ i ≤ n et xn est une valeur publique. Valeurs de hachage de H sont divulgués progressivement à partir de xn-1 à x0. L'exactitude d'une valeur de hachage divulguée xi peut être vérifié en vérifiant l’équation xn
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
Dae Hyun YUM, Jin Seok KIM, Pil Joong LEE, Sung Je HONG, "Fast Verification of Hash Chains with Reduced Storage" in IEICE TRANSACTIONS on Fundamentals,
vol. E94-A, no. 1, pp. 383-391, January 2011, doi: 10.1587/transfun.E94.A.383.
Abstract: A hash chain H for a hash function hash(·) is a sequence of hash values ⟨ xn, xn-1,..., x0 ⟩, where x0 is a secret value, xi is generated by xi = hash(xi-1) for 1 ≤ i ≤ n, and xn is a public value. Hash values of H are disclosed gradually from xn-1 to x0. The correctness of a disclosed hash value xi can be verified by checking the equation xn
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E94.A.383/_p
Copier
@ARTICLE{e94-a_1_383,
author={Dae Hyun YUM, Jin Seok KIM, Pil Joong LEE, Sung Je HONG, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Fast Verification of Hash Chains with Reduced Storage},
year={2011},
volume={E94-A},
number={1},
pages={383-391},
abstract={A hash chain H for a hash function hash(·) is a sequence of hash values ⟨ xn, xn-1,..., x0 ⟩, where x0 is a secret value, xi is generated by xi = hash(xi-1) for 1 ≤ i ≤ n, and xn is a public value. Hash values of H are disclosed gradually from xn-1 to x0. The correctness of a disclosed hash value xi can be verified by checking the equation xn
keywords={},
doi={10.1587/transfun.E94.A.383},
ISSN={1745-1337},
month={January},}
Copier
TY - JOUR
TI - Fast Verification of Hash Chains with Reduced Storage
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 383
EP - 391
AU - Dae Hyun YUM
AU - Jin Seok KIM
AU - Pil Joong LEE
AU - Sung Je HONG
PY - 2011
DO - 10.1587/transfun.E94.A.383
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E94-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2011
AB - A hash chain H for a hash function hash(·) is a sequence of hash values ⟨ xn, xn-1,..., x0 ⟩, where x0 is a secret value, xi is generated by xi = hash(xi-1) for 1 ≤ i ≤ n, and xn is a public value. Hash values of H are disclosed gradually from xn-1 to x0. The correctness of a disclosed hash value xi can be verified by checking the equation xn
ER -