Can We Overcome the n log n Barrier for Oblivious Sorting? - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Wei-Kai Lin, Elaine Shi, Tiancheng Xie. Can We Overcome the n log n Barrier for Oblivious Sorting?. IACR Cryptology ePrint Archive, 2018:227, 2018. [doi]

@article{LinSX18,
  title = {Can We Overcome the n log n Barrier for Oblivious Sorting?},
  author = {Wei-Kai Lin and Elaine Shi and Tiancheng Xie},
  year = {2018},
  url = {http://eprint.iacr.org/2018/227},
  researchr = {https://researchr.org/publication/LinSX18},
  cites = {0},
  citedby = {0},
  journal = {IACR Cryptology ePrint Archive},
  volume = {2018},
  pages = {227},
}

runs on WebDSL