Short Paper: Naysayer Proofs

István András Seres, Noemi Glaeser, Joseph Bonneau

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This work introduces the notion of naysayer proofs. We observe that in numerous (zero-knowledge) proof systems, it is significantly more efficient for the verifier to be convinced by a so-called naysayer that a false proof is invalid than it is to check that a genuine proof is valid. We show that every NP language has logarithmic size and constant-time naysayer proofs. We also show practical constructions for several example proof systems, including FRI polynomial commitments, post-quantum secure digital signatures, and verifiable shuffles. Naysayer proofs enable an interesting new optimistic verification mode potentially suitable for resource-constrained verifiers, such as smart contracts.

Original languageEnglish (US)
Title of host publicationFinancial Cryptography and Data Security - 28th International Conference, FC 2024, Revised Selected Papers
EditorsJeremy Clark, Elaine Shi
PublisherSpringer Science and Business Media Deutschland GmbH
Pages22-32
Number of pages11
ISBN (Print)9783031786785
DOIs
StatePublished - 2025
Event28th International Conference on Financial Cryptography and Data Security, FC 2024 - Willemstad, Netherlands
Duration: Mar 4 2024Mar 8 2024

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume14745 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference28th International Conference on Financial Cryptography and Data Security, FC 2024
Country/TerritoryNetherlands
CityWillemstad
Period3/4/243/8/24

Keywords

  • blockchain
  • proof system
  • smart contract
  • soundness
  • zero-knowledge

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Short Paper: Naysayer Proofs'. Together they form a unique fingerprint.

Cite this