Traceable secret sharing: Strong security and efficient constructions
Suppose Alice uses at-out-of-n secret sharing to store her secret key on n servers. Her
secret key is protected as long as t of them do not collude. However, what if a less-than-t …
secret key is protected as long as t of them do not collude. However, what if a less-than-t …
Secret sharing with snitching
S Dziembowski, S Faust, T Lizurej… - Proceedings of the 2024 …, 2024 - dl.acm.org
We address the problem of detecting and punishing shareholder collusion in secret-sharing
schemes. We do it in the recently proposed cryptographic model called individual …
schemes. We do it in the recently proposed cryptographic model called individual …
The Sting Framework: Proving the Existence of Superclass Adversaries
M Kelkar, Y Li, N Jean-Louis, CO Pérez… - Cryptology ePrint …, 2024 - eprint.iacr.org
We introduce superclass accountability, a new notion of accountability for security protocols.
Classical notions of accountability typically aim to identify specific adversarial players whose …
Classical notions of accountability typically aim to identify specific adversarial players whose …
Detecting Rogue Decryption in (Threshold) Encryption via Self-Incriminating Proofs
Keeping decrypting parties accountable in public key encryption is notoriously hard since
the secret key owner can decrypt any arbitrary ciphertext. Threshold encryption aims to solve …
the secret key owner can decrypt any arbitrary ciphertext. Threshold encryption aims to solve …