Loading [a11y]/accessibility-menu.js
Polar Coded Merkle Tree: Improved Detection of Data Availability Attacks in Blockchain Systems | IEEE Conference Publication | IEEE Xplore

Polar Coded Merkle Tree: Improved Detection of Data Availability Attacks in Blockchain Systems


Abstract:

Light nodes in blockchain systems are known to be vulnerable to data availability (DA) attacks where they accept an invalid block with unavailable portions. Previous work...Show More

Abstract:

Light nodes in blockchain systems are known to be vulnerable to data availability (DA) attacks where they accept an invalid block with unavailable portions. Previous works have used LDPC and 2-D Reed Solomon (2D-RS) codes with Merkle Trees to mitigate DA attacks. While these codes have demonstrated improved performance across a variety of metrics such as DA detection probability, they are difficult to apply to blockchains with large blocks due to generally intractable code guarantees for large codelengths (LDPC), large decoding complexity (2D-RS), or large coding fraud proof sizes (2D-RS). We address these issues by proposing the novel Polar Coded Merkle Tree (PCMT) which is a Merkle Tree built from the encoding graphs of polar codes and a specialized polar code construction called Sampling-Efficient Freezing (SEF). We demonstrate that the PCMT with SEF polar codes performs well in detecting DA attacks for large block sizes.
Date of Conference: 26 June 2022 - 01 July 2022
Date Added to IEEE Xplore: 03 August 2022
ISBN Information:

ISSN Information:

Conference Location: Espoo, Finland

Contact IEEE to Subscribe

References

References is not available for this document.