Scholarlink

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. Our main results are outlined below:

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Taming Adaptive Security and New Access Structures in Evolving Secret Sharing

  • 会议论文

  • 发表日期：

    2026年

查看全文
  • Danilo Francati,
  • Sara Giammusso,
  • Daniele Venturi

摘要

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. Our main results are outlined below: