Publicly Verifiable Deletion from Minimal Assumptions. (arXiv:2304.07062v1 [cs.CR])

We present a general compiler to add the publicly verifiable deletion
property for various cryptographic primitives including public key encryption,
attribute-based encryption, and quantum fully homomorphic encryption. Our
compiler only uses one-way functions, or more generally hard quantum planted
problems for NP, which are implied by one-way functions. It relies on minimal
assumptions and enables us to add the publicly verifiable deletion property
with no additional assumption for the above primitives. Previously, such a
compiler needs additional assumptions such as …

actions attribute-based encryption compiler deletion encryption fully homomorphic encryption functions general hard homomorphic encryption key problems public public key quantum