Limits on Revocable Proof Systems, With Implications for Stateless Blockchains

Miranda Christ; Joseph Bonneau

doi:10.1007/978-3-031-47751-5_4

Limits on Revocable Proof Systems, With Implications for Stateless Blockchains

Miranda Christ, Joseph Bonneau

Computer Science

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

Abstract

Motivated by the goal of building a cryptocurrency with succinct global state, we introduce the abstract notion of a revocable proof system. We prove an information-theoretic result on the relation between global state size and the required number of local proof updates as statements are revoked (e.g., coins are spent). We apply our result to conclude that there is no useful trade-off point when building a stateless cryptocurrency: the system must either have a linear-sized global state (in the number of accounts in the system) or require a near-linear rate of local proof updates. The notion of a revocable proof system is quite general and also provides new lower bounds for set commitments, vector commitments and authenticated dictionaries.

Original language	English (US)
Title of host publication	Financial Cryptography and Data Security - 27th International Conference, FC 2023, Revised Selected Papers
Editors	Foteini Baldimtsi, Christian Cachin
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	54-71
Number of pages	18
ISBN (Print)	9783031477508
DOIs	https://doi.org/10.1007/978-3-031-47751-5_4
State	Published - 2024
Event	27th International Conference on Financial Cryptography and Data Security, FC 2023 - Bol, Croatia Duration: May 1 2023 → May 5 2023

Publication series

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

Conference

Conference	27th International Conference on Financial Cryptography and Data Security, FC 2023
Country/Territory	Croatia
City	Bol
Period	5/1/23 → 5/5/23

Keywords

Authenticated Data Structures
Stateless Blockchains

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-031-47751-5_4

Cite this

Christ, M., & Bonneau, J. (2024). Limits on Revocable Proof Systems, With Implications for Stateless Blockchains. In F. Baldimtsi, & C. Cachin (Eds.), Financial Cryptography and Data Security - 27th International Conference, FC 2023, Revised Selected Papers (pp. 54-71). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13951). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-47751-5_4

Limits on Revocable Proof Systems, With Implications for Stateless Blockchains. / Christ, Miranda; Bonneau, Joseph.
Financial Cryptography and Data Security - 27th International Conference, FC 2023, Revised Selected Papers. ed. / Foteini Baldimtsi; Christian Cachin. Springer Science and Business Media Deutschland GmbH, 2024. p. 54-71 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13951).

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

Christ, M & Bonneau, J 2024, Limits on Revocable Proof Systems, With Implications for Stateless Blockchains. in F Baldimtsi & C Cachin (eds), Financial Cryptography and Data Security - 27th International Conference, FC 2023, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 13951, Springer Science and Business Media Deutschland GmbH, pp. 54-71, 27th International Conference on Financial Cryptography and Data Security, FC 2023, Bol, Croatia, 5/1/23. https://doi.org/10.1007/978-3-031-47751-5_4

Christ M, Bonneau J. Limits on Revocable Proof Systems, With Implications for Stateless Blockchains. In Baldimtsi F, Cachin C, editors, Financial Cryptography and Data Security - 27th International Conference, FC 2023, Revised Selected Papers. Springer Science and Business Media Deutschland GmbH. 2024. p. 54-71. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-031-47751-5_4

Christ, Miranda ; Bonneau, Joseph. / Limits on Revocable Proof Systems, With Implications for Stateless Blockchains. Financial Cryptography and Data Security - 27th International Conference, FC 2023, Revised Selected Papers. editor / Foteini Baldimtsi ; Christian Cachin. Springer Science and Business Media Deutschland GmbH, 2024. pp. 54-71 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{1566256d1be5484bbd3cdb9efdace28f,

title = "Limits on Revocable Proof Systems, With Implications for Stateless Blockchains",

abstract = "Motivated by the goal of building a cryptocurrency with succinct global state, we introduce the abstract notion of a revocable proof system. We prove an information-theoretic result on the relation between global state size and the required number of local proof updates as statements are revoked (e.g., coins are spent). We apply our result to conclude that there is no useful trade-off point when building a stateless cryptocurrency: the system must either have a linear-sized global state (in the number of accounts in the system) or require a near-linear rate of local proof updates. The notion of a revocable proof system is quite general and also provides new lower bounds for set commitments, vector commitments and authenticated dictionaries.",

keywords = "Authenticated Data Structures, Stateless Blockchains",

author = "Miranda Christ and Joseph Bonneau",

note = "Publisher Copyright: {\textcopyright} 2024, International Financial Cryptography Association.; 27th International Conference on Financial Cryptography and Data Security, FC 2023 ; Conference date: 01-05-2023 Through 05-05-2023",

year = "2024",

doi = "10.1007/978-3-031-47751-5_4",

language = "English (US)",

isbn = "9783031477508",

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 = "54--71",

editor = "Foteini Baldimtsi and Christian Cachin",

booktitle = "Financial Cryptography and Data Security - 27th International Conference, FC 2023, Revised Selected Papers",

address = "Germany",

}

TY - GEN

T1 - Limits on Revocable Proof Systems, With Implications for Stateless Blockchains

AU - Christ, Miranda

AU - Bonneau, Joseph

PY - 2024

Y1 - 2024

N2 - Motivated by the goal of building a cryptocurrency with succinct global state, we introduce the abstract notion of a revocable proof system. We prove an information-theoretic result on the relation between global state size and the required number of local proof updates as statements are revoked (e.g., coins are spent). We apply our result to conclude that there is no useful trade-off point when building a stateless cryptocurrency: the system must either have a linear-sized global state (in the number of accounts in the system) or require a near-linear rate of local proof updates. The notion of a revocable proof system is quite general and also provides new lower bounds for set commitments, vector commitments and authenticated dictionaries.

AB - Motivated by the goal of building a cryptocurrency with succinct global state, we introduce the abstract notion of a revocable proof system. We prove an information-theoretic result on the relation between global state size and the required number of local proof updates as statements are revoked (e.g., coins are spent). We apply our result to conclude that there is no useful trade-off point when building a stateless cryptocurrency: the system must either have a linear-sized global state (in the number of accounts in the system) or require a near-linear rate of local proof updates. The notion of a revocable proof system is quite general and also provides new lower bounds for set commitments, vector commitments and authenticated dictionaries.

KW - Authenticated Data Structures

KW - Stateless Blockchains

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

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

U2 - 10.1007/978-3-031-47751-5_4

DO - 10.1007/978-3-031-47751-5_4

M3 - Conference contribution

AN - SCOPUS:85180622077

SN - 9783031477508

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

SP - 54

EP - 71

BT - Financial Cryptography and Data Security - 27th International Conference, FC 2023, Revised Selected Papers

A2 - Baldimtsi, Foteini

A2 - Cachin, Christian

PB - Springer Science and Business Media Deutschland GmbH

T2 - 27th International Conference on Financial Cryptography and Data Security, FC 2023

Y2 - 1 May 2023 through 5 May 2023

ER -