On the communication complexity of privacy-preserving information sharing protocols

Nan Zhang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

We address issues related to privacy protection in distributed information sharing systems where multiple autonomous entities share data across their private databases. Most existing solutions place restrictions on adversarial behavior in order to enable communication-efficient privacy-preserving information sharing. These restrictions substantially underestimate the capabilities of adversaries in reality, and do not always suffice for real systems. We consider a threat space containing more powerful adversaries, including not only semihonest but also malicious ones, and analyze the tradeoff between privacy protection and communication complexity in information sharing. In particular, we use Kolmogorov complexity to derive lower bounds on the communication complexity required to defend against various kinds of adversaries.

Original languageEnglish (US)
Title of host publicationISI 2007
Subtitle of host publication2007 IEEE Intelligence and Security Informatics
Pages289-295
Number of pages7
Publication statusPublished - Oct 1 2007
EventISI 2007: 2007 IEEE Intelligence and Security Informatics - New Brunswick, NJ, United States
Duration: May 23 2007May 24 2007

Publication series

NameISI 2007: 2007 IEEE Intelligence and Security Informatics

Other

OtherISI 2007: 2007 IEEE Intelligence and Security Informatics
CountryUnited States
CityNew Brunswick, NJ
Period5/23/075/24/07

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Control and Systems Engineering

Cite this

Zhang, N. (2007). On the communication complexity of privacy-preserving information sharing protocols. In ISI 2007: 2007 IEEE Intelligence and Security Informatics (pp. 289-295). [4258713] (ISI 2007: 2007 IEEE Intelligence and Security Informatics).