Secure channel simulation

2012 IEEE Information Theory Workshop, ITW 2012

Volumn , Issue , 2012, Pages 406-410

  Gohari, Amin ^a   Yassaee, Mohammad Hossein ^a   Aref, Mohammad Reza ^a  

^a SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

[No Author keywords available]

Indexed keywords

ACHIEVABILITY; LOWER BOUNDS; RANDOM BINNING; SECURE CHANNELS; SHARED SECRETS; SOURCE MODELS;

INFORMATION THEORY;

EID: 84873149214     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.2012.6404703     Document Type: Conference Paper

References (8)

1. R. Ahlswede and I. Csiszar, "Common Randomness in Information Theory and Cryptography. Part I: Secret sharing," IEEE Trans. IT, 39 (4), 1121-1132, 1993.
2. A. D. Wyner, "The wire-tap channel," Bell Syst. Tech. J., 54 (8), 1355-1387, 1975.
3. H. Tyagi, P. Narayan and P. Gupta, "When Is a Function Securely Computable?," IEEE Trans. IT, 57(10), 6337-6350, 2011.
4. H. Tyagi, "Distributed Computing With Privacy", IEEE Symposium On Information Theory (ISIT) 2012.
5. M. H. Yassaee, A. Gohari and M. R. Aref, "Channel Simulation via interactive Communications," IEEE Symposium On Information Theory (ISIT) 2012, pp. 3058-3062.
6. M. H. Yassaee, M. R. Aref and A. Gohari, "Achievability Proof via Output Statistics of Random Binning," IEEE Symposium On Information Theory (ISIT) 2012, pp. 1049-1053.
7. A. Gohari and V. Anantharam, "Information-theoretic key agreement of multiple terminals: part I," IEEE Trans. IT, 56(8): 3973-3996 (2010).
8. A. Gohari, M. H. Yassaee and M. R. Aref, "Secure Channel Simulation," arXiv:1207.3513.