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]

Authors

Wei-Kai Lin

This author has not been identified. Look up 'Wei-Kai Lin' in Google

Elaine Shi

This author has not been identified. Look up 'Elaine Shi' in Google

Tiancheng Xie

This author has not been identified. Look up 'Tiancheng Xie' in Google