How to Share a Secret, Infinitely
From MaRDI portal
Publication:3181038
DOI10.1007/978-3-662-53644-5_19zbMath1412.94225OpenAlexW2535739715MaRDI QIDQ3181038
Moni Naor, Ilan Komargodski, Eylon Yogev
Publication date: 22 December 2016
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53644-5_19
Related Items (8)
Evolving homomorphic secret sharing for hierarchical access structures ⋮ Threshold Secret Sharing Requires a Linear Size Alphabet ⋮ Secret sharing schemes for infinite sets of participants: a new design technique ⋮ Evolving Perfect Hash Families: A Combinatorial Viewpoint of Evolving Secret Sharing ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ Probabilistic secret sharing ⋮ A quantum evolving secret sharing scheme ⋮ Evolving ramp secret sharing with a small gap
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On-line secret sharing
- Threshold functions and bounded depth monotone circuits
- Multiple assignment scheme for sharing secret
- An almost optimal algorithm for unbounded searching
- Changing base without losing space
- Secret-Sharing for NP
- Secret-Sharing Schemes: A Survey
- How to share a secret
- Threshold Secret Sharing Requires a Linear Size Alphabet
- Implicat Representation of Graphs
- Universal codeword sets and representations of the integers
- Economical encoding of commas between strings
- On-line secret sharing
- Constructing $O(n\log n)$ Size Monotone Formulae for the kth Threshold Function of n Boolean Variables
- Bounds on the Threshold Gap in Secret Sharing and its Applications
- Progress in Cryptology - INDOCRYPT 2003
- Elements of Information Theory
This page was built for publication: How to Share a Secret, Infinitely
