Private computation: \(k\)-connected versus 1-connected networks

DOI10.1007/S00145-005-0329-XzbMath1103.68507OpenAlexW2128311326MaRDI QIDQ850501

Markus Bläser, Andreas Jakoby, Bodo Manthey, Maciej Liśkiewicz

Publication date: 3 November 2006

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-005-0329-x

zbMATH Keywords

connectivity of communication networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Data encryption (aspects in computer science) (68P25)

Related Items (4)

Oblivious transfer in incomplete networks ⋮ Is information-theoretic topology-hiding computation possible? ⋮ Privacy in non-private environments ⋮ Must the communication graph of MPC protocols be an expander?

This page was built for publication: Private computation: \(k\)-connected versus 1-connected networks