On the cryptographic complexity of the worst functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8349 LNAI, Issue , 2014, Pages 317-342

  Beimel, Amos ^a   Ishai, Yuval ^b   Kumaresan, Ranjit ^b   Kushilevitz, Eyal ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

RANDOM PROCESSES;

COMMUNICATION COMPLEXITY; INFORMATION-THEORETIC CRYPTOGRAPHY; OBLIVIOUS TRANSFER; PASSIVE ADVERSARY; PRIVATE INFORMATION RETRIEVAL; SECURE TWO-PARTY COMPUTATIONS; SIMULTANEOUS MESSAGES; WORST-CASE COMPLEXITY;

CRYPTOGRAPHY;

EID: 84958544842     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-54242-8_14     Document Type: Conference Paper

References (58)

1. Applebaum, B., Ishai, Y., Kushilevitz, E.: Computationally private randomizing polynomials and their applications. In: CCC, pp. 260-274 (2005)
2. Barkol, O., Ishai, Y., Weinreb, E.: On locally decodable codes, self-correctable codes, and t-private PIR. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) APPROX and RANDOM 2007. LNCS, vol. 4627, pp. 311-325. Springer, Heidelberg (2007)
3. Beaver, D.: Correlated pseudorandomness and the complexity of private computations. In: STOC, pp. 479-488 (1996)
4. Beaver, D.: Precomputing oblivious transfer. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 97-109. Springer, Heidelberg (1995)
5. Beaver, D., Feigenbaum, J., Kilian, J., Rogaway, P.: Security with low communication overhead. In: Menezes, A.J., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 62-76. Springer, Heidelberg (1991)
6. Beaver, D., Feigenbaum, J., Kilian, J., Rogaway, P.: Locally random reductions: Improvements and applications. Journal of Cryptology 10(1), 17-36 (1997)
7. Beimel, A., Gal, A., Paterson, M.: Lower bounds on monotone span programs. In: FOCS, pp. 674-681 (1995)
8. Beimel, A., Farr̀as, O., Mintz, Y.: Secret sharing for very dense graphs. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 144-161. Springer, Heidelberg (2012)
9. Beimel, A., Ishai, Y.: On the power of nonlinear secret sharing. In: CCC, pp. 188-202 (2001)
10. Beimel, A., Ishai, Y., Kushilevitz, E.: General constructions for informationtheoretic private information retrieval. Jour. Comput. Syst. & Sci. 71(2), 213-247 (2005)
11. Beimel, A., Ishai, Y., Kushilevitz, E., Orlov, I.: Share conversion and private information retrieval. In: CCC, pp. 258-268 (2012)
12. Beimel, A., Malkin, T.: A quantitative approach to reductions in secure computation. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 238-257. Springer, Heidelberg (2004)
13. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computations. In: STOC, pp. 1-10 (1988)
14. Bendlin, R., Damgrard, I., Orlandi, C., Zakarias, S.: Semi-homomorphic encryption and multiparty computation. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 169-188. Springer, Heidelberg (2011)
15. Blundo, C., De Santis, A., de Simone, R., Vaccaro, U.: Tight bounds on information rate of secret sharing schemes. In: Designs, Codes and Cryptography, pp. 107-122 (1997)
16. Blundo, C., De Santis, A., Gargano, L., Vaccaro, U.: On information rate of secret sharing schemes. Theoretical Computer Science, 283-306 (1996)
17. Brassard, G., Crepeau, C., Robert, J.-M.: Information theoretic reduction among disclosure problems. In: FOCS, pp. 168-173 (1986)
18. Bublitz, S.: Decomposition of graphs and monotone formula size of homogeneous functions. In: Acta Informatica, pp. 689-696 (1986)
19. Chaum, D., Cŕepeau, C., Damgard, I.: Multiparty unconditionally secure protocols. In: STOC, pp. 11-19 (1988)
20. Chen, X., Kayal, N., Wigderson, A.: Partial derivatives in arithmetic complexity and beyond. In: FSTTCS, pp. 1-138 (2011)
21. Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: FOCS, pp. 41-50 (1995)
22. Crepeau, C., Kilian, J.: Achieving oblivious transfer using weakened security assumptions (extended abstract). In: FOCS, pp. 42-52 (1988)
23. Csirmaz, L.: Secret sharing schemes on graphs. In: ePrint 2005/059 (2005)
24. Damgrard, I., Zakarias, S.: Constant-overhead secure computation of boolean circuits using preprocessing. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 621-641. Springer, Heidelberg (2013)
25. Dodis, Y., Micali, S.: Parallel reducibility for information- theoretically secure computation. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 74-92. Springer, Heidelberg (2000)
26. Dvir, Z., Gopalan, P., Yekhanin, S.: Matching vector codes. In: FOCS, pp. 705-714 (2010)
27. Efremenko, K.: 3-query locally decodable codes of subexponential length. In: STOC, pp. 39-44 (2009)
28. Erdos, P., Pyber, L.: Covering a graph by complete bipartite graphs. In: Discrete Mathematics, pp. 249-251 (1997)
29. Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. In: Crypto, pp. 205-210 (1983)
30. Feige, U., Kilian, J., Naor, M.: A minimal model for secure computation (extended abstract). In: STOC, pp. 554-563 (1994)
31. Goldreich, O.: Foundations of cryptography-basic applications, vol. 2 (2004)
32. Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game, or a completeness theorem for protocols with honest majority. In: STOC, pp. 218-229 (1987)
33. Goldreich, O., Vainish, R.: How to solve any protocol problem-an efficiency improvement. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 73-86. Springer, Heidelberg (1988)
34. Harnik, D., Ishai, Y., Kushilevitz, E.: How many oblivious transfers are needed for secure multiparty computation? In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 284-302. Springer, Heidelberg (2007)
35. Harnik, D., Ishai, Y., Kushilevitz, E., Nielsen, J.B.: OT-combiners via secure computation. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 393-411. Springer, Heidelberg (2008)
36. Ishai, Y.: Randomization techniques for secure computation. In: Prabhakaran, M., Sahai, A. (eds.) Secure Multi-Party Computation (2013)
37. Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 145-161. Springer, Heidelberg (2003)
38. Ishai, Y., Kushilevitz, E.: Private simultaneous messages protocols with applications. In: ISTCS, pp. 174-184 (1997)
39. Ishai, Y., Kushilevitz, E.: Randomizing polynomials: A new representation with applications to round-efficient secure computation. In: FOCS, pp. 294-304 (2000)
40. Ishai, Y., Kushilevitz, E.: On the hardness of information-theoretic multiparty computation. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 439-455. Springer, Heidelberg (2004)
41. Ishai, Y., Kushilevitz, E., Meldgaard, S., Orlandi, C., Paskin-Cherniavsky, A.: On the power of correlated randomness in secure computation. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 600-620. Springer, Heidelberg (2013)
42. Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Extracting correlations. In: FOCS, pp. 261-270 (2009)
43. Ishai, Y., Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer-efficiently. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 572-591. Springer, Heidelberg (2008)
44. Kaplan, M., Kerenidis, I., Laplante, S., Roland, J.: Non-local box complexity and secure function evaluation. In: FSTTCS, pp. 239-250 (2009)
45. Kilian, J.: Founding cryptography on oblivious transfer. In: STOC, pp. 20-31 (1988)
46. Kilian, J.: More general completeness theorems for secure two-party computation. In: STOC, pp. 316-324 (2000)
47. Kolesnikov, V.: Gate evaluation secret sharing and secure one-round two-party computation. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 136-155. Springer, Heidelberg (2005)
48. Kushilevitz, E., Nisan, N.: Communication complexity (1997)
49. Lupanov, O.: A method of circuit synthesis. In: Izvesitya VUZ, Radiofizika, pp. 120-140 (1958)
50. Mintz, Y.: Information ratios of graph secret-sharing schemes. Master's thesis, Ben Gurion University, Israel (2012)
51. Prabhakaran, V., Prabhakaran, M.: Assisted common information with an application to secure two-party sampling. In: arxiv:1206.1282v1 (2012)
52. Rabin, M.O.: How to exchange secrets with oblivious transfer. In: Technical Report TR-81, Aiken Computation Lab, Harvard University (1981)
53. Shannon, C.: The synthesis of two-terminal switching circuits. Bell System Technical Journal, 59-98 (1949)
54. Sun, H., Shieh, S.: Secret sharing in graph-based prohibited structures. In: INFOCOM, pp. 718-724 (1997)
55. van Dijk, M.: On the information rate of perfect secret sharing schemes. In: Designs, Codes and Cryptography, pp. 143-169 (1995)
56. Winkler, S., Wullschleger, J.: On the efficiency of classical and quantum oblivious transfer reductions. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 707-723. Springer, Heidelberg (2010)
57. Woodruff, D., Yekhanin, S.: A geometric approach to information-theoretic private information retrieval. SIAM J. Comp. 37(4), 1046-1056 (2007)
58. Yekhanin, S.: Towards 3-query locally decodable codes of subexponential length. In: STOC, pp. 266-274 (2007)