Weakening Assumptions for Publicly-Verifiable Deletion

• URL: http://arxiv.org/abs/2304.09846v1
• Date: Wed, 19 Apr 2023 17:51:28 GMT
• Title: Weakening Assumptions for Publicly-Verifiable Deletion
• Authors: James Bartusek and Dakshita Khurana and Giulio Malavolta and Alexander Poremba and Michael Walter
• Abstract summary: 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.
• Score: 79.61363884631021
• License: http://creativecommons.org/licenses/by/4.0/
• 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 the use of indistinguishability obfuscation (Bartusek et. al., ePrint:2023/265) or almost-regular one-way functions (Bartusek, Khurana and Poremba, arXiv:2303.08676).

Related papers

• The syzygy distinguisher [0.0]
  We present a new distinguisher for alternant and hence Goppa codes, whose complexity is subexponential in the error-correcting capability. In particular, it applies to the codes used in the Classic McEliece candidate for postquantum cryptography standardization.
  arXiv  Detail & Related papers  (2024-07-22T15:42:06Z)
• Robust Combiners and Universal Constructions for Quantum Cryptography [12.100924828603247]
  A robust combiner combines many candidates for a cryptographic primitive and generates a new candidate for the same primitive. A universal construction is an explicit construction of the primitive that is correct and secure as long as the primitive exists. In this work, we define robust combiners and universal constructions for several quantum cryptographic primitives.
  arXiv  Detail & Related papers  (2023-11-16T01:16:28Z)
• Fault-Tolerant Computing with Single Qudit Encoding [49.89725935672549]
  We discuss stabilizer quantum-error correction codes implemented in a single multi-level qudit. These codes can be customized to the specific physical errors on the qudit, effectively suppressing them. We demonstrate a Fault-Tolerant implementation on molecular spin qudits, showcasing nearly exponential error suppression with only linear qudit size growth.
  arXiv  Detail & Related papers  (2023-07-20T10:51:23Z)
• Publicly Verifiable Deletion from Minimal Assumptions [13.664682865991253]
  We present a general compiler to add the publicly verifiable deletion property for various cryptographic primitives. Our compiler only uses one-way functions, or more generally hard quantum planted problems for NP.
  arXiv  Detail & Related papers  (2023-04-14T11:34:43Z)
• Publicly-Verifiable Deletion via Target-Collapsing Functions [81.13800728941818]
  We show that targetcollapsing enables publiclyverifiable deletion (PVD) We build on this framework to obtain a variety of primitives supporting publiclyverifiable deletion from weak cryptographic assumptions.
  arXiv  Detail & Related papers  (2023-03-15T15:00:20Z)
• Revocable Cryptography from Learning with Errors [61.470151825577034]
  We build on the no-cloning principle of quantum mechanics and design cryptographic schemes with key-revocation capabilities. We consider schemes where secret keys are represented as quantum states with the guarantee that, once the secret key is successfully revoked from a user, they no longer have the ability to perform the same functionality as before.
  arXiv  Detail & Related papers  (2023-02-28T18:58:11Z)
• Verified Reversible Programming for Verified Lossless Compression [11.020543186794459]
  Lossless compression implementations typically contain two programs, an encoder and a decoder, which are required to be inverse to one another. We observe that a significant class of compression methods, based on asymmetric numeral systems (ANS), have shared structure between the encoder and decoder. We have implemented a small reversible language, embedded in Agda, which we call 'Flipper'
  arXiv  Detail & Related papers  (2022-11-02T16:39:41Z)
• Extending C++ for Heterogeneous Quantum-Classical Computing [56.782064931823015]
  qcor is a language extension to C++ and compiler implementation that enables heterogeneous quantum-classical programming, compilation, and execution in a single-source context. Our work provides a first-of-its-kind C++ compiler enabling high-level quantum kernel (function) expression in a quantum-language manner.
  arXiv  Detail & Related papers  (2020-10-08T12:49:07Z)
• Glushkov's construction for functional subsequential transducers [91.3755431537592]
  Glushkov's construction has many interesting properties and they become even more evident when applied to transducers. Special flavour of regular expressions is introduced, which can be efficiently converted to $epsilon$-free functional subsequential weighted finite state transducers.
  arXiv  Detail & Related papers  (2020-08-05T17:09:58Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.