In this work, we present fast, fully oblivious algorithms for compaction and shuffling. Such obliviousness would eliminate the threat of leaking private information through memory or timing side channels, but achieving it naively can result in a significant performance cost. However, due to advances in TEE side-channel attacks, these primitives, and the applications that use them, should be fully oblivious that is, perform instruction sequences and memory accesses that do not depend on the secret inputs. Such frameworks often use compaction and shuffling as core primitives. Several privacy-preserving analytics frameworks have been proposed that use trusted execution environments (TEEs) like Intel SGX. In Proceedings of the 29th ACM Conference on Computer and Communications Security (CCS 2022), November 2022. Sajin Sasy, Aaron Johnson, and Ian Goldberg Full version of CCS 2022 conference paper, including (1) appendices with proofs and experimental details, and (2) small corrections and improvements to the pseudocode for BORPStream (Figures 9 and 10).Fast Fully Oblivious Compaction and Shuffling.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |