New upper bounds for evolving secret sharing via infinite branching programs

B Alon, A Beimel, T Ben David, E Omri… - Theory of Cryptography …, 2025 - Springer
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 …

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 …

Perpetual secret sharing from dynamic data structures

SS Chaudhury, S Dutta… - 2021 IEEE Conference on …, 2021 - ieeexplore.ieee.org
In this paper we propose a secret sharing scheme where the access structure changes over
time following a dynamic data structure. The proposed scheme can accommodate an …

[PDF][PDF] Secret Sharing and its variants, Matroids, Combinatorics

S Samadder, BK Roy - digitalcommons.isical.ac.in
My deepest gratitude goes first to my adviser Prof. Bimal Kumar Roy who expertly guided me
through my doctoral studies and who shared the excitement of five years of discovery. His …

Secret Sharing and Its Variants, Matroids, Combinatorics

SS Chaudhury - 2020 - search.proquest.com
The main focus of this thesis is secret sharing. Secret Sharing is a very basic and
fundamental cryptographic primitive. It is a method to share a secret by a dealer among …

[PDF][PDF] Secret Sharing and its variants, Matroids, Combinatorics

S Samadder Chaudhury - 2020 - dspace.isical.ac.in
My deepest gratitude goes first to my adviser Prof. Bimal Kumar Roy who expertly guided me
through my doctoral studies and who shared the excitement of five years of discovery. His …