Skip to main content

Timeline for Is there a standardized tree hash?

Current License: CC BY-SA 3.0

16 events
when toggle format what by license comment
Jan 9, 2020 at 22:32 answer added Jack O'Connor timeline score: 6
Nov 3, 2018 at 4:16 answer added Jack O'Connor timeline score: 3
Mar 4, 2017 at 14:53 vote accept Geoffrey Irving
Mar 4, 2017 at 14:06 answer added otus timeline score: 7
Mar 4, 2017 at 14:05 history edited otus
add tag
Feb 12, 2016 at 17:09 comment added David Cary Related: "Optimal Parameter Selection for Efficient Memory Integrity Verification Using Merkle Hash Trees".
Nov 9, 2015 at 22:51 comment added Maarten Bodewes @GeoffreyIrving I think tree hashing was included in some (/many?) of candidate designs for SHA-3 because there is no standard for tree hashing. It would not be required to include the tree hashing into the algorithm if there was.
Nov 9, 2015 at 14:35 comment added Geoffrey Irving Yeah, I think most of the SHA-3 proposals discuss trees, but I'm specifically looking for a standard version.
Nov 9, 2015 at 14:32 comment added Maarten Bodewes The Skein paper also describes the use of a hash tree, but I've forgotten if it specifies specific/default node sizes etc.
Nov 9, 2015 at 12:39 comment added CodesInChaos Tiger Tree Hash is probably the closest thing to a standard tree hash.
Nov 9, 2015 at 9:05 comment added otus csrc.nist.gov/groups/ST/hash/sha-3/Aug2014/documents/…
Nov 9, 2015 at 6:18 history tweeted twitter.com/StackCrypto/status/663601504725676034
Nov 9, 2015 at 6:02 comment added Richie Frame I think NIST is working on something as part of the SHA-3 process, but they do not have a draft yet
Nov 9, 2015 at 5:47 comment added Stephen Touset blake2b is probably along the lines of what you're looking for.
Nov 9, 2015 at 5:37 history edited otus CC BY-SA 3.0
edited tags; edited title
Nov 9, 2015 at 4:06 history asked Geoffrey Irving CC BY-SA 3.0