The following pages link to (Q3689094):
Displaying 18 items.
- Ideal multipartite secret sharing schemes (Q434350) (← links)
- Fully dynamic secret sharing schemes (Q671527) (← links)
- On the information rate of secret sharing schemes (Q672750) (← links)
- Strong \((n, t, n)\) verifiable secret sharing scheme (Q991242) (← links)
- Distributed user identification by zero-knowledge access rights proving (Q1183478) (← links)
- Secret sharing over infinite domains (Q1261017) (← links)
- On the size of shares for secret sharing schemes (Q1310452) (← links)
- On the information ratio of non-perfect secret sharing schemes (Q1688395) (← links)
- Fair hierarchical secret sharing scheme based on smart contract (Q2055532) (← links)
- Strong security of linear ramp secret sharing schemes with general access structures (Q2203603) (← links)
- Efficient explicit constructions of compartmented secret sharing schemes (Q2334444) (← links)
- Secret sharing based on a hard-on-average problem (Q2369061) (← links)
- An efficient threshold group signature scheme (Q2570718) (← links)
- Orthogonal matrix and its application in Bloom's threshold scheme (Q2631929) (← links)
- Dynamic and Verifiable Hierarchical Secret Sharing (Q2953806) (← links)
- Ideal Secret Sharing Schemes for Useful Multipartite Access Structures (Q3005583) (← links)
- Access structures determined by uniform polymatroids (Q6085192) (← links)
- Ideal uniform multipartite secret sharing schemes (Q6192308) (← links)
