Secure Channel Simulation

TL;DR

This paper introduces a new inner bound for secure channel simulation using the OSRB framework, advancing the understanding of secure function computation and joint channel simulation with secret key generation.

Contribution

It presents a novel inner bound for secure channel simulation and extends existing bounds to include rate constraints on public discussion.

Findings

New inner bound for secure channel simulation established

Achievability result for joint channel simulation and secret key creation

Generalization of Gohari and Anantharam's lower bound with rate constraints

Abstract

In this paper the Output Statistics of Random Binning (OSRB) framework is used to prove a new inner bound for the problem of secure channel simulation. Our results subsume some recent results on the secure function computation. We also provide an achievability result for the problem of simultaneously simulating a channel and creating a shared secret key. A special case of this result generalizes the lower bound of Gohari and Anantharam on the source model to include constraints on the rates of the public discussion.