Welcome to the resource topic for 2024/954
Title:
Arithmetisation of computation via polynomial semantics for first-order logic
Authors: Murdoch J. Gabbay
Abstract:We propose a compositional shallow translation from a first-order logic with equality, into polynomials; that is, we arithmetise the semantics of first-order logic. Using this, we can translate specifications of mathematically structured programming into polynomials, in a form amenable to succinct cryptographic verification.
We give worked example applications, and we propose a proof-of-concept succinct verification scheme based on inner product arguments.
ePrint: https://eprint.iacr.org/2024/954
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 .