Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2304.09846 · Lecture notes in computer science

Weakening Assumptions for Publicly-Verifiable Deletion

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

Published Jan 1, 2023• 12 citations
arXivHTMLPDF
DOI
10.1007/978-3-031-48624-1_7

Related papers

Publicly Verifiable Deletion from Minimal Assumptions

Fuyuki Kitagawa, Ryo Nishimaki, Takashi Yamakawa

arXiv:2304.07062•Lecture notes in computer science•Jan 1, 2023•17 citations

Publicly Verifiable Deletion: General Compilers from Minimal Assumptions

James Bartusek, Dakshita Khurana, Fuyuki Kitagawa +5 more

Journal of Cryptology•May 29, 2026•0 citations

Secret Sharing with Publicly Verifiable Deletion

Jonathan I. Katz, Benjamin Sela

Lecture notes in computer science•Jan 1, 2025•4 citations

Constant-Rate Certified Deletion

Kai-Min Chung, Tzu-Hsiang Huang, Wei-Hsiang Hung +1 more

We present a unified framework for upgrading a broad class of cryptographic primitives to support constant-rate certified deletion. Previous constructions require a linear number of qubits per encrypted bit of certified-deletable plaintext. In contrast, we obtain the first constant-rate constructions in the plain model that achieve certified deletion while preserving everlasting security. Our approach applies to a wide range of "all-or-nothing"-type primitives based on BB84-style encodings, including commitment schemes, public-key encryption, attribute-based encryption, and fully homomorphic encryption. Beyond this class, we also obtain constant-rate certified deletion for primitives built from subspace coset states, such as blind delegation, secure software leasing, functional encryption, and differing-inputs iO, and CCA-PKE. Importantly, our framework does not introduce any additional assumptions beyond those required by the underlying certified deletion primitives. Finally, under the hardness of SIS, we show that public verifiability can be incorporated into BB84- and coset-based certified deletion. In combination with our constant-rate constructions, this yields publicly verifiable certified deletion schemes with constant rate.

cs.CRCross-listedarXiv:2610.03590•Lecture notes in computer science•Oct 5, 2026•0 citations

Publicly-Verifiable Deletion via Target-Collapsing Functions

James Bartusek, Dakshita Khurana, Alexander Poremba

arXiv:2303.08676•Lecture notes in computer science•Jan 1, 2023•20 citations

Weakening Security Assumptions and Oblivious Transfer

Claude Crépeau, Joe Kilian

Lecture notes in computer science•Jan 1, 1990•43 citations
We present a unified framework for upgrading a broad class of cryptographic primitives to support constant-rate certified deletion. Previous constructions require a linear number of qubits per encrypted bit of certified-deletable plaintext. In contrast, we obtain the first constant-rate constructions in the plain model that achieve certified deletion while preserving everlasting security. Our approach applies to a wide range of "all-or-nothing"-type primitives based on BB84-style encodings, including commitment schemes, public-key encryption, attribute-based encryption, and fully homomorphic encryption. Beyond this class, we also obtain constant-rate certified deletion for primitives built from subspace coset states, such as blind delegation, secure software leasing, functional encryption, and differing-inputs iO, and CCA-PKE. Importantly, our framework does not introduce any additional assumptions beyond those required by the underlying certified deletion primitives. Finally, under the hardness of SIS, we show that public verifiability can be incorporated into BB84- and coset-based certified deletion. In combination with our constant-rate constructions, this yields publicly verifiable certified deletion schemes with constant rate.