How to Share a Secret, Infinitely

DOI10.1109/TIT.2017.2779121MaRDI QIDQ5375569zbMATH OpenOpenAlexFDO

Authors Ilan Komargodski, Moni Naor, Eylon Yogev

Publication date 14 September 2018

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

Full work available at URL https://doi.org/10.1109/tit.2017.2779121

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Cited in

(13)

• How to share a secret with cheaters
• Quantum multi-secret sharing via trap codes and discrete quantum walks
• Secret sharing schemes for infinite sets of participants: a new design technique
• How to Leak a Secret and Reap the Rewards Too
• How to share a secret
• How to Share a Secret, Infinitely
• Probabilistic secret sharing
• Threshold secret sharing requires a linear-size alphabet
• Quantum attribute-based encryption: a comprehensive study
• 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
• New results in share conversion, with applications to evolving access structures

This page was built for publication: How to Share a Secret, Infinitely

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