Randomized component based secure secret reconstruction in insecure networks
From MaRDI portal
Publication:2154040
Recommendations
- On Secret Reconstruction in Secret Sharing Schemes
- Structural Information and Communication Complexity
- On private computation in incomplete networks
- An efficient construction of secure network coding
- Secure Error-Correction Network Coding in a Randomized Setting
- Secret sharing with secure secret reconstruction
- scientific article; zbMATH DE number 1031004
- Information security in a random network coding network
- A general decomposition construction for incomplete secret sharing schemes
Cites work
- A modular approach to key safeguarding
- Communication Theory of Secrecy Systems*
- Constructing ideal secret sharing schemes based on Chinese remainder theorem
- Dynamic threshold secret reconstruction and its application to the threshold cryptography
- How to share a secret
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- Multilevel threshold secret sharing based on the Chinese remainder theorem
- Secret sharing with secure secret reconstruction
- Security analysis of a dynamic threshold secret sharing scheme using linear subspace method
- Threshold changeable secret sharing with secure secret reconstruction
Cited in
(3)
This page was built for publication: Randomized component based secure secret reconstruction in insecure networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2154040)