Private computation: \(k\)-connected versus 1-connected networks
type: Item
instance of: scholarly article
title: Private computation: \(k\)-connected versus 1-connected networks
zbMATH Open document ID: 1103.68507
author: Markus Bläser
author: Andreas Jakoby
author: Bodo Manthey
author: Maciej Liśkiewicz
published in: Journal of Cryptology
publication date: 2006-11-03T00:00:00Z
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 68M10
zbMATH DE Number: 5070711
zbMATH Keywords: connectivity of communication networks
MaRDI profile type: Publication
full work available at URL: s00145-005-0329-x
OpenAlex ID: W2128311326
DOI: 10.1007/S00145-005-0329-X
Recommended article: Q4409119
Recommended article: Q4418642
Recommended article: Structural Information and Communication Complexity
Recommended article: On private computation in incomplete networks
Recommended article: On communication protocols that compute almost privately
Recommended article: On Communication Protocols That Compute Almost Privately
Recommended article: Q4550483
Recommended article: Private computation of polynomials over networks
Recommended article: On the computational complexities of three problems related to a privacy measure for large networks under active attack
Recommended article: Distributed Private Data Analysis
description: scientific article; zbMATH DE number 5070711