A new upperbound for the oblivious transfer capacity of discrete memoryless channels

2014 IEEE Information Theory Workshop, ITW 2014

Volumn , Issue , 2014, Pages 35-39

  Rao, K Sankeerth ^a   Prabhakaran, Vinod M ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

^b TATA INSTITUTE OF FUNDAMENTAL RESEARCH   (India)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY;

CHANNEL MODEL; DISCRETE MEMORYLESS CHANNELS; MONOTONICITY PROPERTY; OBLIVIOUS TRANSFER; SECURE COMPUTATION; SOURCE MODELING; TENSION REGION; UPPER BOUND;

COMPUTATION THEORY;

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

References (16)

1. R. Ahlswede and I. Csiszár, "On oblivious transfer capacity," Information Theory, Combinatorics, and Search Theory, LNCS, vol. 7777, pp. 145-166, 2013.
2. D. Beaver "Precomputing oblivious transfer," CRYPTO 1995, LNCS, vol. 963, pp. 97-109, 1995.
3. M. Ben-Or, S. Goldwasser, and A.Wigderson, "Completeness theorems for non-cryptographic fault-tolerant distributed computation," 20th Annual Symposium on Theory of Computing, pp. 1-10, 1988.
4. D. Chaum, C. Crépeau, and I. Damgard, "Multiparty unconditionally secure protocols," 20th Annual Symposium on Theory of Computing, pp. 11-19, 1988.
5. C. Crépeau and J. Kilian, "Achieving oblivious transfer using weakened security assumptions," 29th Annual Symposium on Foundations of Computer Science, pp. 42-52, 1988.
6. P. Gács and J. Körner, "Common information is far less than mutual information," Problems of Control and Information Theory, vol. 2, no. 2, pp. 119-162, 1973.
7. D. Harnik, Y. Ishai, and E. Kushilevitz, "How many oblivious transfers are needed for secure multiparty computation?" CRYPTO 2007, LNCS, vol. 4622, pp. 284-302.
8. H. Imai, K. Morozov, and A. C. A. Nascimento, "On the oblivious transfer capacity of the erasure channel," IEEE International Symposium on Information Theory, pp. 1428-1431, 2006.
9. H. Imai, K. Morozov, and A. C. A. Nascimento, "Efficient oblivious transfer protocols achieving a non-zero rate from any non-trivial noisy correlation," ICITS 2007, LNCS, vol. 4883, pp. 183-194.
10. Y. Ishai, E. Kushilevitz, R. Ostrovsky, Rafail, M. Prabhakaran, A. Sahai, and J. Wullschleger, "Constant-rate oblivious transfer from noisy channels," CRYPTO 2011, LNCS, vol. 6841, pp. 667-684.
11. J. Kilian, "Founding cryptography on oblivious transfer," 20th Annual Symposium on Theory of Computing, pp. 20-31, 1988.
12. E. Kushilevitz, "Privacy and communication complexity," SIAM Journal on Discrete Mathematics, vol. 5, no. 2, pp. 273-284, 1992.
13. M. Mishra, B. K. Dey, V. M. Prabhakaran, and S. Diggavi, "The oblivious transfer capacity of the wiretapped binary erasure channel," IEEE International Symposium on Information Theory (ISIT), pp. 1539-1543, 2014.
14. A. C. A. Nascimento and A. Winter, "On the oblivious-transfer capacity of noisy resources," IEEE Trans. Inform. Theory, vol. 54, no. 6, pp. 2572-2581, 2008.
15. A. C. B. Pinto, R. Dowsley, K. Morozov, A.C.A. Nascimento, "Achieving oblivious transfer capacity of generalized erasure channels in the malicious model," IEEE Trans. Inform. Theory, vol. 57, no. 8, pp. 5566-5571, 2011.
16. M. M. Prabhakaran and V. M. Prabhakaran, "On secure multiparty sampling for more than two parties," IEEE Information Theory Workshop (ITW), pp. 99-103, Sept. 2012.