On the Communication Complexity of Secret Key Generation in the Multiterminal Source Model

Communication complexity refers to the minimum rate of public communication required for generating a maximal-rate secret key (SK) in the multiterminal source model of Csiszar and Narayan. Tyagi recently characterized this communication complexity for a two-terminal system. We extend the ideas in Tyagi's work to derive a lower bound on communication complexity in the general multiterminal setting. In the important special case of the complete graph pairwise independent network (PIN) model, our bound allows us to determine the exact linear communication complexity, i.e., the communication complexity when the communication and SK are restricted to be linear functions of the randomness available at the terminals.

Converses For Secret Key Agreement and Secure Computing

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.

Soundings: the Newsletter of the Monterey Bay Chapter of the American Cetacean Society. 1980

(PDF contains 39 pages.)

Soundings: the Newsletter of the Monterey Bay Chapter of the American Cetacean Society. 1981

Missing the April issue. (PDF has 26 pages.)

Soundings: the Newsletter of the Monterey Bay Chapter of the American Cetacean Society. 1982

(PDF contains 34 pages.)

Soundings: the Newsletter of the Monterey Bay Chapter of the American Cetacean Society. 1983

(PDF contains 112 pages.)

Soundings: the Newsletter of the Monterey Bay Chapter of the American Cetacean Society. 1984

(PDF contains 96 pages.)

Soundings: the Newsletter of the Monterey Bay Chapter of the American Cetacean Society. 1985

(PDF contains 84 pages.)

Soundings: the Newsletter of the Monterey Bay Chapter of the American Cetacean Society. 1986

(PDF contains 62 pages.)

Soundings: the Newsletter of the Monterey Bay Chapter of the American Cetacean Society. 1987

Missing November issue. (PDF contains 62 pages.)

Soundings: the Newsletter of the Monterey Bay Chapter of the American Cetacean Society. 1988

Missing July, August, October issues. (PDF contains 56 pages.)

Soundings: the Newsletter of the Monterey Bay Chapter of the American Cetacean Society. 1989

Missing June issue. (PDF contains 50 pages.)

Soundings: the Newsletter of the Monterey Bay Chapter of the American Cetacean Society. 1990

(PDF contains 118 pages.)

Soundings: the Newsletter of the Monterey Bay Chapter of the American Cetacean Society. 1991

(PDF contains 120 pages.)