Welcome to the resource topic for 2024/1212
Title:
Efficient Layered Circuit for Verification of SHA3 Merkle Tree
Authors: CHANGCHANG DING, Zheming Fu
Abstract:We present an efficient layered circuit design for SHA3-256 Merkle tree verification, suitable for a GKR proof system, that achieves logarithmic verification and proof size. We demonstrate how to compute the predicate functions for our circuit in O(\log n) time to ensure logarithmic verification and provide GKR benchmarks for our circuit.
ePrint: https://eprint.iacr.org/2024/1212
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .