Public-Coin, Complexity-Preserving, Succinct Arguments of Knowledge for NP from Collision-Resistance

Cody Freitag; Omer Paneth; Rafael Pass

doi:10.1007/978-3-031-58737-5_5

Public-Coin, Complexity-Preserving, Succinct Arguments of Knowledge for NP from Collision-Resistance

Cody Freitag^*, Omer Paneth, Rafael Pass

^*Corresponding author for this work

School of Computer Science

Northeastern University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

Succinct arguments allow a powerful (yet polynomial-time) prover to convince a weak verifier of the validity of some NP statement using very little communication. A major barrier to the deployment of such proofs is the unwieldy overhead of the prover relative to the complexity of the statement to be proved. In this work, we focus on complexity-preserving arguments where proving a non-deterministic time t and space s RAM computation takes time O~(t) and space O~(s). Currently, all known complexity-preserving arguments either are private-coin, rely on non-standard assumptions, or provide only weak succinctness. In this work, we construct complexity-preserving succinct argument based solely on collision-resistant hash functions, thereby matching the classic succinct argument of Kilian (STOC ’92).

Original language	English
Title of host publication	Advances in Cryptology – EUROCRYPT 2024 - 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings
Editors	Marc Joye, Gregor Leander
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	112-141
Number of pages	30
ISBN (Print)	9783031587368
DOIs	https://doi.org/10.1007/978-3-031-58737-5_5
State	Published - 2024
Event	43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2024 - Zurich, Switzerland Duration: 26 May 2024 → 30 May 2024

Publication series

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

Conference

Conference	43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2024
Country/Territory	Switzerland
City	Zurich
Period	26/05/24 → 30/05/24

Funding

Funders	Funder number
Checkpoint Institute of Information Security
Blavatnik Foundation
Algorand Foundation
Defense Advanced Research Projects Agency	HR00110C0086
Defense Advanced Research Projects Agency
Air Force Office of Scientific Research	CNS-2128519, FA9550-18-1-0267, HR00112020023
Air Force Office of Scientific Research
National Science Foundation	DGE-2139899
National Science Foundation
Iowa Science Foundation	FA955023-1-0387, 1789/19, FA9550-23-1-0312, 2338/23
Iowa Science Foundation

Access to Document

10.1007/978-3-031-58737-5_5

Cite this

Freitag, C., Paneth, O., & Pass, R. (2024). Public-Coin, Complexity-Preserving, Succinct Arguments of Knowledge for NP from Collision-Resistance. In M. Joye, & G. Leander (Eds.), Advances in Cryptology – EUROCRYPT 2024 - 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (pp. 112-141). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 14654 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-58737-5_5

Freitag, Cody ; Paneth, Omer ; Pass, Rafael. / Public-Coin, Complexity-Preserving, Succinct Arguments of Knowledge for NP from Collision-Resistance. Advances in Cryptology – EUROCRYPT 2024 - 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. editor / Marc Joye ; Gregor Leander. Springer Science and Business Media Deutschland GmbH, 2024. pp. 112-141 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{63d0950282ea41148ac466fd1502c62c,

title = "Public-Coin, Complexity-Preserving, Succinct Arguments of Knowledge for NP from Collision-Resistance",

abstract = "Succinct arguments allow a powerful (yet polynomial-time) prover to convince a weak verifier of the validity of some NP statement using very little communication. A major barrier to the deployment of such proofs is the unwieldy overhead of the prover relative to the complexity of the statement to be proved. In this work, we focus on complexity-preserving arguments where proving a non-deterministic time t and space s RAM computation takes time O~(t) and space O~(s). Currently, all known complexity-preserving arguments either are private-coin, rely on non-standard assumptions, or provide only weak succinctness. In this work, we construct complexity-preserving succinct argument based solely on collision-resistant hash functions, thereby matching the classic succinct argument of Kilian (STOC {\textquoteright}92).",

author = "Cody Freitag and Omer Paneth and Rafael Pass",

note = "Publisher Copyright: {\textcopyright} The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.; 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2024 ; Conference date: 26-05-2024 Through 30-05-2024",

year = "2024",

doi = "10.1007/978-3-031-58737-5_5",

language = "אנגלית",

isbn = "9783031587368",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "112--141",

editor = "Marc Joye and Gregor Leander",

booktitle = "Advances in Cryptology – EUROCRYPT 2024 - 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings",

address = "גרמניה",

}

Freitag, C, Paneth, O & Pass, R 2024, Public-Coin, Complexity-Preserving, Succinct Arguments of Knowledge for NP from Collision-Resistance. in M Joye & G Leander (eds), Advances in Cryptology – EUROCRYPT 2024 - 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 14654 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 112-141, 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2024, Zurich, Switzerland, 26/05/24. https://doi.org/10.1007/978-3-031-58737-5_5

Public-Coin, Complexity-Preserving, Succinct Arguments of Knowledge for NP from Collision-Resistance. / Freitag, Cody; Paneth, Omer ; Pass, Rafael.
Advances in Cryptology – EUROCRYPT 2024 - 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. ed. / Marc Joye; Gregor Leander. Springer Science and Business Media Deutschland GmbH, 2024. p. 112-141 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 14654 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Public-Coin, Complexity-Preserving, Succinct Arguments of Knowledge for NP from Collision-Resistance

AU - Freitag, Cody

AU - Paneth, Omer

AU - Pass, Rafael

PY - 2024

Y1 - 2024

N2 - Succinct arguments allow a powerful (yet polynomial-time) prover to convince a weak verifier of the validity of some NP statement using very little communication. A major barrier to the deployment of such proofs is the unwieldy overhead of the prover relative to the complexity of the statement to be proved. In this work, we focus on complexity-preserving arguments where proving a non-deterministic time t and space s RAM computation takes time O~(t) and space O~(s). Currently, all known complexity-preserving arguments either are private-coin, rely on non-standard assumptions, or provide only weak succinctness. In this work, we construct complexity-preserving succinct argument based solely on collision-resistant hash functions, thereby matching the classic succinct argument of Kilian (STOC ’92).

AB - Succinct arguments allow a powerful (yet polynomial-time) prover to convince a weak verifier of the validity of some NP statement using very little communication. A major barrier to the deployment of such proofs is the unwieldy overhead of the prover relative to the complexity of the statement to be proved. In this work, we focus on complexity-preserving arguments where proving a non-deterministic time t and space s RAM computation takes time O~(t) and space O~(s). Currently, all known complexity-preserving arguments either are private-coin, rely on non-standard assumptions, or provide only weak succinctness. In this work, we construct complexity-preserving succinct argument based solely on collision-resistant hash functions, thereby matching the classic succinct argument of Kilian (STOC ’92).

UR - http://www.scopus.com/inward/record.url?scp=85192809156&partnerID=8YFLogxK

U2 - 10.1007/978-3-031-58737-5_5

DO - 10.1007/978-3-031-58737-5_5

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85192809156

SN - 9783031587368

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 112

EP - 141

BT - Advances in Cryptology – EUROCRYPT 2024 - 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings

A2 - Joye, Marc

A2 - Leander, Gregor

PB - Springer Science and Business Media Deutschland GmbH

T2 - 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2024

Y2 - 26 May 2024 through 30 May 2024

ER -

Freitag C, Paneth O , Pass R. Public-Coin, Complexity-Preserving, Succinct Arguments of Knowledge for NP from Collision-Resistance. In Joye M, Leander G, editors, Advances in Cryptology – EUROCRYPT 2024 - 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. Springer Science and Business Media Deutschland GmbH. 2024. p. 112-141. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-031-58737-5_5