Pages that link to "Item:Q1207695"
From MaRDI portal
The following pages link to Multiple assignment scheme for sharing secret (Q1207695):
Displayed 36 items.
- Constructions of dynamic and non-dynamic threshold public-key encryption schemes with decryption consistency (Q278732) (← links)
- Secret-sharing schemes for very dense graphs (Q290386) (← links)
- Secret sharing schemes for compartmented access structures (Q520077) (← links)
- An ideal multi-secret sharing scheme based on MSP (Q543828) (← links)
- Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures (Q662167) (← links)
- Linear secret sharing schemes and rearrangements of access structures (Q705055) (← links)
- Round-efficient perfectly secure message transmission scheme against general adversary (Q766245) (← links)
- Generalised cumulative arrays in secret sharing (Q851749) (← links)
- Secret sharing schemes for graph-based prohibited structures (Q1125037) (← links)
- Weighted decomposition construction for perfect secret sharing schemes (Q1609153) (← links)
- Measuring, simulating and exploiting the head concavity phenomenon in BKZ (Q1633461) (← links)
- Optimal linear multiparty conditional disclosure of secrets protocols (Q1710680) (← links)
- Optimal information ratio of secret sharing schemes on Dutch windmill graphs (Q1726013) (← links)
- Shared generation of pseudo-random functions (Q1827581) (← links)
- Graph decompositions and secret sharing schemes (Q1842517) (← links)
- An efficient construction of perfect secret sharing schemes for graph-based structures (Q1912864) (← links)
- Recursive constructions for perfect secret sharing schemes (Q1962965) (← links)
- Secret sharing schemes based on the dual of Golay codes (Q2121024) (← links)
- Upslices, downslices, and secret-sharing with complexity of \(1.5^n\) (Q2129013) (← links)
- Quadratic secret sharing and conditional disclosure of secrets (Q2129018) (← links)
- Abelian sharing, common informations, and linear rank inequalities (Q2168805) (← links)
- Realizing secret sharing with general access structure (Q2282021) (← links)
- Secret-sharing for NP (Q2397445) (← links)
- Sharing multiple secrets: Models, schemes and analysis (Q2491290) (← links)
- Distributing the encryption and decryption of a block cipher (Q2572965) (← links)
- Secret Sharing Schemes for Dense Forbidden Graphs (Q2827736) (← links)
- Threshold Secret Sharing Requires a Linear Size Alphabet (Q3181037) (← links)
- How to Share a Secret, Infinitely (Q3181038) (← links)
- Dynamic Threshold Public-Key Encryption with Decryption Consistency from Static Assumptions (Q3194590) (← links)
- Evolving Perfect Hash Families: A Combinatorial Viewpoint of Evolving Secret Sharing (Q3297627) (← links)
- On Linear Secret Sharing for Connectivity in Directed Graphs (Q3540044) (← links)
- Probabilistic secret sharing (Q5005168) (← links)
- (Q5140836) (← links)
- Construction of arithmetic secret sharing schemes by using torsion limits (Q5160560) (← links)
- ON THE DEALER'S RANDOMNESS REQUIRED IN PERFECT SECRET SHARING SCHEMES WITH ACCESS STRUCTURES OF CONSTANT RANK (Q5249040) (← links)
- The combinatorics of generalised cumulative arrays (Q5443560) (← links)