Revisiting and Extending the AONT-RS Scheme: A Robust Computationally Secure Secret Sharing Scheme
From MaRDI portal
Publication:4975177
DOI10.1007/978-3-319-57339-7_3zbMath1367.94355OpenAlexW2576288169MaRDI QIDQ4975177
Publication date: 4 August 2017
Published in: Progress in Cryptology - AFRICACRYPT 2017 (Search for Journal in Brave)
Full work available at URL: http://epubs.surrey.ac.uk/813930/1/AfricaCrypt.pdf
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How to share a secret with cheaters
- Efficient, XOR-based, ideal \((t,n)\)-threshold schemes
- Secret-Sharing Schemes: A Survey
- How to share a secret
- Polynomial Codes Over Certain Finite Fields
- Efficient dispersal of information for security, load balancing, and fault tolerance
- All-or-nothing encryption and the package transform
- On secret sharing systems
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
This page was built for publication: Revisiting and Extending the AONT-RS Scheme: A Robust Computationally Secure Secret Sharing Scheme