Multiple assignment scheme for sharing secret
From MaRDI portal
Publication:1207695
DOI10.1007/BF02620229zbMath0795.68070MaRDI QIDQ1207695
Akira Saito, Takao Nishizeki, Mitsuru Ito
Publication date: 16 May 1993
Published in: Journal of Cryptology (Search for Journal in Brave)
Related Items
Secret sharing schemes based on the dual of Golay codes, Constructions of dynamic and non-dynamic threshold public-key encryption schemes with decryption consistency, Upslices, downslices, and secret-sharing with complexity of \(1.5^n\), Quadratic secret sharing and conditional disclosure of secrets, 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, How to Share a Secret, Infinitely, Generalised cumulative arrays in secret sharing, Dynamic Threshold Public-Key Encryption with Decryption Consistency from Static Assumptions, Secret-sharing for NP, An efficient construction of perfect secret sharing schemes for graph-based structures, Abelian sharing, common informations, and linear rank inequalities, Secret sharing schemes for graph-based prohibited structures, Optimal linear multiparty conditional disclosure of secrets protocols, Recursive constructions for perfect secret sharing schemes, On Linear Secret Sharing for Connectivity in Directed Graphs, Optimal information ratio of secret sharing schemes on Dutch windmill graphs, Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures, Evolving Perfect Hash Families: A Combinatorial Viewpoint of Evolving Secret Sharing, Probabilistic secret sharing, Construction of arithmetic secret sharing schemes by using torsion limits, Secret sharing schemes for compartmented access structures, An ideal multi-secret sharing scheme based on MSP, Linear secret sharing schemes and rearrangements of access structures, Sharing multiple secrets: Models, schemes and analysis, The combinatorics of generalised cumulative arrays, Realizing secret sharing with general access structure, Secret Sharing Schemes for Dense Forbidden Graphs, Round-efficient perfectly secure message transmission scheme against general adversary, Shared generation of pseudo-random functions, Unnamed Item, Graph decompositions and secret sharing schemes, ON THE DEALER'S RANDOMNESS REQUIRED IN PERFECT SECRET SHARING SCHEMES WITH ACCESS STRUCTURES OF CONSTANT RANK, Distributing the encryption and decryption of a block cipher, Weighted decomposition construction for perfect secret sharing schemes
Cites Work
