Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yum, Dae Hyun | - |
dc.contributor.author | Seo, Jae Woo | - |
dc.contributor.author | Cho, Kookrae | - |
dc.contributor.author | Lee, Pil Joong | - |
dc.date.available | 2017-07-11T07:12:15Z | - |
dc.date.created | 2017-04-10 | - |
dc.date.issued | 2010-05 | - |
dc.identifier.issn | 0916-8532 | - |
dc.identifier.uri | http://hdl.handle.net/20.500.11750/3525 | - |
dc.description.abstract | A hash chain H for a one-way hash function h(·) is a sequence of hash values >v0, vi, ⋯ , vn<, where v0 is a public value, vn a secret value, and vi = h(vi+1). A hash chain traversal algorithm T computes and outputs the hash chain H, returning vi in time period (called round) i for 1 ≤ i ≤ n. While previous hash chain traversal algorithms were designed to output all hash values vi (1 ≤ i ≤ n) in order, there are applications where every m-th hash value (i.e., vm, v2m, v3m, ⋯) is required to be output. We introduce a hash chain traversal algorithm that selectively outputs every m-th hash value efficiently. The main technique is a transformation from a hash chain traversal algorithm outputting every hash value into that outputting every m-th hash value. Compared with the direct use of previous hash chain traversal algorithms, our proposed method requires less memory storages and computational costs. Copyright © 2010 The Institute of Electronics, Information and Communication Engineers. | - |
dc.publisher | Institute of Electronics, Information and Communication Engineers | - |
dc.title | Generalized Hash Chain Traversal with Selective Output | - |
dc.type | Article | - |
dc.identifier.doi | 10.1587/transinf.E93.D.1303 | - |
dc.identifier.wosid | 000279136500042 | - |
dc.identifier.scopusid | 2-s2.0-77951832851 | - |
dc.identifier.bibliographicCitation | IEICE Transactions on Information and Systems, v.E93D, no.5, pp.1303 - 1306 | - |
dc.subject.keywordAuthor | hash chain | - |
dc.subject.keywordAuthor | fractal traversal | - |
dc.subject.keywordAuthor | amortization | - |
dc.subject.keywordPlus | Amortization | - |
dc.subject.keywordPlus | Computational Costs | - |
dc.subject.keywordPlus | Depreciation | - |
dc.subject.keywordPlus | Direct Use | - |
dc.subject.keywordPlus | Fractal Traversal | - |
dc.subject.keywordPlus | Fractals | - |
dc.subject.keywordPlus | Hash Chain | - |
dc.subject.keywordPlus | Hash Chain Traversal | - |
dc.subject.keywordPlus | Hash Chains | - |
dc.subject.keywordPlus | Hash Functions | - |
dc.subject.keywordPlus | Hash Value | - |
dc.subject.keywordPlus | Memory Storage | - |
dc.subject.keywordPlus | One Way Hash Functions | - |
dc.subject.keywordPlus | Public Values | - |
dc.subject.keywordPlus | Secret Value | - |
dc.subject.keywordPlus | Time Periods | - |
dc.citation.endPage | 1306 | - |
dc.citation.number | 5 | - |
dc.citation.startPage | 1303 | - |
dc.citation.title | IEICE Transactions on Information and Systems | - |
dc.citation.volume | E93D | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems; Computer Science, Software Engineering | - |
dc.type.docType | Article | - |
There are no files associated with this item.