Timed Secret Sharing

被引:0
作者
Kavousi, Alireza [1 ]
Abadi, Aydin [2 ]
Jovanovic, Philipp [1 ]
机构
[1] UCL, London, England
[2] Newcastle Univ, Newcastle Upon Tyne, Tyne & Wear, England
来源
ADVANCES IN CRYPTOLOGY - ASIACRYPT 2024, PT VII | 2025年 / 15490卷
关键词
PROTOCOLS;
D O I
10.1007/978-981-96-0941-3_5
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:129 / 164
页数:36
相关论文
共 50 条
  • [41] A timed verification of the IEEE 1394 leader election protocol
    Romijn, J
    FORMAL METHODS IN SYSTEM DESIGN, 2001, 19 (02) : 165 - 194
  • [42] A Timed Verification of the IEEE 1394 Leader Election Protocol
    Judi Romijn
    Formal Methods in System Design, 2001, 19 : 165 - 194
  • [43] Formal passive testing of timed systems: theory and tools
    Andres, Cesar
    Merayo, Mercedes G.
    Nunez, Manuel
    SOFTWARE TESTING VERIFICATION & RELIABILITY, 2012, 22 (06) : 365 - 405
  • [44] Reachability results for timed automata with unbounded data structures
    Lanotte, Ruggero
    Maggiolo-Schettini, Andrea
    Troina, Angelo
    ACTA INFORMATICA, 2010, 47 (5-6) : 279 - 311
  • [45] Public Evidence from Secret Ballots
    Bernhard, Matthew
    Benaloh, Josh
    Halderman, J. Alex
    Rivest, Ronald L.
    Ryan, Peter Y. A.
    Stark, Philip B.
    Teague, Vanessa
    Vora, Poorvi L.
    Wallach, Dan S.
    ELECTRONIC VOTING (E-VOTE-ID 2017), 2017, 10615 : 84 - 109
  • [46] A New Construction for Linkable Secret Handshake
    Tian, Yangguang
    Li, Yingjiu
    Deng, Robert H.
    Li, Nan
    Yang, Guomin
    Yang, Zheng
    COMPUTER JOURNAL, 2020, 63 (04) : 536 - 548
  • [47] Timed Automata as a Formalism for Expressing Security: A Survey on Theory and Practice
    Arcile, Johan
    Andre, Etienne
    ACM COMPUTING SURVEYS, 2023, 55 (06)
  • [48] Guaranteed Private Communication With Secret Block Structure
    Da Costa, Maxime Ferreira
    Li, Jianxiu
    Mitra, Urbashi
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2024, 72 : 3547 - 3561
  • [49] Effect of calving to timed artificial insemination interval on fertility of beef cows
    Tomazi Filho, Juarez
    Machado Pfeifer, Luiz Francisco
    Hoefle, Clerio Antonio
    Rodrigues, Murilo Farias
    Ferreira, Rogerio
    REPRODUCTION IN DOMESTIC ANIMALS, 2022, 57 (08) : 936 - 942
  • [50] Privacy-Preserving Collaborative Sharing for Sharing Economy in Fog-Enhanced IoT
    Bai, Wenle
    Huang, Aoran
    IEEE ACCESS, 2023, 11 : 95295 - 95306