Quantum proofs of deletion for learning with errors

DOI10.4230/LIPICS.ITCS.2023.90MaRDI QIDQ6610363zbMATH OpenFDO

Authors Alexander Poremba

Publication date 25 September 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ITCS.2023.90

zbMATH Keywords

certified deletionfully homomorphic encryptionlearning with errors

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(12)

• Publicly verifiable deletion from minimal assumptions
• Certified everlasting secure collusion-resistant functional encryption, and more
• Software with certified deletion
• Secret sharing with certified deletion
• Revocable quantum digital signatures
• LWE with quantum amplitudes: Algorithm, hardness, and oblivious sampling
• A quasi-polynomial time algorithm for the extrapolated dihedral coset problem over power-of-two moduli
• A simple framework for secure key leasing
• Non-interactive zero-knowledge arguments with certified deletion
• Publicly verifiable deletion: general compilers from minimal assumptions
• Collusion-resistant quantum secure key leasing beyond decryption
• Certified everlasting secure collusion-resistant functional encryption, and more

This page was built for publication: Quantum proofs of deletion for learning with errors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6610363)