Evolving secret sharing schemes based on polynomial evaluations and algebraic geometry codes

DOI10.1109/TIT.2024.3379278MaRDI QIDQ6576493zbMATH OpenFDO

Authors Chaoping Xing, Chen Yuan

Publication date 22 July 2024

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2024.3379278

Mathematics Subject Classification ID

Information and communication theory, circuits (94-XX)

Cited in

(4)

• Evolving secret sharing revisited: computational security and succinctness
• New upper bounds for evolving secret sharing via infinite branching programs
• A construction of evolving k-threshold secret sharing scheme over a polynomial ring
• A construction of evolving 3-threshold secret sharing scheme with perfect security and smaller share size

This page was built for publication: Evolving secret sharing schemes based on polynomial evaluations and algebraic geometry codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6576493)