2014•Unpublished venueOpen access
Efficient Construction of Infinite Length Hash Chains with Perfect Forward Secrecy Using Two Independent Hash Functions
Sebastian Bittl
Open full text 14 citations
Abstract
213
Sebastian Bittl
Abstract
213
OpenAlex reports 14 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
213
Key concepts: Hash function, Computer science, Secrecy, Hash chain, Double hashing, Cryptographic hash function, Theoretical computer science, Computer security