Pages that link to "Item:Q1710679"
From MaRDI portal
The following pages link to Constructing ideal secret sharing schemes based on Chinese remainder theorem (Q1710679):
Displaying 13 items.
- A wireless secret key generation method based on Chinese remainder theorem in FDD systems (Q439844) (← links)
- Randomized component based secure secret reconstruction in insecure networks (Q2154040) (← links)
- Homomorphic extensions of CRT-based secret sharing (Q2197441) (← links)
- On the asymptotic idealness of the Asmuth-Bloom threshold secret sharing scheme (Q2198255) (← links)
- A new threshold changeable secret sharing scheme based on the Chinese remainder theorem (Q2200703) (← links)
- Secret sharing schemes for infinite sets of participants: a new design technique (Q2227498) (← links)
- Chinese remainder theorem-based secret image sharing with small-sized shadow images (Q2333658) (← links)
- Sharing DSS by the Chinese remainder theorem (Q2349622) (← links)
- A scheme for threshold multi-secret sharing (Q2485603) (← links)
- Ramp scheme based on CRT for polynomial ring over finite field (Q2699255) (← links)
- General secret sharing based on the Chinese remainder theorem with applications in e-voting (Q2866729) (← links)
- A novel secret sharing scheme based on Shamir’s secret sharing scheme over field extensions (Q6058130) (← links)
- A perfect secret sharing scheme for general access structures (Q6118655) (← links)
