AI Chat AI Image Generator AI Video Text to Speech

Weakening Assumptions for Publicly-Verifiable Deletion

04/19/2023

∙

by James Bartusek, et al.

∙

∙

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 the use of indistinguishability obfuscation (Bartusek et. al., ePrint:2023/265) or almost-regular one-way functions (Bartusek, Khurana and Poremba, arXiv:2303.08676).

James Bartusek
11 publications
Dakshita Khurana
8 publications
Giulio Malavolta
9 publications
Alexander Poremba
9 publications
Michael Walter
21 publications

page 1

page 2

page 3

page 4

research

∙ 04/14/2023

Publicly Verifiable Deletion from Minimal Assumptions

We present a general compiler to add the publicly verifiable deletion pr...

0 Fuyuki Kitagawa, et al. ∙

research

∙ 03/15/2023

Publicly-Verifiable Deletion via Target-Collapsing Functions

We build quantum cryptosystems that support publicly-verifiable deletion...

0 James Bartusek, et al. ∙

research

∙ 10/12/2022

From the Hardness of Detecting Superpositions to Cryptography: Quantum Public Key Encryption and Commitments

Recently, Aaronson et al. (arXiv:2009.07450) showed that detecting inter...

0 Minki Hhan, et al. ∙

research

∙ 07/05/2022

Cryptography with Certified Deletion

We propose a new, unifying framework that yields an array of cryptograph...

0 James Bartusek, et al. ∙

research

∙ 03/11/2021

Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms

For a finite collection of graphs F, the F-M-DELETION (resp. F-TM-DELETI...

0 Julien Baste, et al. ∙

research

∙ 06/16/2022

Adaptive versus Static Multi-oracle Algorithms, and Quantum Security of a Split-key PRF

In the first part of the paper, we show a generic compiler that transfor...

0 Jelle Don, et al. ∙