We present a highly-scalable secure computation of graph algorithms, which hides all information about the topology of the graph or other input values associated with nodes or edges. The setting is where all nodes and edges of the graph are secret-shared between multiple servers, and a secure computation protocol is run between these servers. While the method is general, we demonstrate it in a 3-server setting with an honest majority, with either semi-honest security or full security. A major technical contribution of our work is replacing the usage of secure sort protocols with secure shuffles, which are much more efficient. Full security against malicious behavior is achieved by adding an efficient verification for the shuffle operation, and computing circuits using fully secure protocols. We demonstrate the applicability of this technology by implementing two major algorithms: computing breadth-first search (BFS), which is also useful for contact tracing on private contact graphs, and computing maximal independent set (MIS). We implement both algorithms, with both semi-honest and full security, and run them within seconds on graphs of millions of elements.
|Title of host publication||CCS 2021 - Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security|
|Publisher||Association for Computing Machinery|
|Number of pages||20|
|State||Published - 12 Nov 2021|
|Event||27th ACM Annual Conference on Computer and Communication Security, CCS 2021 - Virtual, Online, Korea, Republic of|
Duration: 15 Nov 2021 → 19 Nov 2021
|Name||Proceedings of the ACM Conference on Computer and Communications Security|
|Conference||27th ACM Annual Conference on Computer and Communication Security, CCS 2021|
|Country/Territory||Korea, Republic of|
|Period||15/11/21 → 19/11/21|
Bibliographical noteFunding Information:
∗Kazuma Ohara worked on this project while he was at NEC. †The work pf Benny Pinkas and Hanan Rosemarin was partly supported by the BIU Center for Research in Applied Cryptography and Cyber Security in conjunction with the Israel National Cyber Bureau in the Prime Minister’s Office.
© 2021 ACM.
- oblivious shuffle
- oblivious sort
- secure multi-party computation