Formal Verification of Zero-Knowledge Circuits

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 computatio...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2023-11
Hauptverfasser:	Coglio, Alessandro, McCarthy, Eric, Smith, Eric W
Format:	Artikel
Sprache:	eng
Schlagworte:	Circuits Computer Science - Cryptography and Security Computer Science - Logic in Computer Science Computer Science - Symbolic Computation Constraint modelling Cryptography Formalism Verification
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!