On Private Computation in Incomplete Networks

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

Suppose that some parties are connected by an incomplete network of reliable and private channels. The parties cooperate to execute some protocol. However, the parties are curious - after the protocol terminates each processor tries to learn information from the communication it heard. We say that a function can be computed privately in a network if there is a protocol in which each processor learns only the information implied by its input and the output of the protocol. The question we address in this paper is what functions can be computed privately in a given incomplete network. It is known that if a network is 2-connected then every pair of parties can communicate privately. Thus, the question is interesting only for non-2-connected networks. We first characterize the functions that can be computed privately in simple networks - networks with one separating vertex and two 2-connected components. We then deal with private computations in arbitrary networks: we reduce this question to private computations of related functions on trees, and give sufficient and necessary conditions on the functions that can be computed privately on trees.

Original languageEnglish
Title of host publicationStructural Information and Communication Complexity
Subtitle of host publication12th International Colloquium, SIROCCO 2005
EditorsAndrzej Pelc, Michel Raynal
PublisherSpringer
Pages18-33
Number of pages16
ISBN (Print)9783540260523
DOIs
StatePublished - 2005
Event12 International Colloquium on Structural Information and Communication Complexity, SIROCCO 2005 - Mont Saint-Michel, France
Duration: 24 May 200526 May 2005

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Verlag
Volume3499
ISSN (Print)0302-9743

Conference

Conference12 International Colloquium on Structural Information and Communication Complexity, SIROCCO 2005
Country/TerritoryFrance
CityMont Saint-Michel
Period24/05/0526/05/05

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'On Private Computation in Incomplete Networks'. Together they form a unique fingerprint.

Cite this