Assisted common information with an application to secure two-party sampling

IEEE Transactions on Information Theory

Volumn 60, Issue 6, 2014, Pages 3413-3434

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

^a TATA INSTITUTE OF FUNDAMENTAL RESEARCH   (India)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

Common information; oblivious transfer; secure multiparty computation; Wyner Ziv coding

Indexed keywords

CRYPTOGRAPHY; GALLIUM; RANDOM VARIABLES;

COMMON INFORMATION; DIFFERENT DISTRIBUTIONS; JOINTLY DISTRIBUTED RANDOM VARIABLES; MONOTONICITY PROPERTY; OBLIVIOUS TRANSFER; SECURE MULTI-PARTY COMPUTATION; WYNER'S COMMON INFORMATIONS; WYNER-ZIV CODING;

IMPORTANCE SAMPLING;

EID: 84901268112     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2014.2316011     Document Type: Article

References (34)

1. R. Ahlswede and J. Körner, "On common information and related characteristics of correlated information sources," in Proc. 7th Prague Conf. Inf. Theory, 1974.
2. D. Beaver, "Correlated pseudorandomness and the complexity of private computations," in Proc. 28th STOC, 1996, pp. 479-488.
3. D. Beaver, "Precomputing oblivious transfer," in Advances in Cryptology (Lecture Notes in Computer Science), vol. 963, D. Coppersmith, Ed. New York, NY, USA: Springer-Verlag, 1995, pp. 97-109.
4. T. M. Cover and J. A. Thomas, Elements of Information Theory, 2nd ed. New York, NY, USA: Wiley, 2006.
5. I. Csiszár and R. Ahlswede, "On oblivious transfer capacity," in Proc. ISIT, 2007, pp. 2061-2064.
6. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems, 1st ed. Budapest, Hungary: Akadémiai Kiadó, 1981.
7. Y. Dodis and S. Micali, "Lower bounds for oblivious transfer reductions," in Advances in Cryptology (Lecture Notes in Computer Science), vol. 1592, J. Stern, Ed. New York, NY, USA: Springer-Verlag, 1999, pp. 42-55.
8. A. El Gamal and Y.-H. Kim, Network Information Theory. Cambridge, U.K.: Cambridge Univ. Press, 2012.
9. P. Gács and J. Körner, "Common information is far less than mutual information," Problems Control Inf. Theory, vol. 2, no. 2, pp. 119-162, 1973.
10. M. Gastpar, B. Rimoldi, and M. Vetterli, "To code or not to code: Lossy source-channel communication revisited," IEEE Trans. Inf. Theory, vol. 49, no. 5, pp. 1147-1158, May 2003.
11. R. M. Gray and A. D. Wyner, "Source coding for a simple network," Bell Syst. Tech. J., vol. 53, no. 9, pp. 1681-1721, 1974.
12. H. Imai, K. Morozov, and A. C. A. Nascimento, "On the oblivious transfer capacity of the erasure channel," in Proc. IEEE ISIT, Jul. 2006, pp. 1428-1431. (Pubitemid 351244333)
13. 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 Proc. 2nd ICITS, 2007, pp. 183-194.
14. H. Imai, K. Morozov, A. C. A. Nascimento, and A. Winter, "Efficient protocols achieving the commitment capacity of noisy correlations," in Proc. IEEE ISIT, Jul. 2006, pp. 1432-1436. (Pubitemid 351244334)
15. H. Imai, J. Müller-Quade, A. C. A. Nascimento, and A. Winter, "Rates for bit commitment and coin tossing from noisy correlation," in Proc. ISIT, 2004, p. 45.
16. Y. Ishai, E. Kushilevitz, R. Ostrovsky, and A. Sahai, "Extracting correlations," in Proc. 50th FOCS, 2009, pp. 261-270.
17. 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. Commun., Control, Comput., 2010, pp. 1340-1346.
18. J. Kilian, "Founding cryptography on oblivious transfer," in Proc. 20th STOC, 1988, pp. 20-31.
19. J. Kilian, "More general completeness theorems for secure two-party computation," in Proc. 32nd STOC, 2000, pp. 316-324.
20. D. Marco and M. Effros, "On lossless coding with coded side information," IEEE Trans. Inf. Theory, vol. 55, no. 7, pp. 3284-3296, Jul. 2009.
21. V. M. Prabhakaran and M. M. Prabhakaran, "Assisted common information," in Proc. ISIT, 2010, pp. 2602-2606.
22. V. M. Prabhakaran and M. M. Prabhakaran, "Assisted common information: Further results," in Proc. ISIT, 2011, pp. 2861-2865.
23. M. M. Prabhakaran and V. M. Prabhakaran, "On secure multiparty sampling for more than two parties," in Proc. IEEE ITW, Sep. 2012, pp. 99-103.
24. M. Rabin, "How to exchange secrets by oblivious transfer," Harvard Aiken Comput. Lab., Harvard Univ., Cambridge, MA, USA, Tech. Rep. TR-81, 1981.
25. S. Wiesner, "Conjugate coding," Sigact News, vol. 15, no. 1, pp. 78-88, 1983.
26. S. Winkler and J. Wullschleger, "On the efficiency of classical and quantum oblivious transfer reductions," in Advances in Cryptology (Lecture Notes in Computer Science), vol. 6223, T. Rabin, Ed. New York, NY, USA: Springer-Verlag, 2010, pp. 707-723.
27. A. Winter, A. C. A. Nascimento, and H. Imai, "Commitment capacity of discrete memoryless channels," in Cryptography and Coding (Lecture Notes in Computer Science), vol. 2898, K. G. Paterson, Ed. New York, NY, USA, Springer-Verlag, 2003, pp. 35-51.
28. H. S. Witsenhausen, "On sequences of pairs of dependent random variables," SIAM J. Appl. Math., vol. 28, no. 1, pp. 100-113, 1975.
29. S. Wolf and J. Wullschleger, "Oblivious transfer is symmetric," in Advances in Cryptology (Lecture Notes in Computer Science), vol. 4004, S. Vaudenay, Ed. New York, NY, USA: Springer-Verlag, 2006, pp. 222-232. (Pubitemid 44072242)
30. S. Wolf and J. Wullschleger, "New monotones and lower bounds in unconditional two-party computation," IEEE Trans. Inf. Theory, vol. 54, no. 6, pp. 2792-2797, Jun. 2008.
31. J. Wullschleger, "Oblivious-transfer amplification," Ph.D. dissertation, Dept. Comput. Sci., Swiss Federal Inst. Technol., Zürich, Switzerland, 2008.
32. A. D. Wyner, "The common information of two dependent random variables," IEEE Trans. Inf. Theory, vol. 21, no. 2, pp. 163-179, Mar. 1975.
33. A. D. Wyner and J. Ziv, "Rate-distortion function for source coding with side information at the decoder," IEEE Trans. Inf. Theory, vol. 22, no. 1, pp. 1-11, Jan. 1976.
34. H. Yamamoto, "Coding theorems for Shannon?s cipher system with correlated source outputs, and common information," IEEE Trans. Inf. Theory, vol. 40, no. 1, pp. 85-95, Jan. 1994.