Assisted common information

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2010, Pages 2602-2606

  Prabhakaran, Vinod ^a   Prabhakaran, Manoj ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

CENTRAL PROBLEMS; COMMON INFORMATION; DISTRIBUTED RANDOM VARIABLES; MONOTONICITY PROPERTY; SECURE MULTI-PARTY COMPUTATION; UPPER BOUND;

CRYPTOGRAPHY; GALLIUM; INFORMATION THEORY;

RANDOM VARIABLES;

EID: 77955677556     PISSN: 21578103     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2010.5513743     Document Type: Conference Paper

References (21)

1. R. Ahlswede and J. Körner, "On common information and related characteristics of correlated information sources," in Proc. of the 7th Prague Conference on Information Theory, 1974.
2. D. Beaver, "Correlated pseudorandomness and the complexity of private computations," in Proc. 28th STOC, pp. 479-488. ACM, 1996.
3. D. Beaver, "Precomputing oblivious transfer," in Don Coppersmith, editor, CRYPTO, vol. 963 of Lecture Notes in Computer Science, pp. 97-109. Springer, 1995.
4. I. Csiszár and R. Ahlswede, "On oblivious transfer capacity," in Proc. International Symposium on Information Theory (ISIT), pp. 2061-2064, 2007.
5. 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.
6. 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.
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, A. C. A. Nascimento, and A. Winter, "Efficient protocols achieving the commitment capacity of noisy correlations," in International Symposium on Information Theory (ISIT), pages 1432-1436, 2006.
9. 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), pages 45-, 2004.
10. J. Kilian, "Founding cryptography on oblivious transfer," in Proc. STOC, pp. 20-31. ACM, 1988.
11. J. Kilian, "More general completeness theorems for secure two-party computation," in Proc. 32th STOC, pp. 316-324. ACM, 2000.
12. H. Maji, M. Prabhakaran, V. Prabhakaran, and M. Rosulek, "On cryptographic capacity," work in progress.
13. V. Prabhakaran and M. Prabhakaran, "Assisted common information with applications to secure two-party computation," arXiv:1002.1916 [cs.IT] http://arxiv.org/abs/1002.1916
14. S. Winkler and J. Wullschleger. "Statistical impossibility results for oblivious transfer reductions," Cryptology ePrint Archive, Report 2009/508, 2009. http://eprint.iacr.org/.
15. 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.
16. H. S. Witsenhausen, "On sequences of pairs of dependent random variables," SIAM Journal of Applied Mathematics, 28:100-113, 1975.
17. 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.
18. J. Wullschleger. Oblivious-Transfer Amplification. Ph.D. thesis, Swiss Federal Institute of Technology, Zürich. http://arxiv.org/abs/cs.CR/ 0608076.
19. A. D. Wyner, "The common information of two dependent random variables," IEEE Transactions on Information Theory, 21(2),163-179, 1975.
20. A. D. Wyner and J. Ziv, "Rate-distortion function for source coding with side information at the decoder," IEEE Transactions on Information Theory, 22(1):1-11, 1976.
21. H. Yamamoto, "Coding theorems for Shannon's cipher system with correlated source outputs, and common information," IEEE Transactions on Information Theory, 40(1):85-95, 1994