Security Analysis and Improvements on a Remote Integrity Checking Scheme for Regenerating-Coding-Based Distributed Storage

<div>Repairing a failed node [<a href="/journals/scn/2021/6652606/#B19">19</a>]: the original file consists of four blocks—<span class="nowrap"><svg height="10.2124pt" id="M32" style="vertical-align:-1.576501pt" version="1.1" viewbox="-0.0498162 -8.6359 36.1402 10.2124" width="36.1402pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M686 28C612 35 607 44 591 112C563 234 541 360 519 489L489 666L457 658L147 121C100 40 89 36 24 28L17 0H240L250 28C168 34 159 41 190 101L262 237H482C495 180 503 137 510 91C517 47 514 35 441 28L433 0H677L686 28ZM475 280H285L429 541H431L475 280Z"></path></g><g transform="matrix(.013,0,0,-0.013,9.135,0)"><path d="M95 130C70 130 46 113 46 88C46 72 54 64 59 64C93 55 121 33 121 -3C121 -41 93 -68 44 -88L55 -117C117 -98 186 -56 186 22C186 91 131 130 95 130Z"></path></g><g transform="matrix(.013,0,0,-0.013,14.278,0)"><path d="M578 512C578 619 494 650 387 650H140L134 622C219 615 223 609 210 542L127 119C112 40 104 34 23 28L17 0H235C317 0 387 7 444 33C515 65 564 122 564 195C564 289 495 335 412 352V354C505 373 578 422 578 512ZM486 510C486 422 423 367 314 367H257L294 565C299 591 305 602 315 608C324 614 339 617 362 617C421 617 486 595 486 510ZM466 200C466 100 393 35 296 35C222 35 198 51 212 127L250 333H303C388 333 466 303 466 200Z"></path></g><g transform="matrix(.013,0,0,-0.013,22.091,0)"><path d="M95 130C70 130 46 113 46 88C46 72 54 64 59 64C93 55 121 33 121 -3C121 -41 93 -68 44 -88L55 -117C117 -98 186 -56 186 22C186 91 131 130 95 130Z"></path></g><g transform="matrix(.013,0,0,-0.013,27.234,0)"><path d="M645 631C614 643 545 666 457 666C215 666 23 519 23 283C23 90 158 -16 337 -16C412 -16 489 2 522 10C543 39 590 127 606 167L580 181C519 89 459 18 348 18C201 18 122 136 122 287C122 464 244 632 435 632C544 632 602 595 608 472L639 475C643 526 645 581 645 631Z"></path></g></svg>,</span> and <span class="nowrap"><svg height="8.68572pt" id="M33" style="vertical-align:-0.0498209pt" version="1.1" viewbox="-0.0498162 -8.6359 10.095 8.68572" width="10.095pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M743 375C743 570 607 650 407 650H136L130 622C214 612 220 606 204 526L125 122C110 43 105 36 24 27L17 0H250C382 0 482 23 571 76C680 141 743 248 743 375ZM644 379C644 188 520 36 305 36C277 36 249 38 229 46C205 55 202 71 212 126L293 553C300 588 306 600 317 606C330 613 356 617 390 617C547 617 644 537 644 379Z"></path></g></svg>.</span> A (4, 2) MDS (maximum distance separable) code is applied such that any two healthy nodes can restore the original file while the repair bandwidth is 1 for each helper node. The repair involves combining blocks and the total repair bandwidth consisting of 3 blocks instead of 4, where 4 is the amount of blocks needed to reconstruct the whole file.</div>

Security and Communication Networks

fig2

Figure 2

Figure 2: Security Analysis and Improvements on a Remote Integrity Checking Scheme for Regenerating-Coding-Based Distributed Storage 