Efficient Oblivious Sorting and Shuffling for Hardware Enclaves

ePrint Report: Efficient Oblivious Sorting and Shuffling for Hardware Enclaves

Tianyao Gu, Yilei Wang, Bingnan Chen, Afonso Tinoco, Elaine Shi, Ke Yi

Oblivious sorting is arguably the most important building block in the design of efficient oblivious algorithms. We propose new oblivious sorting algorithms for hardware enclaves. Our algorithms achieve asymptotic optimality in terms of both computational overhead and the number of page swaps the enclave has to make to fetch data from insecure memory or disk. We also aim …

algorithms block chen design eprint report hardware important oblivious report shi wang