On-line secret sharing

DOI10.1007/s10623-011-9540-yzbMath1236.05195arXiv1402.1368OpenAlexW3104756242MaRDI QIDQ664393

László Csirmaz, Gábor Tardos

Publication date: 1 March 2012

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1402.1368

zbMATH Keywords

complexityentropy methodonline algorithmsecret sharingperformance ratio

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Authentication, digital signatures and secret sharing (94A62) Online algorithms; streaming algorithms (68W27)

Related Items (4)

How to Share a Secret, Infinitely ⋮ Secret sharing schemes for infinite sets of participants: a new design technique ⋮ Probabilistic secret sharing ⋮ Evolving ramp secret sharing with a small gap

Cites Work

• Unnamed Item
• Unnamed Item
• On the information rate of secret sharing schemes
• An on-line graph coloring algorithm with sublinear performance ratio
• On the size of shares for secret sharing schemes
• Tight bounds on the information rate of secret sharing schemes
• Covering a graph by complete bipartite graphs
• On the information rate of perfect secret sharing schemes
• Secure multi-party computation made simple
• Two Constructions on Limits of Entropy Functions
• On Secret Sharing Schemes, Matroids and Polymatroids
• Decomposition constructions for secret-sharing schemes
• On-line secret sharing

This page was built for publication: On-line secret sharing