From randomizing polynomials to parallel algorithms

ITCS 2012 - Innovations in Theoretical Computer Science Conference

Volumn , Issue , 2012, Pages 76-89

  Ishai, Yuval ^a   Kushilevitz, Eyal ^a   Paskin Cherniavsky, Anat ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

cryptography; parallel algorithms; randomizing polynomials; secure computation

Indexed keywords

ALGORITHM DESIGN; CONSTANT DEGREE; FINITE FIELDS; MULTI-PARTY PROTOCOLS; MULTIVARIATE POLYNOMIAL; OUTPUT DISTRIBUTION; POLYNOMIAL-TIME; POLYNOMIAL-TIME COMPUTABLE FUNCTIONS; RANDOM INPUT; RANDOMIZED MAPPING; RANDOMIZING POLYNOMIALS; ROOT-COUNTING; SECURE COMPUTATION; UNCONDITIONAL SECURITY;

COMPUTER SCIENCE; CRYPTOGRAPHY; INNOVATION; PARALLEL ALGORITHMS; PARALLEL ARCHITECTURES;

POLYNOMIALS;

EID: 84856424797     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2090236.2090244     Document Type: Conference Paper

References (22)

1. C. Arf. Untersuchungen über quadratischen Formen in Körpern der Charakteristik 2, I In J. Reine Angew. Math. 183 (1941), pp. 148-167
2. 0. In Proc. FOCS 2004, pp. 166-175
3. B. Applebaum, Y. Ishai, and E. Kushilevitz. Computationally private randomizing polynomials and their applications. Computational Complexity, 15(2): 115-162, 2006. (Pubitemid 43938398)
4. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness Theorems for Noncryptographic Fault-Tolerant Distributed Computations. Proc. 20th STOC88, pp. 1-10.
5. A. Borodin, J. Von Zur Gathen, and J.E. Hopcroft. Fast Parallel Matrix and GCD Computations. In Proc. FOCS 1982, pp. 65-71.
6. R. Cramer, S. Fehr, Y. Ishai, E. Kushilevitz. Efficient Multi-party Computation over Rings. In Proc. EUROCRYPT 2003, pp. 596-613.
7. Z. Dvir, D. Gutfreund, G. Rothblum, S. Vadhan. On approximating the entropy of polynomial mappings. In Proc. ICS 2011, pp. 460-475.
8. A. Ehrenfeucht and M. Karpinski. The computational complexity of (XOR, AND)-counting problems. TR-90-033, 1990
9. F.E. Fich and M. Tompa. The parallel complexity of exponentiating polynomials over finite fields. In Proc. STOC 1985, pp. 38-47
10. S. Goldwasser, D. Gutfreund, A. Healy, T. Kaufman, G. N. Rothblum. Verifying and decoding in constant depth. In Proc. STOC 2007, pp. 440-449.
11. S. Goldwasser, D. Gutfreund, A. Healy, T. Kaufman, G. N. Rothblum. A (de)constructive approach to program checking. In Proc. STOC 2008, pp. 143-152.
12. P. Gopalan, V. Guruswami, R.J. Lipton. Algorithms for Modular Counting of Roots of Multivariate Polynomials. In Proc. LATIN 2006.
13. D. Grigoriev, M. Karpinski. An approximation algorithm for the number of zeroes of arbitrary polynomials over GF[q]. In Proc. FOCS 1991, pp. 662-669.
14. Y. Ishai and E. Kushilevitz. Randomizing polynomials: A new representation with applications to round-efficient secure computation. In Proc. 41st FOCS, 2000.
15. Y. Ishai and E. Kushilevitz. Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials. In Proc. ICALP '02.
16. M. Karpinski, M. Luby. Approximating the number of zeroes of a GF[2] polynomial, Journal of Algorithms 14 (1993), pp. 280-287.
17. R. Lidl and H. Niederreiter. Introduction to finite fields and their applications. 1997
18. R. Lipton. New Directions in Testing. In DIMACS Distributed Computing and Cryptography, Vol. 2 page: 191, 1991.
19. K. Mulmuley. A Fast Parallel Algorithm to Compute the Rank of a Matrix over an Arbitrary Field. In Proc. STOC 1986, pp. 338-339.
20. J.R. Norris. Markov chains (book). Cambridge university press, 2008.
21. L.G. Valiant, S. Skyum Fast Parallel Computation of Polynomials Using Few Processes. In Proc. MFCS 1981, pp. 132-139.
22. C. Wallace. A suggestion for a fast multiplier. IEEE Trans. Elec. Comput. EC-I3 (1964), pp. 14-17.