Assisted common information: Further results

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2011, Pages 2861-2865

  Prabhakaran, Vinod M ^a   Prabhakaran, Manoj M ^b  

^a EPFL   (Switzerland)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMON INFORMATION; CRYPTOGRAPHIC PRIMITIVES; MONOTONICITY PROPERTY; OBLIVIOUS TRANSFER; SECURE MULTI-PARTY COMPUTATION; SOURCE-CODING; UPPER BOUND;

INFORMATION THEORY;

RANDOM VARIABLES;

EID: 80054795248     PISSN: 21578104     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2011.6034098     Document Type: Conference Paper

References (20)

1. D. Beaver, "Correlated pseudorandomness and the complexity of private computations", in Proc. 28th STOC, pp. 479-488. ACM, 1996.
2. I. Csiszár and R. Ahlswede, "On oblivious transfer capacity", in Proc. International Symposium on Information Theory (ISIT), pp. 2061-2064, 2007.
3. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memorless Systems, Akadémiai Kiadó, Budapest, 1981.
4. Y. Dodis and S. Micali, "Lower bounds for oblivious transfer reductions", in Jacques Stern, editor, EUROCRYPT, vol. 1592 of Lecture Notes in Computer Science, pp. 42-55. Springer, 1999.
5. P. Gács and J. Körner, "Common information is far less than mutual information", Problems of Control and Information Theory, 2(2):119-162, 1973.
6. R. M. Gray and A. D. Wyner, "Source coding for a simple network", Bell System Technical Journal, vol. 53, pp. 16811721, 1974.
7. H. Imai, K. Morozov, and A. C. A. Nascimento, "On the oblivious transfer capacity of the erasure channel", in Proc. International Symposium on Information Theory (ISIT), pp. 1428-1431, 2006.
8. H. Imai, K. Morozov, and A. C. A. Nascimento, "Efficient oblivious transfer protocols achieving a non-zero rate from any non-trivial noisy correlation", in International Conference on Information Theoretic Security (ICITS), 2007.
9. H. Imai, K. Morozov, A. C. A. Nascimento, and A. Winter, "Efficient protocols achieving the commitment capacity of noisy correlations", in International Symposium on Information Theory (ISIT), pp. 1432-1436, 2006.
10. H. Imai, J. Müller-Quade, A. C. A. Nascimento, and A. Winter, "Rates for bit commitment and coin tossing from noisy correlation", in International Symposium on Information Theory (ISIT), pp. 45-, 2004.
11. S. Kamath and V. Anantharam, "A new dual to the Gács- Körner common information defined via the Gray-Wyner system", in Proc. 48th Allerton Conf. on Communication, Control, and Computing, pp. 1340-1346, 2010.
12. D. Marco and M. Effros, "On lossless coding with coded side information", IEEE Transactions on Information Theory, vol. 55, no. 7, pp. 3284-3296, 2009.
13. V. M. Prabhakaran and M. Prabhakaran, "Assisted common information", in International Symposium on Information Theory (ISIT), pp. 2602-2606, 2010. Extended draft available at http://arxiv.org/abs/1002.1916.
14. V. M. Prabhakaran and M. Prabhakaran, "Assisted common information: further results", Extended draft available at http://arxiv.org/abs/1105. 6163
15. S. Winkler and J. Wullschleger. "Statistical impossibility results for oblivious transfer reductions", Cryptology ePrint Archive, Report 2009/508, 2009. http://eprint.iacr.org/.
16. A. Winter, A. C. A. Nascimento, and H. Imai. "Commitment capacity of discrete memoryless channels", In Kenneth G. Paterson, editor, IMA Int. Conf., vol. 2898 of Lecture Notes in Computer Science, pp. 35-51. Springer, 2003.
17. H. S. Witsenhausen, "On sequences of pairs of dependent random variables", SIAM Journal of Applied Mathematics, 28:100-113, 1975.
18. S. Wolf and J. Wullschleger. "New monotones and lower bounds in unconditional two-party computation", IEEE Transactions on Information Theory, 54(6):2792-2797, 2008.
19. J. Wullschleger. Oblivious-Transfer Amplification. Ph. D. thesis, Swiss Federal Institute of Technology, Zürich. http://arxiv.org/abs/cs/0608076.
20. A. D. Wyner, "The common information of two dependent random variables", IEEE Transactions on Information Theory, 21(2), 163-179, 1975.