Designs, Codes and Cryptography Computer Science Applications

New directions in evolving secret sharing: adaptive security and more access structures

Danilo Francati, Sara Giammusso, Daniele Venturi
Springer Nature · 2026-11-01 · DOI 10.1007/s10623-026-01953-4

Abstract

Abstract Evolving secret sharing (Komargodski, Naor, and Yogev, TCC 2016) allows a dealer to share a secret value in an online manner, without knowing the access structure or the maximum number of parties in advance, and without ever updating the shares of older players. In this paper, we continue the study of evolving secret sharing schemes in the computational setting, as first considered by Francati and Venturi (ASIACRYPT 2024), where the number of parties is upper bounded by an unknown polynomial and the privacy property only holds against computationally-bounded adversaries. We provide three main contributions. First, we formalize adaptive security for evolving secret sharing, introducing two natural notions—semi-adaptive and fully-adaptive—and establish a precise relationship between them. We show that semi-adaptive security implies fully-adaptive security with a loss that depends on the description size of the evolving access structure. For succinctly representable structures, this loss is polynomial. Second, we present generic compilers that transform non-evolving secret sharing schemes into evolving ones. Assuming one-way functions, we obtain evolving schemes in which the n -th share essentially aggregates the shares corresponding to the other $$n-1$$ n - 1 parties; assuming trapdoor permutations in the random oracle model and starting from an adaptively secure non-evolving scheme, we obtain fully-adaptively secure evolving schemes, that incur the same aggregation cost, plus an additional overhead linear in the number of parties. Together, these results establish a natural upper bound on the share size of evolving secret sharing for natural families of access structures. Third, we prove that an existing construction for monotone circuits evolving access structures achieves adaptive security for constant-depth circuits, under standard cryptographic assumptions. Overall, our results provide a systematic treatment of adaptive security in evolving secret sharing and demonstrate that it can be generically achieved with controlled overhead under standard assumptions.

Read at publisher →