Efficient secure linear algebra in the presence of covert or computationally unbounded adversaries

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

Volumn 5157 LNCS, Issue , 2008, Pages 481-496

  Mohassel, Payman ^a   Weinreb, Enav ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION COMPLEXITIES; CRYPTOLOGY; LINEAR ALGEBRA PROBLEMS; SECURE PROTOCOLS; UPPER BOUNDS;

ALGEBRA; BOOLEAN ALGEBRA; CHLORINE COMPOUNDS; COMMUNICATION; CRYPTOGRAPHY; HELIUM; LAWS AND LEGISLATION; MATRIX ALGEBRA;

LINEAR ALGEBRA;

EID: 52049092094     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85174-5_27     Document Type: Conference Paper

References (26)

1. Aumann, Y., Lindell, Y.: Security against covert adversaries: Efficient protocols for realistic adversaries. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 137-156. Springer, Heidelberg (2007)
2. Bürgisser, P., Clausen, M., Shokrollahi, M.A.: Algebraic complexity theory. Springer, Berlin (1997)
3. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computations. In: STOC, pp. 1-10 (1988)
4. Brent, R.P., Gustavson, F.G., Yun, D.Y.Y.: Fast solution of Toeplitz systems of equations and computation of pade approximants. J. Algorithms, 259-295 (1980)
5. Bar-Ilan, J., Beaver, D.: Non-cryptographic fault-tolerant computing in constant number of rounds of interaction. In: PODC, pp. 201-209. ACM Press, New York (1989)
6. Chaum, D., Crépeau, C., Damgård, I.: Multiparty unconditionally secure protocols. In: STOC, pp. 11-19 (1988)
7. Cramer, R., Damgaard, I.: Secure distributed linear algebra in a constant number of rounds. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 119-136. Springer, Heidelberg (2001)
8. Cramer, R., Damgård, I., Maurer, U.: General secure multi-party computation from any linear secret-sharing scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 316-334. Springer, Heidelberg (2000)
9. Cramer, R., Kiltz, E., Padró, C.: A note on secure computation of the Moore-Penrose pseudo-inverse and its application to secure linear algebra. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, p. 613. Springer, Heidelberg (2007)
10. Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. In: STOC, pp. 1-6. ACM Press, New York (1987)
11. Friedlander, B., Morf, M., Kailath, T., Ljung, L.: New inversion formulas for matrices classified in terms of their distance from Toeplitz matrices. Linear Algebra and Appl. 27, 31-60 (1979)
12. Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: STOC, pp. 218-229 (1987)
13. Gohberg, I., Semencul, A.: On the inversion of finite Toeplitz matrices and their continuous analogs. Math. Issl., 201-233 (1972)
14. JáJá, J.: An introduction to parallel algorithms. Addison Wesley Longman Publishing Co., Inc., Redwood City (1992)
15. Kushilevitz, E., Lindell, Y., Rabin, T.: Information-theoretically secure protocols and security under composition. In: STOC, pp. 109-118 (2006)
16. Kiltz, E., Mohassel, P., Weinreb, E., Franklin, M.: Secure linear algebra using linearly recurrent sequences. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 291-310. Springer, Heidelberg (2007)
17. Kaltofen, E., Pan, V.: Processor efficient parallel solution of linear systems over an abstract field. In: SPAA, pp. 180-191. ACM Press, New York (1991)
18. Kaltofen, E., Saunders, D.: On Wiedemann's method of solving sparse linear systems. In: AAECC-9, London, UK, pp. 29-38 (1991)
19. Damgaard, I., Fitzi, M., Kiltz, E., Nielsen, J.B., Toft, T.: Unconditionally Secure Constant-Rounds Multi-Party Computation for Equality, Comparison, Bits and Exponentiation. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 285-304. Springer, Heidelberg (2006)
20. Lindell, Y.: Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 171-189. Springer, Heidelberg (2001)
21. Mohassel, P., Franklin, M.: Efficient Polynomial Operations in the Shared-Coefficient Setting. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC 2006. LNCS, vol. 3958, pp. 44-57. Springer, Heidelberg (2006)
22. Nissim, K., Weinreb, E.: Communication efficient secure linear algebra. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 522-541. Springer, Heidelberg (2006)
23. Pallier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223-238. Springer, Heidelberg (1999)
24. Wiedemann, D.H.: Solving sparse linear equations over finite fields. IEEE Trans. Inf. Theor. 32(1), 54-62 (1986)
25. Yao,A.C.:Protocolsforsecurecomputations.In:FOCS,pp.160-164(1982)
26. Yao, A.C.: How to generate and exchange secrets. In: FOCS, pp. 162-167 (1986)