How to Share a Secret, Infinitely
From MaRDI portal
Recommendations
Cites work
- An almost optimal algorithm for unbounded searching
- Bounds on the Threshold Gap in Secret Sharing and its Applications
- Changing base without losing space
- Constructing $O(n\log n)$ Size Monotone Formulae for the kth Threshold Function of n Boolean Variables
- Economical encoding of commas between strings
- Elements of Information Theory
- General secure multi-party computation from any linear secret-sharing scheme
- How to share a secret
- scientific article; zbMATH DE number 4179276 (Why is no real title available?)
- scientific article; zbMATH DE number 5485554 (Why is no real title available?)
- scientific article; zbMATH DE number 1024051 (Why is no real title available?)
- scientific article; zbMATH DE number 1031003 (Why is no real title available?)
- scientific article; zbMATH DE number 2086721 (Why is no real title available?)
- Implicat Representation of Graphs
- Multiple assignment scheme for sharing secret
- On-line secret sharing
- On-line secret sharing
- Progress in Cryptology - INDOCRYPT 2003
- Secret-sharing for \(\mathbf {NP}\)
- Secret-Sharing Schemes: A Survey
- Threshold functions and bounded depth monotone circuits
- Threshold Secret Sharing Requires a Linear Size Alphabet
- Universal codeword sets and representations of the integers
Cited in
(20)- How to share a secret with cheaters
- A quantum evolving secret sharing scheme
- Evolving ramp secret sharing with a small gap
- Evolving homomorphic secret sharing for hierarchical access structures
- Secret sharing schemes for infinite sets of participants: a new design technique
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Infinite secret sharing -- examples
- How to Leak a Secret and Reap the Rewards Too
- Lossy chains and fractional secret sharing
- How to share a secret
- Threshold Secret Sharing Requires a Linear Size Alphabet
- Evolving perfect hash families: a combinatorial viewpoint of evolving secret sharing
- Probabilistic secret sharing
- A lower bound on the share size in evolving secret sharing
- Evolving secret sharing revisited: computational security and succinctness
- New upper bounds for evolving secret sharing via infinite branching programs
- Evolving secret sharing made short
- A construction of evolving k-threshold secret sharing scheme over a polynomial ring
- Taming adaptive security and new access structures in evolving secret sharing
- A construction of evolving 3-threshold secret sharing scheme with perfect security and smaller share size
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 Q3181038)
