Kavousi, A;
Abadi, A;
Jovanovic, P;
(2025)
Timed Secret Sharing.
In: Chung, KM and Sasaki, Y, (eds.)
Advances in Cryptology – ASIACRYPT 2024.
(pp. pp. 129-164).
Springer Nature: Singapore.
![]() |
Text
timed-secret-sharing.pdf - Accepted Version Access restricted to UCL open access staff until 10 December 2025. Download (836kB) |
Abstract
This paper introduces the notion of timed secret sharing (TSS), which establishes lower and upper time bounds for secret reconstruction in a threshold secret sharing scheme. Such time bounds are particularly useful in scenarios where an early or late reconstruction of a secret matters. We propose several new constructions that offer different security properties and show how they can be instantiated efficiently using novel techniques. We highlight how our ideas can be used to break the public goods game, which is an issue inherent to threshold secret sharing-based systems, without relying on incentive mechanism. We achieve this through an upper time bound that can be implemented either via short-lived proofs, or the gradual release of additional shares, establishing a trade-off between time and fault tolerance. The latter independently provides robustness in the event of dropout by some portion of shareholders.
Type: | Proceedings paper |
---|---|
Title: | Timed Secret Sharing |
Event: | Advances in Cryptology (ASIACRYPT 2024) |
ISBN-13: | 9789819609406 |
DOI: | 10.1007/978-981-96-0941-3_5 |
Publisher version: | https://doi.org/10.1007/978-981-96-0941-3_5 |
Language: | English |
Additional information: | This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions. |
UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
URI: | https://discovery.ucl.ac.uk/id/eprint/10204911 |



1. | ![]() | 1 |
Archive Staff Only
![]() |
View Item |