Oblivious RAM with Worst-Case Logarithmic Overhead. Asharov, G., Komargodski, I., Lin, W., & Shi, E. J. Cryptol., 36(2):7, 2023.
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
{"_id":"R9Bhn5tKeL9nvNKKn","bibbaseid":"asharov-komargodski-lin-shi-obliviousramwithworstcaselogarithmicoverhead-2023","author_short":["Asharov, G.","Komargodski, I.","Lin, W.","Shi, E."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Gilad"],"propositions":[],"lastnames":["Asharov"],"suffixes":[]},{"firstnames":["Ilan"],"propositions":[],"lastnames":["Komargodski"],"suffixes":[]},{"firstnames":["Wei-Kai"],"propositions":[],"lastnames":["Lin"],"suffixes":[]},{"firstnames":["Elaine"],"propositions":[],"lastnames":["Shi"],"suffixes":[]}],"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","bibtex":"@article{DBLP:journals/joc/AsharovKLS23,\n author = {Gilad Asharov and\n Ilan Komargodski and\n Wei{-}Kai Lin and\n Elaine Shi},\n title = {Oblivious {RAM} with Worst-Case Logarithmic Overhead},\n journal = {J. Cryptol.},\n volume = {36},\n number = {2},\n pages = {7},\n year = {2023},\n url = {https://doi.org/10.1007/s00145-023-09447-5},\n doi = {10.1007/S00145-023-09447-5},\n timestamp = {Mon, 03 Mar 2025 00:00:00 +0100},\n biburl = {https://dblp.org/rec/journals/joc/AsharovKLS23.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Asharov, G.","Komargodski, I.","Lin, W.","Shi, E."],"key":"DBLP:journals/joc/AsharovKLS23","id":"DBLP:journals/joc/AsharovKLS23","bibbaseid":"asharov-komargodski-lin-shi-obliviousramwithworstcaselogarithmicoverhead-2023","role":"author","urls":{"Paper":"https://doi.org/10.1007/s00145-023-09447-5"},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://dblp.org/pid/03/1108.bib","dataSources":["v4Wc7gjHT6uLXDrxj"],"keywords":[],"search_terms":["oblivious","ram","worst","case","logarithmic","overhead","asharov","komargodski","lin","shi"],"title":"Oblivious RAM with Worst-Case Logarithmic Overhead","year":2023}