On secret sharing systems
From MaRDI portal
Publication:4739795
DOI10.1109/TIT.1983.1056621zbMath0503.94018WikidataQ28015699 ScholiaQ28015699MaRDI QIDQ4739795
Martin Edward Hellman, Ehud D. Karnin, Jonathan W. Greene
Publication date: 1983
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
secret sharing systempolynomial interpolation methoddeterministic probabilistic methodlinear coding scheme
Related Items
On the bound for anonymous secret sharing schemes, Combinatorial lower bounds for secret sharing schemes, Bounds And Constructions For Threshold Shared Generation Of Authenticators, Secret-sharing schemes for very dense graphs, Secret sharing based on a hard-on-average problem, On secret sharing schemes, On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate, Optimal linear secret sharing schemes for graph access structures on six participants, Some democratic secret sharing schemes, A note on dynamic threshold schemes, Secret sharing schemes with partial broadcast channels, Improving the linear programming technique in the search for lower bounds in secret sharing, On ASGS framework: general requirements and an example of implementation, Cheating-immune secret sharing schemes from codes and cumulative arrays, Summing over a network without revealing summands, A survey and refinement of repairable threshold schemes, Key-Policy Attribute-Based Encryption for Boolean Circuits from Bilinear Maps, Timed-Release Secret Sharing Schemes with Information Theoretic Security, Secure Two-Party Computation: A Visual Way, New classes of codes over \(R_{q,p,m}=\mathbb{Z}_{p^m}[u_1, u_2, \dots , u_q/ \langle u_i^2=0,u_iu_j=u_ju_i\rangle\) and their applications], Ideal ramp schemes and related combinatorial objects, SHARING SECRETS USING ELEMENTARY CELLULAR AUTOMATA, On the information ratio of non-perfect secret sharing schemes, Timed-release computational secret sharing and threshold encryption, On ideal and weakly-ideal access structures, On identification secret sharing schemes., Homomorphic extensions of CRT-based secret sharing, Verifiable quantum \((k,n)\)-threshold secret key sharing, Strong security of linear ramp secret sharing schemes with general access structures, Finding lower bounds on the complexity of secret sharing schemes by linear programming, Ideal multipartite secret sharing schemes, Ideal hierarchical secret sharing and lattice path matroids, Two new classes of projective two-weight linear codes, Linear threshold multisecret sharing schemes, Recursive constructions for perfect secret sharing schemes, On Linear Secret Sharing for Connectivity in Directed Graphs, A New (k,n)-Threshold Secret Sharing Scheme and Its Extension, Error-correcting codes and cryptography, Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification, Secret-Sharing Schemes: A Survey, Ideal Secret Sharing Schemes for Useful Multipartite Access Structures, Fully dynamic secret sharing schemes, On ideal homomorphic secret sharing schemes and their decomposition, On the information rate of secret sharing schemes, Lower bounds for monotone span programs, A new secret sharing scheme, Construction of arithmetic secret sharing schemes by using torsion limits, Secure computation without computers, An explication of secret sharing schemes, Improvement of assurance including security for wireless sensor networks using dispersed data transmission, Improved upper bounds for the information rates of the secret sharing schemes induced by the Vámos matroid, Extending Brickell-Davenport theorem to non-perfect secret sharing schemes, Multisecret-sharing schemes and bounded distance decoding of linear codes, General constructions for information-theoretic private information retrieval, New secret sharing scheme based on linear code, An ideal multi-secret sharing scheme based on MSP, Optimal assignment schemes for general access structures based on linear programming, Sharing multiple secrets: Models, schemes and analysis, An improvement on the Lin-Wu \((t,n)\) threshold verifiable multi-secret sharing scheme, A simple primal-dual approximation algorithm for 2-edge-connected spanning subgraphs, How to share a secret, Optimal complexity of secret sharing schemes with four minimal qualified subsets, Verifiable Multi-secret Sharing Schemes for Multiple Threshold Access Structures, On secret sharing schemes, matroids and polymatroids, Reduced access structures with four minimal qualified subsets on six participants, Matroids Can Be Far from Ideal Secret Sharing, Linear multi-secret sharing schemes based on multi-party computation, Unnamed Item, A novel secret sharing scheme using multiple share images, 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, On abelian and homomorphic secret sharing schemes, Multipartite secret sharing by bivariate interpolation, A (2, n)-SECRET SHARING SCHEME BASED ON LINEAR CELLULAR AUTOMATA, Generation of key predistribution schemes using secret sharing schemes, Security games over lexicographic orders, Revisiting and Extending the AONT-RS Scheme: A Robust Computationally Secure Secret Sharing Scheme, Practical Threshold Signatures with Linear Secret Sharing Schemes, A lower bound on the encoding length in lossy transmission, General information dispersal algorithms, Hypergraph decomposition and secret sharing, A geometric characterization of minimal codes and their asymptotic performance, Ideal Hierarchical Secret Sharing Schemes, Ideal homomorphic secret sharing schemes over cyclic groups, Unnamed Item, Strongly secure ramp secret sharing schemes for general access structures, Graph decompositions and secret sharing schemes, ON THE DEALER'S RANDOMNESS REQUIRED IN PERFECT SECRET SHARING SCHEMES WITH ACCESS STRUCTURES OF CONSTANT RANK, On the size of shares for secret sharing schemes, General Secret Sharing Based on the Chinese Remainder Theorem with Applications in E-Voting, Randomness in distribution protocols, Probability of shares in secret sharing schemes, Weighted decomposition construction for perfect secret sharing schemes
