Secure Channel Simulation
Information Theory
2012-07-17 v1 math.IT
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.
Cite
@article{arxiv.1207.3513,
title = {Secure Channel Simulation},
author = {Amin Gohari and Mohammad Hossein Yassaee and Mohammad Reza Aref},
journal= {arXiv preprint arXiv:1207.3513},
year = {2012}
}
Comments
Short version to appear at ITW 2012. This will be replaced by a longer version soon