Two shannon-type problems on secure multi-party computations

Eun Jee Lee, Emmanuel Auguste Abbe

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

3 Scopus citations

Abstract

In secure multi-party computations (SMC), parties wish to compute a function on their private data without revealing more information about their data than what the function reveals. In this paper, we investigate two Shannontype questions on this problem. We first consider the traditional one-shot model for SMC which does not assume a probabilistic prior on the data. In this model, private communication and randomness are the key enablers to secure computing, and we investigate a notion of randomness cost and capacity. We then move to a probabilistic model for the data, and propose a Shannon model for discrete memoryless SMC. In this model, correlations among data are the key enablers for secure computing, and we investigate a notion of dependency which permits the secure computation of a function. While the models and questions are general, this paper focuses on summation functions and relies on polar code constructions.

Original languageEnglish (US)
Title of host publication2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1287-1293
Number of pages7
ISBN (Electronic)9781479980093
DOIs
StatePublished - Jan 30 2014
Event2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014 - Monticello, United States
Duration: Sep 30 2014Oct 3 2014

Publication series

Name2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014

Other

Other2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014
CountryUnited States
CityMonticello
Period9/30/1410/3/14

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Computer Science Applications

Fingerprint Dive into the research topics of 'Two shannon-type problems on secure multi-party computations'. Together they form a unique fingerprint.

Cite this