\textsf{SoK}: on cryptography for multi-cloud storage
From MaRDI portal
Publication:7348983
Cites work
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
- All-or-nothing encryption and the package transform
- Building secure file systems out of Byzantine storage
- Byzantine quorum systems
- Cryptography made simple
- Divertible protocols and atomic proxy cryptography
- Efficient dispersal of information for security, load balancing, and fault tolerance
- Erasure coding vs. replication: A quantitative comparison
- Exposure-resilient functions and all-or-nothing transforms
- How to share a secret
- Network Coding for Distributed Storage Systems
- On the security of the threshold scheme based on the Chinese remainder theorem
- On the security properties of OAEP as an all-or-nothing transform
- Optimal asymmetric encryption
- Revisiting and extending the AONT-RS scheme: a robust computationally secure secret sharing scheme
- Secret sharing made short
- Secret sharing: a comprehensive survey, taxonomy and applications
- Security of Ramp Schemes
- Something about all or nothing (transforms)
This page was built for publication: \textsf{SoK}: on cryptography for multi-cloud storage
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7348983)