An explication of secret sharing schemes
From MaRDI portal
Publication:1203951
DOI10.1007/BF00125203zbMath0793.68111MaRDI QIDQ1203951
Publication date: 18 February 1993
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Combinatorics in computer science (68R05) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)
Related Items (93)
Lower bounds for robust secret sharing schemes ⋮ Bounds And Constructions For Threshold Shared Generation Of Authenticators ⋮ On secret sharing schemes ⋮ Robust vector space secret sharing schemes ⋮ Two secret sharing schemes based on Boolean operations ⋮ ZCZ -- achieving \(n\)-bit SPRP security with a minimal number of tweakable-block-cipher calls ⋮ SECRET IMAGE SHARING BASED ON CHAOTIC MAP AND CHINESE REMAINDER THEOREM ⋮ A Latin square autotopism secret sharing scheme ⋮ Optimal linear secret sharing schemes for graph access structures on six participants ⋮ Some democratic secret sharing schemes ⋮ On the information rate of perfect secret sharing schemes ⋮ Improved constructions of secret sharing schemes by applying \((\lambda ,\omega )\)-decompositions ⋮ A note on secret sharing schemes with three homogeneous access structure ⋮ A note on dynamic threshold schemes ⋮ Generalised cumulative arrays in secret sharing ⋮ Secret sharing schemes with partial broadcast channels ⋮ Unnamed Item ⋮ Improving the linear programming technique in the search for lower bounds in secret sharing ⋮ On an infinite family of graphs with information ratio \(2 - 1/k\) ⋮ Anonymous secret sharing schemes ⋮ Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures ⋮ The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs ⋮ All inequalities for the relative entropy ⋮ Approximation and decomposition in lattices of clutters ⋮ Sharing one secret vs. sharing many secrets. ⋮ On identification secret sharing schemes. ⋮ The complexity of the graph access structures on six participants ⋮ Rational quantum secret sharing scheme based on GHZ state ⋮ Finding lower bounds on the complexity of secret sharing schemes by linear programming ⋮ Ideal multipartite secret sharing schemes ⋮ Balanced equi-\(n\)-squares ⋮ Ideal hierarchical secret sharing and lattice path matroids ⋮ On secret sharing protocols ⋮ Constructing ideal secret sharing schemes based on Chinese remainder theorem ⋮ Optimal information ratio of secret sharing schemes on Dutch windmill graphs ⋮ Operations over Linear Secret Sharing Schemes ⋮ Multi-party computation with conversion of secret sharing ⋮ Enumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum ⋮ Linear algebra approach to secret sharing schemes ⋮ Ideal Secret Sharing Schemes for Useful Multipartite Access Structures ⋮ Fully dynamic secret sharing schemes ⋮ New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures ⋮ On the information rate of secret sharing schemes ⋮ Lower bounds for monotone span programs ⋮ A new secret sharing scheme ⋮ A multisecret sharing scheme for color images based on cellular automata ⋮ Secret sharing schemes for compartmented access structures ⋮ Several Generalizations of Shamir's Secret Sharing Scheme ⋮ Nearly optimal robust secret sharing ⋮ Admissible tracks in Lai-Ding's secret sharing scheme ⋮ Extending Brickell-Davenport theorem to non-perfect secret sharing schemes ⋮ New secret sharing scheme based on linear code ⋮ An ideal multi-secret sharing scheme based on MSP ⋮ A general approach to robust web metering ⋮ Optimal assignment schemes for general access structures based on linear programming ⋮ Secret sharing schemes with three or four minimal qualified subsets ⋮ Properties and constraints of cheating-immune secret sharing schemes ⋮ Secret sharing schemes on access structures with intersection number equal to one ⋮ An optimal multisecret threshold scheme construction ⋮ Sharing multiple secrets: Models, schemes and analysis ⋮ A secure scheme to share secret color images ⋮ Secret sharing schemes based on graphical codes ⋮ How to share a secret ⋮ Optimal complexity of secret sharing schemes with four minimal qualified subsets ⋮ Unnamed Item ⋮ On secret sharing schemes, matroids and polymatroids ⋮ Reduced access structures with four minimal qualified subsets on six participants ⋮ Threshold Secret Sharing Through Multivariate Birkhoff Interpolation ⋮ The exact values of the optimal average information ratio of perfect secret-sharing schemes for tree-based access structures ⋮ New schemes for sharing points on an elliptic curve ⋮ Ideal secret sharing schemes whose minimal qualified subsets have at most three participants ⋮ Introduction to Secret-Sharing ⋮ A perfect threshold secret sharing scheme to identify cheaters ⋮ Generation of key predistribution schemes using secret sharing schemes ⋮ Hypergraph decomposition and secret sharing ⋮ On the optimization of bipartite secret sharing schemes ⋮ Formalisation of probabilistic concealment ⋮ Shared generation of pseudo-random functions ⋮ Ideal Hierarchical Secret Sharing Schemes ⋮ Graph decompositions and secret sharing schemes ⋮ ON THE DEALER'S RANDOMNESS REQUIRED IN PERFECT SECRET SHARING SCHEMES WITH ACCESS STRUCTURES OF CONSTANT RANK ⋮ Combiner Driven Management Models and Their Applications ⋮ A secret sharing scheme based on cellular automata ⋮ Lower bounds on the information rate of secret sharing schemes with homogeneous access structure. ⋮ A note on optimal metering schemes. ⋮ On the enumeration of Boolean functions with distinguished variables ⋮ General Secret Sharing Based on the Chinese Remainder Theorem with Applications in E-Voting ⋮ Roughly weighted hierarchical simple games ⋮ Randomness in distribution protocols ⋮ Probability of shares in secret sharing schemes ⋮ Geometric secret sharing schemes and their duals ⋮ Weighted decomposition construction for perfect secret sharing schemes ⋮ Secure multi-party computation with a quantum manner
Cites Work
- How to share a secret with cheaters
- On the classification of ideal secret sharing schemes
- On secret-sharing matroids
- Graph decompositions and secret sharing schemes
- How to share a secret
- The Detection of Cheaters in Thershold Schemes
- On secret sharing systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An explication of secret sharing schemes
