Secret Sharing with Certified Deletion
James Bartusek, Justin Raizes

TL;DR
This paper introduces secret sharing with certified deletion, enabling secure quantum-based secret sharing that remains safe even if an adversary eventually collects all shares, by verifying and destroying quantum shares.
Contribution
It systematically studies secret sharing with certified deletion, proposing constructions for no-signaling and adaptive security, and generalizes quantum entropy extraction techniques.
Findings
Constructed a no-signaling certified deletion scheme for any access structure.
Developed a threshold scheme with adaptive certified deletion.
Generalized XOR extractor for high-rate seedless quantum entropy extraction.
Abstract
Secret sharing allows a user to split a secret into many shares so that the secret can be recovered if, and only if, an authorized set of shares is collected. Although secret sharing typically does not require any computational hardness assumptions, its security does require that an adversary cannot collect an authorized set of shares. Over long periods of time where an adversary can benefit from multiple data breaches, this may become an unrealistic assumption. We initiate the systematic study of secret sharing with certified deletion in order to achieve security even against an adversary that eventually collects an authorized set of shares. In secret sharing with certified deletion, a (classical) secret is split into quantum shares which can be verifiably destroyed. We define two natural notions of security: no-signaling security and adaptive security. Next, we show how to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security
