Securely solving classical network flow problems

DOI10.1007/978-3-319-15943-0_13MaRDI QIDQ2942837zbMATH OpenOpenAlexFDO

Authors Abdelrahaman Aly, Mathieu Van Vyve

Publication date 11 September 2015

Published in Information Security and Cryptology - ICISC 2014 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-15943-0_13

zbMATH Keywords

multi-party computationnetwork flowssecure collaboration

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Deterministic network models in operations research (90B10) Cryptography (94A60)

Recommendations

• Solving Linear Programs Using Multiparty Computation
• Secure multi-party computation protocol for sequencing problem
• Secure multi-party computation solution to Yao's millionaires' problem based on set-inclusion
• Efficient secure multiparty computation protocol for sequencing problem over insecure channel
• Complexity and performance of secure floating-point polynomial evaluation protocols

Cited in

(2)

• scientific article; zbMATH DE number 2011627 (Why is no real title available?)
• Practically efficient secure single-commodity multi-market auctions

This page was built for publication: Securely solving classical network flow problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942837)