Paper 2024/1420
Privacy-Preserving Breadth-First-Search and Maximal-Flow
Abstract
We present novel Secure Multi-Party Computation (SMPC) protocols to perform Breadth-First-Searches (BFSs) and determine maximal flows on dense secret-shared graphs. In particular, we introduce a novel BFS protocol that requires only
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Proceedings of the 23rd Workshop on Privacy in the Electronic Society
- DOI
- 10.1145/3689943.3695041
- Keywords
- secure multi-party computationbreadth first searchmax flow
- Contact author(s)
-
ehrmanntraut @ itsec rwth-aachen de
meyer @ itsec rwth-aachen de - History
- 2024-09-11: approved
- 2024-09-11: received
- See all versions
- Short URL
- https://ia.cr/2024/1420
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/1420, author = {Vincent Ehrmanntraut and Ulrike Meyer}, title = {Privacy-Preserving Breadth-First-Search and Maximal-Flow}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/1420}, year = {2024}, doi = {10.1145/3689943.3695041}, url = {https://eprint.iacr.org/2024/1420} }