Efficient Private File Retrieval by Combining ORAM and PIR

@inproceedings{Mayberry2014EfficientPF,
  title={Efficient Private File Retrieval by Combining ORAM and PIR},
  author={Travis Mayberry and Erik-Oliver Blass and Agnes Hui Chan},
  booktitle={NDSS},
  year={2014}
}
Recent research results on tree-based Oblivious RAM by Shi et al. [15] obtain communication complexity of O(l · log(N)) in the worst-case for an N -capacity storage with blocks size l. The individual nodes in the tree, however, are constructed using traditional ORAMs which have worst-case communication complexity linear in their capacity and block size. PIR protocols are able to provide better worst-case bounds (decoupling capacity from block size), but have traditionally been less practical… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 51 CITATIONS, ESTIMATED 36% COVERAGE

FILTER CITATIONS BY YEAR

2013
2019

CITATION STATISTICS

  • 13 Highly Influenced Citations

  • Averaged 10 Citations per year over the last 3 years

References

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

Similar Papers

Loading similar papers…