Oblivious RAM with Worst-Case Logarithmic Overhead. Asharov, G., Komargodski, I., Lin, W., & Shi, E. J. Cryptol., 36(2):7, 2023.
Oblivious RAM with Worst-Case Logarithmic Overhead [link]Paper  doi  bibtex   
@article{DBLP:journals/joc/AsharovKLS23,
  author       = {Gilad Asharov and
                  Ilan Komargodski and
                  Wei{-}Kai Lin and
                  Elaine Shi},
  title        = {Oblivious {RAM} with Worst-Case Logarithmic Overhead},
  journal      = {J. Cryptol.},
  volume       = {36},
  number       = {2},
  pages        = {7},
  year         = {2023},
  url          = {https://doi.org/10.1007/s00145-023-09447-5},
  doi          = {10.1007/S00145-023-09447-5},
  timestamp    = {Mon, 03 Mar 2025 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/joc/AsharovKLS23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0