ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Converses For Secret Key Agreement and Secure Computing

Tyagi, Himanshu and Watanabe, Shun (2015) Converses For Secret Key Agreement and Secure Computing. In: IEEE TRANSACTIONS ON INFORMATION THEORY, 61 (9). pp. 4809-4827.

[img] PDF
IEEE_Tra_on_Inf_The_61-9_4809_2015.pdf - Published Version
Restricted to Registered users only

Download (468kB) | Request a copy
Official URL: http://dx.doi.org/10.1109/TIT.2015.2457926

Abstract

We consider information theoretic secret key (SK) agreement and secure function computation by multiple parties observing correlated data, with access to an interactive public communication channel. Our main result is an upper bound on the SK length, which is derived using a reduction of binary hypothesis testing to multiparty SK agreement. Building on this basic result, we derive new converses for multiparty SK agreement. Furthermore, we derive converse results for the oblivious transfer problem and the bit commitment problem by relating them to SK agreement. Finally, we derive a necessary condition for the feasibility of secure computation by trusted parties that seek to compute a function of their collective data, using an interactive public communication that by itself does not give away the value of the function. In many cases, we strengthen and improve upon previously known converse bounds. Our results are single-shot and use only the given joint distribution of the correlated observations. For the case when the correlated observations consist of independent and identically distributed (in time) sequences, we derive strong versions of previously known converses.

Item Type: Journal Article
Publication: IEEE TRANSACTIONS ON INFORMATION THEORY
Publisher: IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Additional Information: Copy right for this article belongs to the IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 445 HOES LANE, PISCATAWAY, NJ 08855-4141 USA
Keywords: Hypothesis testing; secret key agreement; secure two-party computation; single-shot converse
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited: 24 Sep 2015 04:44
Last Modified: 24 Sep 2015 04:44
URI: http://eprints.iisc.ac.in/id/eprint/52387

Actions (login required)

View Item View Item