Communication efficient secure linear algebra

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

Volumn 3876 LNCS, Issue , 2006, Pages 522-541

  Nissim, Kobbi ^a   Weinreb, Enav ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION SYSTEMS; COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; LINEAR EQUATIONS; NETWORK PROTOCOLS; SECURITY OF DATA;

COMMUNICATION COMPLEXITY; GAUSSIAN ELIMINATION; RANDOM VECTOR; UPPER-TRIANGULAR MATRIX;

LINEAR ALGEBRA;

EID: 33745558215     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11681878_27     Document Type: Conference Paper

References (18)

1. D. Boneh, E. Goh, and K. Nissim. Evaluating 2-DNF Formulas on Ciphertexts. TCC 2005 pages 325-341.
2. M. Bellare, O. Goldreich, and E. Petrank. Uniform Generation of NP-Witnesses Using an NP-Oracle. In Inf. Comput. 163(2): 510-526 (2000).
3. A. Beimel, and E. Weinreb. Separating the Power of Monotone Span Programs over Different Fields. In FOCS 2003: 428-437.
4. A. Borodin, J. von zur Gathen, and J. Hopcroft. Fast parallel matrix and gcd computations. In Information and Control, 52(3):241-256, March 1982.
5. R. Cramer, and I. Damgård. Secure Distributed Linear Algebra in a Constant Number of Rounds. In CRYPTO 2001: 119-136.
6. D. Coppersmith, and S. Winograd. Matrix Multiplication via Arithmetic Progressions. In Proc. 19th ACN Symp. on Theory of Computing, pp. 1-6, 1987.
7. I. Damgård and M. Jurik. A generalization, a simplification and some applications of Paillier's probabilistic public-key system. In K. Kim, editor, Proceedings of Public Key Cryptography 2001, volume 1992 of LNCS, pages 119-136. Springer, 2001.
8. T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 31(4):469-472, Jul 1985.
9. O. Goldreich. The Foundations of Cryptography - Volume 2. Cambridge University Press, 2004.
10. S. Goldwasser and S. Micali. Probabilistic encryption & how to play mental poker keeping secret all partial information. In Proceedings of the fourteenth annual ACM symposium on Theory of computing, pages 365-377. ACM Press, 1982.
11. M. Karchmer and A. Wigderson. On Span Programs In Proc. of the 8th IEEE Structure in Complexity Theory, pages 102-111, 1993.
12. Y. Lindell and B. Pinkas. Privacy Preserving Data Mining In J. Cryptology 15(3): 177-206, 2002.
13. P. Pallier. Public-key cryptosystems based on composite degree residuosity classes. In J. Stern, editor, Proceedings of Eurocrypt 1999, volume 1592 of LNCS, pages 223-238. Springer-Verlag, May 1999.
14. T. P. Pedersen. A threshold cryptosystem without a trusted party. In D. Davies, editor, Proceedings of Eurocrypt 1991, volume 547 of LNCS, pages 522-526. Springer, 1991.
15. R. L. Rivest, A. Shamir, and L. M. Adleman. A Method for Obtaining Digital Signatures and Public-Key CryptoSystems. Commun. ACM 21(2): 120-126 (1978).
16. 1. In Proceedings of the 40th Symposium on Foundations of Computer Science (FOCS), pages 554-567, New York, NY, USA, Oct. 1999. IEEE Computer Society Press.
17. M. Sipser. A Complexity Theoretic Approach to Randomness. In Proc. of the 15th Annual Symp. on the Theory of Computing, 1983.
18. A. C. Yao. Protocols for secure computations. In Proceedings of the 23rd Symposium on Foundations of Computer Science (FOCS), pages 160-164. IEEE Computer Society Press, 1982.