Academic Journal
Προβολή σε EDS

Bounded verification for finite-field-blasting in a compiler for zero knowledge proofs.

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος: Bounded verification for finite-field-blasting in a compiler for zero knowledge proofs.
Συγγραφείς: Ozdemir, Alex, Wahby, Riad S., Brown, Fraser, Barrett, Clark
Πηγή: Formal Methods in System Design; Nov2025, Vol. 67 Issue 2, p161-188, 28p
Θεματικοί όροι: Finite fields, Compilers (Computer programs), Software validation, Encryption protocols
Περίληψη: Zero Knowledge Proofs (ZKPs) are cryptographic protocols by which a prover convinces a verifier of the truth of a statement without revealing any other information. Typically, statements are expressed in a high-level language and then compiled to a low-level representation on which the ZKP operates. Thus, a bug in a ZKP compiler can compromise the statement that the ZK proof is supposed to establish. This paper takes a step towards ZKP compiler correctness by partially verifying a field-blasting compiler pass, a pass that translates Boolean and bit-vector logic into equivalent operations in a finite field. First, we define correctness for field-blasters and ZKP compilers more generally. Next, we describe the specific field-blaster using a set of encoding rules and define verification conditions for individual rules. Finally, we connect the rules and the correctness definition by showing that if our verification conditions hold, the field-blaster is correct. We have implemented our approach in the CirC ZKP compiler and have proved bounded versions of the corresponding verification conditions using an SMT solver. We show that our partially verified field-blaster does not hurt the performance of the compiler or its output; we also report on four bugs uncovered during verification. [ABSTRACT FROM AUTHOR]
Copyright of Formal Methods in System Design is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Βάση Δεδομένων: Complementary Index
FullText Text:
  Availability: 0
Header DbId: edb
DbLabel: Complementary Index
An: 189134716
RelevancyScore: 1023
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 1023.09326171875
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Bounded verification for finite-field-blasting in a compiler for zero knowledge proofs.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Ozdemir%2C+Alex%22">Ozdemir, Alex</searchLink><br /><searchLink fieldCode="AR" term="%22Wahby%2C+Riad+S%2E%22">Wahby, Riad S.</searchLink><br /><searchLink fieldCode="AR" term="%22Brown%2C+Fraser%22">Brown, Fraser</searchLink><br /><searchLink fieldCode="AR" term="%22Barrett%2C+Clark%22">Barrett, Clark</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: Formal Methods in System Design; Nov2025, Vol. 67 Issue 2, p161-188, 28p
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Finite+fields%22">Finite fields</searchLink><br /><searchLink fieldCode="DE" term="%22Compilers+%28Computer+programs%29%22">Compilers (Computer programs)</searchLink><br /><searchLink fieldCode="DE" term="%22Software+validation%22">Software validation</searchLink><br /><searchLink fieldCode="DE" term="%22Encryption+protocols%22">Encryption protocols</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Zero Knowledge Proofs (ZKPs) are cryptographic protocols by which a prover convinces a verifier of the truth of a statement without revealing any other information. Typically, statements are expressed in a high-level language and then compiled to a low-level representation on which the ZKP operates. Thus, a bug in a ZKP compiler can compromise the statement that the ZK proof is supposed to establish. This paper takes a step towards ZKP compiler correctness by partially verifying a field-blasting compiler pass, a pass that translates Boolean and bit-vector logic into equivalent operations in a finite field. First, we define correctness for field-blasters and ZKP compilers more generally. Next, we describe the specific field-blaster using a set of encoding rules and define verification conditions for individual rules. Finally, we connect the rules and the correctness definition by showing that if our verification conditions hold, the field-blaster is correct. We have implemented our approach in the CirC ZKP compiler and have proved bounded versions of the corresponding verification conditions using an SMT solver. We show that our partially verified field-blaster does not hurt the performance of the compiler or its output; we also report on four bugs uncovered during verification. [ABSTRACT FROM AUTHOR]
– Name: Abstract
  Label:
  Group: Ab
  Data: <i>Copyright of Formal Methods in System Design is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edb&AN=189134716
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s10703-025-00476-3
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 28
        StartPage: 161
    Subjects:
      – SubjectFull: Finite fields
        Type: general
      – SubjectFull: Compilers (Computer programs)
        Type: general
      – SubjectFull: Software validation
        Type: general
      – SubjectFull: Encryption protocols
        Type: general
    Titles:
      – TitleFull: Bounded verification for finite-field-blasting in a compiler for zero knowledge proofs.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Ozdemir, Alex
      – PersonEntity:
          Name:
            NameFull: Wahby, Riad S.
      – PersonEntity:
          Name:
            NameFull: Brown, Fraser
      – PersonEntity:
          Name:
            NameFull: Barrett, Clark
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 11
              Text: Nov2025
              Type: published
              Y: 2025
          Identifiers:
            – Type: issn-print
              Value: 09259856
          Numbering:
            – Type: volume
              Value: 67
            – Type: issue
              Value: 2
          Titles:
            – TitleFull: Formal Methods in System Design
              Type: main
ResultId 1