From cc6cf3f6176ecc7bf1ca8af22a9756f76c593ca4 Mon Sep 17 00:00:00 2001 From: Dmitriy Ryajov Date: Mon, 9 May 2022 17:23:30 -0600 Subject: [PATCH] fixed wording on observation --- papers/Compact_Proofs_of_Retrievability/README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/papers/Compact_Proofs_of_Retrievability/README.md b/papers/Compact_Proofs_of_Retrievability/README.md index 6def171..78d2f71 100644 --- a/papers/Compact_Proofs_of_Retrievability/README.md +++ b/papers/Compact_Proofs_of_Retrievability/README.md @@ -29,7 +29,7 @@ The paper introduces two types of schemes - public and private. In the private s ### Observations -- Both the data and the tags are employed in the generation and verification of the proof, which guarantees that the original data was used in the generation of the proof. This solves the pre-image attack that other schemes are susceptible to. +- Both the original data and the tags are employed in the generation and verification of the proof, which prevents pre-image attack that other schemes are susceptible to. - It potentially achieves a level of compression where at most one block worth of data and one cryptographic tag is ever needed to be sent across the network. - The erasure coding solves several concurrent issues. With an MDS erasure code and a coding ratio of 1 (K=M) - It is only necessary to prove that %50 of all the blocks are in place, this lowers the amount of data needed to be sampled making it constant for datasets of any size