Re:Show HN: Interactive implementation of the NIST Blockchai...
by aeijdenberg on Monday November 05, 2018 @03:23AM
(#18380731)
Not quite as simple as a cryptographic hash alone - remember that if the set of possible inputs can be easily enumerated, then it's trivial to find the input data by brute force.
There are ways to work around this, for example objecthash[0] describes a small modification that prepends the input data with 32 bytes of random data before hashing in order to prevent this.
Re:Show HN: Interactive implementation of the NIST Blockchai...
by randaouser on Thursday November 08, 2018 @12:00AM
(#18404414)
yes precisely, you must include a random value that remains secret until the appropriate reveal time.
Re:Show HN: Interactive implementation of the NIST Blockchai...
by ketzu on Monday November 05, 2018 @07:18AM
(#18381710)
One problem of this solution is you can not verify the write in the first place, as the encrypted data is no longer publicly verifiable.
Re:Show HN: Interactive implementation of the NIST Blockchai...
by randaouser on Thursday November 08, 2018 @12:01AM
(#18404421)
you can share the encrypted data and allow anyone to perform the block hash of the file. As the data is encrypted it should be publicly accessible. EDIT
yes the data itself becomes difficult to verify. Then you must move towards are for more complicated ZKSnark or Homomorphic scheme
The senstivity issue can be overcome by submitting a cryptographic hash of the information (say sha256) and storing the encrypted data on ipfs. In future audits, one can reveal the unencrypted data and ensure the hashes match.