A Secure and Fast Dispersal Storage Scheme Based on the Learning with Errors Problem

@inproceedings{Yang2016ASA,
  title={A Secure and Fast Dispersal Storage Scheme Based on the Learning with Errors Problem},
  author={Ling Yang and Fuyang Fang and Xianhui Lu and Wen Tao Zhu and Qiongxiao Wang and Shen Yan and Shiran Pan},
  booktitle={IACR Cryptology ePrint Archive},
  year={2016}
}
Data confidentiality and availability are of primary concern in data storage. Dispersal storage schemes achieve these two security properties by transforming the data into multiple codewords and dispersing them across multiple storage servers. Existing schemes achieve confidentiality and availability by various cryptographic and coding algorithms, but only under the assumption that an adversary cannot obtain more than a certain number of codewords. Meanwhile existing schemes are designed for… CONTINUE READING
BETA

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 24 REFERENCES

Quantum cryptography: Know your enemy

  • Marcos Curty
  • Nature Physics,
  • 2014
1 Excerpt

Similar Papers

Loading similar papers…