Can We Overcome the n log n Barrier for Oblivious Sorting?

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]

Possibly Related Publications

The following publications are possibly variants of this publication: