Weakening Assumptions for Publicly-Verifiable Deletion

James Bartusek; Dakshita Khurana; Giulio Malavolta; Alexander Poremba; Michael Walter

doi:10.1007/978-3-031-48624-1_7

Weakening Assumptions for Publicly-Verifiable Deletion

James Bartusek, Dakshita Khurana, Giulio Malavolta, Alexander Poremba, Michael Walter

Siebel School of Computing and Data Science

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

Abstract

We develop a simple compiler that generically adds publicly-verifiable deletion to a variety of cryptosystems. Our compiler only makes use of one-way functions (or one-way state generators, if we allow the public verification key to be quantum). Previously, similar compilers either relied on indistinguishability obfuscation along with any one-way function (Bartusek et al., ePrint:2023/265), or on almost-regular one-way functions (Bartusek, Khurana and Poremba, CRYPTO 2023).

Original language	English (US)
Title of host publication	Theory of Cryptography - 21st International Conference, TCC 2023, Proceedings
Editors	Guy Rothblum, Hoeteck Wee
Publisher	Springer
Pages	183-197
Number of pages	15
ISBN (Print)	9783031486234
DOIs	https://doi.org/10.1007/978-3-031-48624-1_7
State	Published - 2023
Event	21st International conference on Theory of Cryptography Conference, TCC 2023 - Taipei, Taiwan, Province of China Duration: Nov 29 2023 → Dec 2 2023

Publication series

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

Conference

Conference	21st International conference on Theory of Cryptography Conference, TCC 2023
Country/Territory	Taiwan, Province of China
City	Taipei
Period	11/29/23 → 12/2/23

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Online availability

10.1007/978-3-031-48624-1_7

Library availability

Discover UIUC Full Text

Cite this

Bartusek, J., Khurana, D., Malavolta, G., Poremba, A., & Walter, M. (2023). Weakening Assumptions for Publicly-Verifiable Deletion. In G. Rothblum, & H. Wee (Eds.), Theory of Cryptography - 21st International Conference, TCC 2023, Proceedings (pp. 183-197). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 14372 LNCS). Springer. https://doi.org/10.1007/978-3-031-48624-1_7

Weakening Assumptions for Publicly-Verifiable Deletion. / Bartusek, James; Khurana, Dakshita; Malavolta, Giulio et al.
Theory of Cryptography - 21st International Conference, TCC 2023, Proceedings. ed. / Guy Rothblum; Hoeteck Wee. Springer, 2023. p. 183-197 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 14372 LNCS).

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

Bartusek, J, Khurana, D, Malavolta, G, Poremba, A & Walter, M 2023, Weakening Assumptions for Publicly-Verifiable Deletion. in G Rothblum & H Wee (eds), Theory of Cryptography - 21st International Conference, TCC 2023, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 14372 LNCS, Springer, pp. 183-197, 21st International conference on Theory of Cryptography Conference, TCC 2023, Taipei, Taiwan, Province of China, 11/29/23. https://doi.org/10.1007/978-3-031-48624-1_7

Bartusek J, Khurana D, Malavolta G, Poremba A, Walter M. Weakening Assumptions for Publicly-Verifiable Deletion. In Rothblum G, Wee H, editors, Theory of Cryptography - 21st International Conference, TCC 2023, Proceedings. Springer. 2023. p. 183-197. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-031-48624-1_7

Bartusek, James ; Khurana, Dakshita ; Malavolta, Giulio et al. / Weakening Assumptions for Publicly-Verifiable Deletion. Theory of Cryptography - 21st International Conference, TCC 2023, Proceedings. editor / Guy Rothblum ; Hoeteck Wee. Springer, 2023. pp. 183-197 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{e694253da2cd480e87f1ebdce68bfab1,

title = "Weakening Assumptions for Publicly-Verifiable Deletion",

abstract = "We develop a simple compiler that generically adds publicly-verifiable deletion to a variety of cryptosystems. Our compiler only makes use of one-way functions (or one-way state generators, if we allow the public verification key to be quantum). Previously, similar compilers either relied on indistinguishability obfuscation along with any one-way function (Bartusek et al., ePrint:2023/265), or on almost-regular one-way functions (Bartusek, Khurana and Poremba, CRYPTO 2023).",

author = "James Bartusek and Dakshita Khurana and Giulio Malavolta and Alexander Poremba and Michael Walter",

note = "Publisher Copyright: {\textcopyright} International Association for Cryptologic Research 2023.; 21st International conference on Theory of Cryptography Conference, TCC 2023 ; Conference date: 29-11-2023 Through 02-12-2023",

year = "2023",

doi = "10.1007/978-3-031-48624-1_7",

language = "English (US)",

isbn = "9783031486234",

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

publisher = "Springer",

pages = "183--197",

editor = "Guy Rothblum and Hoeteck Wee",

booktitle = "Theory of Cryptography - 21st International Conference, TCC 2023, Proceedings",

address = "Germany",

}

TY - GEN

T1 - Weakening Assumptions for Publicly-Verifiable Deletion

AU - Bartusek, James

AU - Khurana, Dakshita

AU - Malavolta, Giulio

AU - Poremba, Alexander

AU - Walter, Michael

PY - 2023

Y1 - 2023

N2 - We develop a simple compiler that generically adds publicly-verifiable deletion to a variety of cryptosystems. Our compiler only makes use of one-way functions (or one-way state generators, if we allow the public verification key to be quantum). Previously, similar compilers either relied on indistinguishability obfuscation along with any one-way function (Bartusek et al., ePrint:2023/265), or on almost-regular one-way functions (Bartusek, Khurana and Poremba, CRYPTO 2023).

AB - We develop a simple compiler that generically adds publicly-verifiable deletion to a variety of cryptosystems. Our compiler only makes use of one-way functions (or one-way state generators, if we allow the public verification key to be quantum). Previously, similar compilers either relied on indistinguishability obfuscation along with any one-way function (Bartusek et al., ePrint:2023/265), or on almost-regular one-way functions (Bartusek, Khurana and Poremba, CRYPTO 2023).

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

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

U2 - 10.1007/978-3-031-48624-1_7

DO - 10.1007/978-3-031-48624-1_7

M3 - Conference contribution

AN - SCOPUS:85178657381

SN - 9783031486234

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

SP - 183

EP - 197

BT - Theory of Cryptography - 21st International Conference, TCC 2023, Proceedings

A2 - Rothblum, Guy

A2 - Wee, Hoeteck

PB - Springer

T2 - 21st International conference on Theory of Cryptography Conference, TCC 2023

Y2 - 29 November 2023 through 2 December 2023

ER -