Nothing Special   »   [go: up one dir, main page]
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Logic in Computer Science

arXiv:2311.08858 (cs)
[Submitted on 15 Nov 2023]

Title:Formal Verification of Zero-Knowledge Circuits

Authors:Alessandro Coglio (Kestrel Institute and Aleo Systems Inc.), Eric McCarthy (Kestrel Institute and Aleo Systems Inc.), Eric W. Smith (Kestrel Institute)
View PDF
Abstract:Zero-knowledge circuits are sets of equality constraints over arithmetic expressions interpreted in a prime field; they are used to encode computations in cryptographic zero-knowledge proofs. We make the following contributions to the problem of ensuring that a circuit correctly encodes a computation: a formal framework for circuit correctness; an ACL2 library for prime fields; an ACL2 model of the existing R1CS (Rank-1 Constraint Systems) formalism to represent circuits, along with ACL2 and Axe tools to verify circuits of this form; a novel PFCS (Prime Field Constraint Systems) formalism to represent hierarchically structured circuits, along with an ACL2 model of it and ACL2 tools to verify circuits of this form in a compositional and scalable way; verification of circuits, ranging from simple to complex; and discovery of bugs and optimizations in existing zero-knowledge systems.
Comments: In Proceedings ACL2-2023, arXiv:2311.08373
Subjects: Logic in Computer Science (cs.LO); Cryptography and Security (cs.CR); Symbolic Computation (cs.SC)
Cite as: arXiv:2311.08858 [cs.LO]
  (or arXiv:2311.08858v1 [cs.LO] for this version)
  https://doi.org/10.48550/arXiv.2311.08858
Journal reference: EPTCS 393, 2023, pp. 94-112
Related DOI: https://doi.org/10.4204/EPTCS.393.9

Submission history

From: EPTCS [view email] [via EPTCS proxy]
[v1] Wed, 15 Nov 2023 10:47:28 UTC (32 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
cs.LO
< prev   |   next >
new | recent | 2023-11
Change to browse by:
cs
cs.CR
cs.SC

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)