Practical Proofs of Parsing for Context-free Grammars

ePrint Report: Practical Proofs of Parsing for Context-free Grammars

Harjasleen Malvai, Gregory Neven, Andrew Miller, Siam Hussain

In this work-in-progress, we present a series of protocols to efficiently prove statements about strings in context-free grammars (CFGs). Our main protocol for proving proofs of correct parsing for strings in a CFG flexibly accommodates different instantiations of zero-knowledge proof systems as well as accumulation schemes. While improvements in the modular cryptographic primitives can be carried over for improvements in our protocols, even …

context eprint report free main miller parsing progress protocol protocols prove report series strings work