Common randomness for secure computing

IEEE International Symposium on Information Theory - Proceedings

Volumn 2015-June, Issue , 2015, Pages 949-953

  Narayan, Prakash ^a   Tyagi, Himanshu ^b   Watanabe, Shun ^c  

^a UNIVERSITY OF MARYLAND   (United States)

^b INDIAN INSTITUTE OF SCIENCE   (India)

^c TOKYO UNIVERSITY OF AGRICULTURE AND TECHNOLOGY   (Japan)

Author keywords

Common randomness; maximum common function; recoverability; secure computing; security

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATION THEORY; RANDOM PROCESSES;

COMMON RANDOMNESS; COMPUTABLE FUNCTIONS; DETERMINISTIC PROTOCOLS; FUNCTION COMPUTATIONS; INTERACTIVE COMMUNICATIONS; RECOVERABILITY; SECURE COMPUTING; SECURITY;

INFORMATION THEORY;

EID: 84969779040     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2015.7282595     Document Type: Conference Paper

References (23)

1. R. Ahlswede and I. Csiszár, "Common randomness in information theory and cryptography-part i: Secret sharing, " IEEE Trans. Inf. Theory, vol. 39, no. 4, pp. 1121-1132, July 1993.
2. D. Beaver, "Multiparty protocols tolerating half faulty processors, " CRYPTO, LNCS, vol. 435, pp. 560-572, 1989.
3. -, "Perfect privacy for two party protocols, " Technical Report TR-11-89, Harvard University, 1989.
4. M. Ben-Or, S. Goldwasser, and A. Wigderson, "Completeness theorems for non-cryptographic fault-tolerant distribution computation, " STOC, pp. 1-10, 1988.
5. M. Blum, "Coin flipping by telephone a protocol for solving impossible problems, " SIGACT News, vol. 15, no. 1, pp. 23-27, Jan 1983.
6. D. Chaum, C. Crépeau, and I. Damgård, "Multiparty unconditionally secure protocols, " STOC, pp. 11-19, 1988.
7. I. Csiszár and P. Narayan, "Secrecy capacities for multiterminal channel models, " IEEE Trans. Inf. Theory, vol. 54, no. 6, pp. 2437-2452, June 2008.
8. D. Data, M. M. Prabhakaran, and V. M. Prabhakara, "On the communication complexity of secure computation, " CRYPTO, LNCS, vol. 8617, pp. 199-216, 2014.
9. Y. Dodis and S. Micali, "Lower bound for oblivious transfer reductions, " EUROCRYPT, LNCS, vol. 1592, pp. 42-55, 1999.
10. 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. 149-162, 1973.
11. E. Kushilevitz, "Privacy and communication complexity, " SIAM Journal on Math, vol. 5, no. 2, pp. 273-284, 1992.
12. M. Madiman and P. Tetali, "Information inequalities for joint distributions, with interpretations and applications, " IEEE Trans. Inf. Theory, vol. 56, no. 6, pp. 2699-2713, June 2010.
13. H. K. Maji, M. Prabhakaran, and M. Rosulek, "Complexity of multiparty computation problems: The case of 2-party symmetric secure function evaluation, " TCC, LNCS, vol. 5444, pp. 256-273, 2009.
14. -, "A unified characterization of completeness and triviality for secure function evaluation, " INDOCRYPTO, LNCS, vol. 7668, pp. 40-59, 2012.
15. U. M. Maurer, "Secret key agreement by public discussion from common information, " IEEE Trans. Inf. Theory, vol. 39, no. 3, pp. 733-742, May 1993.
16. V. M. Prabhakaran and M. M. Prabhakaran, "On secure multiparty sampling for more than two parties, " in Information Theory Workshop, 2012. Proceedings of the 2012 IEEE, Sept. 2012, pp. 99-103.
17. -, "Assisted common information with an application to secure twoparty samplign, " IEEE Trans. Inf. Theory, vol. 60, no. 6, pp. 3413-3434, June 2014.
18. M. O. Rabin, "How to exchange secrets with oblivious transfer, " Cryptology ePrint Archive, Report 2005/187, 2005, http://eprint. iacr. org/.
19. T. Rabin and M. Ben-Or, "Verifiable secret sharing and multiparty protocols with honest majority, " STOC, pp. 73-85, 1989.
20. H. Tyagi, P. Narayan, and P. Gupta, "When is a function securely computable" IEEE Trans. Inf. Theory, vol. 57, no. 10, pp. 6337-6350, October 2011.
21. Y. Wang, P. Ishwar, and S. Rane, "Information-theoretically secure threeparty computation with one corrupted party, " Proc. IEEE International Symposium on Information Theory, pp. 3160-3164, July 2013.
22. 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, June 2008.
23. A. C. Yao, "Protocols for secure computations, " Proc. Annual Symposium on Foundations of Computer Science, pp. 160-164, 1982.