Cryptography, Volume 8, Issue 3
2024 September - 17 articles
Cover Story: The hash value of every node depends on the hash values of its children and next nodes (dashed lines). Nodes must be constructed sequentially (from the last to the first) by the Prover. After receiving the hash value of the root node, the Verifier selects a leaf node, say node 12, and the hash values of the colored nodes are transmitted by the Prover so that the hash values of the red nodes can be recomputed without additional knowledge on the hashcash tree. View this paper
- Issues are regarded as officially published after their release is announced to the table of contents alert mailing list .
- You may sign up for email alerts to receive table of contents of newly released issues.
- PDF is the official format for papers published in both, html and pdf forms. To view the papers in pdf format, click on the "PDF Full-text" link, and use the free Adobe Reader to open them.
Articles
There are no articles in this issue yet.
Cryptography - ISSN 2410-387X