Secure computation of constant-depth circuits with applications to database search problems

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

Volumn 3621 LNCS, Issue , 2006, Pages 395-411

  Barkol, Omer ^a   Ishai, Yuval ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTANT-DEPTH CIRCUITS; DATABASE SEARCH PROBLEMS; SECURE COMPUTATION; SECURE MULTIPARTY COMPUTATION PROTOCOLS;

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DATABASE SYSTEMS; NETWORK PROTOCOLS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; SET THEORY;

SECURITY OF DATA;

EID: 33745116951     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (30)

1. N. Alon, O. Goldreich, J. Hastad, and R. Peralta. Simple construction of almost k-wise independent random variables. Random Structures and Algorithms, 3(1):289-304, 1992. Preliminary version in FOCS '90.
2. D. Beaver and J. Feigenbaum. Hiding instances in multioracle queries. In Proc. 7th STAGS, pages 37-48, 1990.
3. D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. Security with low communication overhead. In Proc. 10th CRYPTO, pages 62-76, 1990.
4. A. Beimel and Y. Ishai. Information-theoretic private information retrieval: A unified construction. In Proc. 28th ICALP, pages 912-926, 2001.
5. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proc. 20th STOC, 1988.
6. D. Boneh, E.J. Goh, and K. Nissim. Evaluating 2-DNF formulas on ciphertexts. In Proc. 2nd TCC, pages 325-341, 2005.
7. R. Canetti. Security and composition of multiparty cryptographic protocols. J. Cryptology, 13(1):143-202, 2000.
8. Ran Canetti. Universally composable security: A new paradigm for cryptographic protocols. In Proc. 42st FOCS, pages 136-145, 2001.
9. M. Charikar, P. Indyk, and R. Panigrahy. New algorithms for subset query, partial match, orthogonal range searching and related problems. In Proc. 29th ICALP, pages 451-462, 2002.
10. B. Chor, N. Gilboa, and M. Naor. Private information retrieval by keywords. Technical report, Department of Computer Science, Technion, 1997.
11. B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan. Private information retrieval. In Proc. 36th FOCS, pages 41-50, 1995.
12. R. Cramer, I. Damgård, and U. Maurer. General secure multy-party computation from any linear secret-sharing scheme. In Proc. of EUROCRYPT, 2000.
13. M.J. Freedman, Y. Ishai, B. Pinkas, and O. Reingold. Keyword search and oblivious pseudorandom functions. In Proc. 2nd TCC, pages 303-324, 2005.
14. R. Gennaro, Y. Ishai, E. Kushilevitz and T. Rabin. The Round Complexity of Verifiable Secret Sharing and Secure Multicast. In Proc. 33rd STOC, 2001.
15. R. Gennaro, M.O. Rabin, and T. Rabin. Simplified VSS and fact-track multiparty computations with applications to threshold. In Proc. 17th PODC, 1998.
16. Y. Gertner, Y. Ishai, E. Kushilevitz, and T. Malkin. Protecting data privacy in private information retrieval schemes. J. of Computer and Systems Sciences, 60, 2000. Preliminary version in STOC '98.
17. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In Proc. 19th STOC, pages 218-229, 1987.
18. Oded Goldreich. Foundations of Cryptography: Basic Applications. Cambridge University Press, 2004.
19. Y. Ishai and E. Kushilevitz. Randomizing polynomials: A new representation with applications to round-efficient secure computation. In Proc. 41st FOCS, pages 294-304, 2000.
20. Y. Ishai and E. Kushilevitz. Perfect constant-round secure computation via perfect randomizing polynomials. In Proc. 29th ICALP, pages 244-256, 2002.
21. E. Kushilevitz, R. Ostrovsky, and Y. Rabani. Efficient search for approximate nearest neighbor in high dimensional spaces. In Proc. 30th STOC, 1998.
22. P.B. Miltersen. Cell probe complexity-a survey. In Pre-Conference Workshop on Advances in Data Structures at the 19th Conference on Foundations of Software Technology and Theoretical Computer Science, 1999.
23. J. Naor and M. Naor. Small-bias probability spaces: Efficient constructions and applications. SIAM J. Comput., 22(4):838-856, 1993.
24. M. Naor and K. Nissim. Communication preserving protocols for secure function evaluation. In Proc. 33rd STOC, pages 590-599, 2001.
25. A. Razborov. Lower bounds for the size of circuits of bounded depth with basis (AND, XOR). Math. Notes of the Academy of Science of the USSR, 41(4):333-338, 1987.
26. A. Shamir. How to share a secret. Communication of the ACM, 22(11):612-613, 1979.
27. R. Smolensky. Algebric methods in the theory of lower bound for boolean circuit complexity. In Proc. 19th STOC, pages 77-82, 1987.
28. L.G. Valiant and V.V. Vazirani. NP is as easy as detecting unique solutions. Theoretical Computer Science, 47:85-93, 1986. Preliminary version in STOC '85.
29. D. Woodruff and S. Yekhanin. A geometric approach to information- theoretic private information retrieval. In Electronic Colloquium on Computational Complexity (ECCC), 2005. Report TR05-009. To appear in CCC 2005.
30. A. C. Yao. How to generate and exchange secrets. In Proc. 27th FOCS, 1986.