New upper bounds for evolving secret sharing via infinite branching programs
Evolving secret-sharing schemes, defined by Komargodski, Naor, and Yogev [TCC 2016B],
are secret-sharing schemes in which there is no a-priory bound on the number of parties. In …
are secret-sharing schemes in which there is no a-priory bound on the number of parties. In …
Evolving Conditional Disclosure of Secrets
N Peter - International Conference on Information Security, 2023 - Springer
In this work, we define and study the notion of evolving conditional disclosure of secrets
(CDS) protocols. In this model, parties arrive infinitely in sequential order. Each party holds a …
(CDS) protocols. In this model, parties arrive infinitely in sequential order. Each party holds a …
Evolving secret sharing made short
D Francati, D Venturi - International Conference on the Theory and …, 2025 - Springer
Abstract Evolving secret sharing (Komargodski, Naor, and Yogev, TCC'16) generalizes the
notion of secret sharing to the setting of evolving access structures, in which the share …
notion of secret sharing to the setting of evolving access structures, in which the share …
Evolving secret sharing with essential participants
J Pramanik, A Adhikari - … of International Conference on Frontiers in …, 2021 - Springer
Komargodski et al. introduced Evolving Secret Sharing which allows an impartial participant,
called dealer, to share a secret among unbounded number of participants over any given …
called dealer, to share a secret among unbounded number of participants over any given …
Evolving secret sharing in almost semi-honest model
J Pramanik, A Adhikari - International Conference on Security and Privacy, 2021 - Springer
Evolving secret sharing is a special kind of secret sharing where the number of shareholders
is not known beforehand, ie, at time t= 0 t= 0. In classical secret sharing such a restriction …
is not known beforehand, ie, at time t= 0 t= 0. In classical secret sharing such a restriction …
Cheating detectable ramp secret sharing with optimal cheating resiliency
Abstract A (k, L, n) ramp secret sharing scheme allows a dealer to share a secret vector with
a lesser share size compared to threshold secret sharing schemes. In this work, we …
a lesser share size compared to threshold secret sharing schemes. In this work, we …
A Construction of Evolving -threshold Secret Sharing Scheme with Perfect Security and Smaller Share Size
Q Cheng, H Cao, SJ Lin - arXiv preprint arXiv:2410.13529, 2024 - arxiv.org
The evolving $ k $-threshold secret sharing scheme allows the dealer to distribute the secret
to many participants such that only no less than $ k $ shares together can restore the secret …
to many participants such that only no less than $ k $ shares together can restore the secret …
Cheating Detectable Ramp Secret Sharing with Optimal Cheating Resiliency
A Adhikari - Information Systems Security - Springer
A (k, L, n) ramp secret sharing scheme allows a dealer to share a secret vector with a lesser
share size compared to threshold secret sharing schemes. In this work, we formalize the …
share size compared to threshold secret sharing schemes. In this work, we formalize the …