Assisted Common Information with an Application to Secure Two-Party Sampling

In this paper we generalize the notion of common information of two dependent variables introduced by Gács & K\"orner. They defined common information as the largest entropy rate of a common random variable two parties observing one of the sources each can agree upon. It is well-known that...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2014-03
Hauptverfasser:	Prabhakaran, Vinod M, Prabhakaran, Manoj M
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Cryptography and Security Computer Science - Information Theory Cryptography Dependence Dependent variables Entropy (Information theory) Information systems Mathematics - Information Theory Random variables Sampling Upper bounds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!