The following pages link to (Q3202940):
Displaying 50 items.
- Secret-sharing schemes for very dense graphs (Q290386) (← links)
- Ideal multipartite secret sharing schemes (Q434350) (← links)
- Secret sharing schemes for compartmented access structures (Q520077) (← links)
- An ideal multi-secret sharing scheme based on MSP (Q543828) (← links)
- Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures (Q596095) (← links)
- Visual cryptography on graphs (Q626454) (← links)
- Restricted adaptive oblivious transfer (Q650878) (← links)
- On the information rate of secret sharing schemes (Q672750) (← links)
- Lower bounds for monotone span programs (Q677989) (← links)
- Efficient robust secret sharing from expander graphs (Q680925) (← links)
- Optimal complexity of secret sharing schemes with four minimal qualified subsets (Q717150) (← links)
- Blocked linear secret sharing scheme for scalable attribute based encryption in manageable cloud storage system (Q781154) (← links)
- FROST: Flexible round-optimized Schnorr threshold signatures (Q832324) (← links)
- All inequalities for the relative entropy (Q883003) (← links)
- Rearrangements of access structures and their realizations in secret sharing schemes (Q947807) (← links)
- Ideal secret sharing schemes whose minimal qualified subsets have at most three participants (Q1009166) (← links)
- Hypergraph decomposition and secret sharing (Q1028420) (← links)
- Monotone circuits for monotone weighted threshold functions (Q1044746) (← links)
- Secret sharing schemes for graph-based prohibited structures (Q1125037) (← links)
- On the classification of ideal secret sharing schemes (Q1180513) (← links)
- Some improved bounds on the information rate of perfect secret sharing schemes (Q1202917) (← links)
- Strongly ideal secret sharing schemes (Q1202922) (← links)
- An explication of secret sharing schemes (Q1203951) (← links)
- Ideal homomorphic secret sharing schemes over cyclic groups (Q1286658) (← links)
- On the size of shares for secret sharing schemes (Q1310452) (← links)
- Geometric secret sharing schemes and their duals (Q1321560) (← links)
- Anonymous secret sharing schemes (Q1364776) (← links)
- Sharing one secret vs. sharing many secrets. (Q1401235) (← links)
- Protecting data privacy in private information retrieval schemes (Q1577014) (← links)
- Probability of shares in secret sharing schemes (Q1607017) (← links)
- Weighted decomposition construction for perfect secret sharing schemes (Q1609153) (← links)
- Cutting-edge cryptography through the lens of secret sharing (Q1627968) (← links)
- On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate (Q1629415) (← links)
- Adaptively secure distributed PRFs from LWE (Q1631339) (← links)
- Towards breaking the exponential barrier for general secret sharing (Q1648814) (← links)
- On the information ratio of non-perfect secret sharing schemes (Q1688395) (← links)
- Timed-release computational secret sharing and threshold encryption (Q1692147) (← links)
- Combinatorial repairability for threshold schemes (Q1692160) (← links)
- Optimal information ratio of secret sharing schemes on Dutch windmill graphs (Q1726013) (← links)
- Randomness in secret sharing and visual cryptography schemes (Q1826638) (← links)
- Shared generation of pseudo-random functions (Q1827581) (← links)
- Graph decompositions and secret sharing schemes (Q1842517) (← links)
- Lower bounds on the information rate of secret sharing schemes with homogeneous access structure. (Q1853095) (← links)
- An efficient construction of perfect secret sharing schemes for graph-based structures (Q1912864) (← links)
- Recursive constructions for perfect secret sharing schemes (Q1962965) (← links)
- Finding the maximal adversary structure from any given access structure (Q1999100) (← links)
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\) (Q2043324) (← links)
- Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes (Q2055621) (← links)
- Decentralized multi-authority \textbf{\textsf{ABE}} for \textbf{\textsf{DNF}}s from \textbf{\textsf{LWE}} (Q2056681) (← links)
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings (Q2061939) (← links)
