DC Field | Value | Language |
---|---|---|
dc.contributor.author | Dea Hyun Yum | - |
dc.contributor.author | Jin Seok Kim | - |
dc.contributor.author | Lee, PJ | - |
dc.contributor.author | Hong, SJ | - |
dc.date.accessioned | 2016-04-01T02:25:59Z | - |
dc.date.available | 2016-04-01T02:25:59Z | - |
dc.date.created | 2011-09-20 | - |
dc.date.issued | 2011-01 | - |
dc.identifier.issn | 0916-8508 | - |
dc.identifier.other | 2011-OAK-0000022739 | - |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/25120 | - |
dc.description.abstract | A hash chain H for a hash function hash(.) is a sequence of hash values < x(n), x(n-1), ..., x(0)>, where x(0) is a secret value, x(i) is generated by x(i) = hash(x(i-1)) for 1 <= i <= n, and x(n) is a public value. Hash values of H are disclosed gradually from x(n-1) to x(0). The correctness of a disclosed hash value x(i) can be verified by checking the equation x(n) =(?) hash(n-i)(x(i)). To speed up the verification, Fischlin introduced a check-bit scheme at CT-RSA 2004. The basic idea of the check-bit scheme is to output some extra information cb, called a check-bit vector, in addition to the public value x(n), which allows each verifier to perform only a fraction of the original work according to his or her own security level. We revisit the Fischlin's check-bit scheme and show that the length of the check-bit vector cb can be reduced nearly by half. The reduced length of cb is close to the theoretic lower bound. | - |
dc.description.statementofresponsibility | X | - |
dc.language | English | - |
dc.publisher | IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG | - |
dc.relation.isPartOf | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES | - |
dc.title | Fast Verification of Hash Chains with Reduced Storage | - |
dc.type | Article | - |
dc.contributor.college | 전자전기공학과 | - |
dc.identifier.doi | 10.1587/TRANSFUN.E94.A.383 | - |
dc.author.google | Yum D.H., Kim J.S., Lee P.J., Hong S.J. | - |
dc.relation.volume | E94A | - |
dc.relation.issue | 1 | - |
dc.relation.startpage | 383 | - |
dc.relation.lastpage | 391 | - |
dc.contributor.id | 10051689 | - |
dc.relation.journal | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences | - |
dc.relation.index | SCI급, SCOPUS 등재논문 | - |
dc.relation.sci | SCIE | - |
dc.collections.name | Journal Papers | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, v.E94A, no.1, pp.383 - 391 | - |
dc.identifier.wosid | 000293818300043 | - |
dc.date.tcdate | 2019-02-01 | - |
dc.citation.endPage | 391 | - |
dc.citation.number | 1 | - |
dc.citation.startPage | 383 | - |
dc.citation.title | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES | - |
dc.citation.volume | E94A | - |
dc.contributor.affiliatedAuthor | Lee, PJ | - |
dc.contributor.affiliatedAuthor | Hong, SJ | - |
dc.identifier.scopusid | 2-s2.0-78650946493 | - |
dc.description.journalClass | 1 | - |
dc.description.journalClass | 1 | - |
dc.description.wostc | 1 | - |
dc.description.scptc | 1 | * |
dc.date.scptcdate | 2018-05-121 | * |
dc.type.docType | Article | - |
dc.subject.keywordAuthor | hash chain | - |
dc.subject.keywordAuthor | progressive verification | - |
dc.subject.keywordAuthor | check-bit scheme | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Hardware & Architecture | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
library@postech.ac.kr Tel: 054-279-2548
Copyrights © by 2017 Pohang University of Science ad Technology All right reserved.