RAMenPaSTA: Parallelizable Scalable Transparent Arguments of Knowledge for RAM Programs

ePrint Report: RAMenPaSTA: Parallelizable Scalable Transparent Arguments of Knowledge for RAM Programs

Khai Hanh Tang, Minh Pham, Chan Nam Ngo

Incremental Verifiable Computation (IVC) allows a prover to prove to a verifier the correct execution of a sequential computation. Recent works focus on improving the universality and efficiency of IVC Schemes, which can be categorized into Accumulation and Folding-based IVCs with Folding-based ones being more efficient (due to their deferred proof generation until the final step). Unfortunately, both approaches satisfy …

computation efficiency eprint report focus knowledge ngo prove report tang