Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
PayWord and MicroMint: Two Simple Micropayment Schemes
Proceedings of the International Workshop on Security Protocols
NetCard - A Practical Electronic-Cash System
Proceedings of the International Workshop on Security Protocols
Fair On-Line Auctions without Special Trusted Parties
FC '99 Proceedings of the Third International Conference on Financial Cryptography
Efficient Authentication and Signing of Multicast Streams over Lossy Channels
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
Ariadne: a secure on-demand routing protocol for ad hoc networks
Wireless Networks
Single-Layer Fractal Hash Chain Traversal with Almost Optimal Complexity
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
Almost optimal hash sequence traversal
FC'02 Proceedings of the 6th international conference on Financial cryptography
BBox: a distributed secure log architecture
EuroPKI'10 Proceedings of the 7th European conference on Public key infrastructures, services and applications
| Hi-index | 0.00 |
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 $x_n \stackrel{?}{=} {\mathsf{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 xn, 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.