Generic Efficient Dynamic Proofs of Retrievability

@article{Etemad2015GenericED,
  title={Generic Efficient Dynamic Proofs of Retrievability},
  author={Mohammad Etemad and Alptekin K{\"u}pç{\"u}},
  journal={IACR Cryptology ePrint Archive},
  year={2015},
  volume={2015},
  pages={880}
}
Together with its great advantages, cloud storage brought many interesting security issues to our attention. Since 2007, with the first efficient storage integrity protocols Proofs of Retrievability (PoR) of Juels and Kaliski, and Provable Data Possession (PDP) of Ateniese et al., many researchers worked on such protocols. The difference among PDP and PoR models were greatly debated. The first DPDP scheme was shown by Erway et al. in 2009, while the first DPoR scheme was created by Cash et al… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-9 OF 9 REFERENCES

Similar Papers

Loading similar papers…