Waks-On/Waks-Off: Fast Oblivious Offline/Online Shuffling and Sorting with Waksman Networks-Reference-Cited by-同舟云学术

Waks-On/Waks-Off: Fast Oblivious Offline/Online Shuffling and Sorting with Waksman Networks

Published:2023-11-15 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security
language:
Short-container-title:

Author:

Sasy Sajin¹^ORCID,Johnson Aaron²^ORCID,Goldberg Ian¹^ORCID

Affiliation:

1. University of Waterloo, Waterloo, ON, Canada

2. U.S. Naval Research Laboratory, Washington, DC, USA

Funder

Ontario Graduate Scholarships

Canada Research Chairs

Office of Naval Research

NSERC

Royal Bank of Canada

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3576915.3623133

Reference50 articles.

1. M. Ajtai, J. Komlós, and E. Szemerédi. 1983. An O(n log n) Sorting Network. In Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing (STOC).

2. Ittai Anati, Shay Gueron, Simon Johnson, and Vincent Scarlata. 2013. Innovative Technology for CPU Based Attestation and Sealing. https://software.intel.com/content/www/us/en/develop/articles/innovative-technology-for-cpu-based-attestation-and-sealing.html. Accessed May 2023.

3. SIAM J. Comput. (2022);Asharov Gilad

4. Sorting networks and their applications

5. Bruno Beauquier and Eric Darrot. 2002. On Arbitrary Size Waksman Networks and Their Vulnerability. Parallel Processing Letters (2002).

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Waks-On/Waks-Off: Fast Oblivious Offline/Online Shuffling and Sorting with Waksman Networks;Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security;2023-11-15