Timeline for Verify partial message given hash of full message
Current License: CC BY-SA 4.0
25 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 5, 2021 at 17:14 | comment | added | A. Hersean | @kelalaka I know of the version history of this question. But the other readers might not notice it, and as the question is written now, this answer isn't adequate. A disclaimer at its top might help to give context. | |
| Jan 5, 2021 at 17:10 | comment | added | kelalaka | @A.Hersean That is true and still not accepted by the OP!. If the OP was clear from the beginning about O(1). Then we will have only the other answer. So this answer is correct in the sense of this version. Therefore we have two valid answers. | |
| Jan 5, 2021 at 17:01 | comment | added | A. Hersean | Moreover, the real answer (given below) is that this problem cannot be solved in O(1). | |
| Jan 5, 2021 at 16:49 | comment | added | A. Hersean | @kelalaka (I read the archived discussion.) Even though merkle trees are a solution, I fail to see why in this particular use case they are better suited than sending a CRC-32 (or SHA-256) with each chunk. (In case of CRC-32, a final SHA-256 of the total downloaded data can be sent.) | |
| Jan 5, 2021 at 16:08 | comment | added | kelalaka | @A.Hersean I think your judgment is not totally correct. The answer is here because the real practical solution for the OP is this. | |
| Jan 5, 2021 at 15:52 | comment | added | A. Hersean | Downvoted because even though it is an excellent explanation of Merkle trees, it does not answer the question adequately. However, I upvoted your 2nd answer. | |
| Jun 16, 2019 at 13:54 | history | edited | Squeamish Ossifrage | CC BY-SA 4.0 |
Put one parenthesis in the right place; deparenthesize another.
|
| Jun 16, 2019 at 13:43 | history | edited | Squeamish Ossifrage | CC BY-SA 4.0 |
Add another exercise. Format exercises in a list.
|
| Jun 16, 2019 at 3:23 | history | edited | Squeamish Ossifrage | CC BY-SA 4.0 |
Clarify the cost estimates.
|
| Jun 15, 2019 at 16:07 | history | edited | Squeamish Ossifrage | CC BY-SA 4.0 |
Give quantitative details of transmission costs for realistic parameter sizes.
|
| S Jun 15, 2019 at 14:59 | history | mod moved comments to chat | |||
| S Jun 15, 2019 at 14:59 | comment | added | Ella Rose | Comments are not for extended discussion; this conversation has been moved to chat. | |
| Jun 15, 2019 at 14:25 | history | edited | Squeamish Ossifrage | CC BY-SA 4.0 |
Elaborate on storage and transmission overhead.
|
| Jun 15, 2019 at 13:16 | history | edited | Squeamish Ossifrage | CC BY-SA 4.0 |
Expand into considerably more detail.
|
| Jun 15, 2019 at 13:11 | history | edited | Squeamish Ossifrage | CC BY-SA 4.0 |
Expand into considerably more detail.
|
| Jun 15, 2019 at 4:15 | history | edited | Squeamish Ossifrage | CC BY-SA 4.0 |
Elaborate on the example and fix an index.
|
| Jun 15, 2019 at 4:08 | history | rollback | Squeamish Ossifrage |
Rollback to Revision 7
|
|
| Jun 15, 2019 at 3:58 | history | edited | Squeamish Ossifrage | CC BY-SA 4.0 |
No toggle for what we _can_ compute from $c'_i$.
|
| Jun 15, 2019 at 3:48 | history | edited | Squeamish Ossifrage | CC BY-SA 4.0 |
Fix indexing errors and clarify what the protocol is.
|
| Jun 15, 2019 at 3:20 | history | edited | Squeamish Ossifrage | CC BY-SA 4.0 |
Missed a factor of log_2 r.
|
| Jun 15, 2019 at 3:12 | history | edited | Squeamish Ossifrage | CC BY-SA 4.0 |
Clarify the diagram a little.
|
| Jun 14, 2019 at 19:27 | history | edited | Squeamish Ossifrage | CC BY-SA 4.0 |
\ell is already \log_2 of the length in chunks; get the logarithms straight.
|
| Jun 14, 2019 at 17:01 | history | edited | Squeamish Ossifrage | CC BY-SA 4.0 |
Fix some fenceposts. Index the span as well as the depth.
|
| Jun 14, 2019 at 16:45 | history | edited | Squeamish Ossifrage | CC BY-SA 4.0 |
Give some more exercises.
|
| Jun 14, 2019 at 16:34 | history | answered | Squeamish Ossifrage | CC BY-SA 4.0 |