Universally ideal secret-sharing schemes
From MaRDI portal
Publication:4838633
DOI10.1109/18.335890zbMath0821.94025OpenAlexW2143656893MaRDI QIDQ4838633
Publication date: 12 July 1995
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.335890
Related Items
Secret-sharing schemes for very dense graphs, Measuring, simulating and exploiting the head concavity phenomenon in BKZ, Threshold Secret Sharing Requires a Linear Size Alphabet, Algebraic secret sharing using privacy homomorphisms for IoT-based healthcare systems, The use of mathematical linguistic methods in creating secret sharing threshold algorithms, On ideal and weakly-ideal access structures, How to recover a secret with \(O(n)\) additions, Ideal uniform multipartite secret sharing schemes, Optimal linear multiparty conditional disclosure of secrets protocols, On Linear Secret Sharing for Connectivity in Directed Graphs, Secret-Sharing Schemes: A Survey, Ideal Secret Sharing Schemes for Useful Multipartite Access Structures, On ideal homomorphic secret sharing schemes and their decomposition, Lower bounds for monotone span programs, Optimal assignment schemes for general access structures based on linear programming, Secret sharing schemes based on graphical codes, Classes of matroids closed under minors and principal extensions, Matroids Can Be Far from Ideal Secret Sharing, Secret Sharing Schemes for Dense Forbidden Graphs, Randomness in secret sharing and visual cryptography schemes, Unnamed Item, Ideal homomorphic secret sharing schemes over cyclic groups, Efficient explicit constructions of compartmented secret sharing schemes, Matroid representations by partitions, Secret sharing schemes for ports of matroids of rank 3
