Abstract
In this work we present secure two-party protocols for various core problems in linear algebra. Our main result is a protocol to obliviously decide singularity of an encrypted matrix: Bob holds an n ×n matrix, encrypted with Alice’s secret key, and wants to learn whether or not the matrix is singular (while leaking nothing further). We give an interactive protocol between Alice and Bob that solves the above problem in O(logn) communication rounds and with overall communication complexity of roughly O(n 2) (note that the input size is n 2). Our techniques exploit certain nice mathematical properties of linearly recurrent sequences and their relation to the minimal and characteristic polynomial of the input matrix, following [Wiedemann, 1986]. With our new techniques we are able to improve the round complexity of the communication efficient solution of [Nissim and Weinreb, 2006] from O(n 0.275) to O(logn).
At the core of our results we use a protocol that securely computes the minimal polynomial of an encrypted matrix. Based on this protocol we exploit certain algebraic reductions to further extend our results to the problems of securely computing rank and determinant, and to solving systems of linear equations (again with low round and communication complexity).
Keywords
Download to read the full chapter text
Chapter PDF
References
Bar-Ilan, J., Beaver, D.: Non-cryptographic fault-tolerant computing in constant number of rounds of interaction. In: PODC ’89: Proceedings of the eighth annual ACM Symposium on Principles of distributed computing, Edmonton, Alberta, Canada, pp. 201–209. ACM Press, New York (1989), doi:10.1145/72981.72995
Beimel, A., Weinreb, E.: Separating the power of monotone span programs over different fields. In: FOCS03, pp. 428–437 (2003)
Boneh, D., Goh, E., Nissim, K.: Evaluating 2-DNF formulas on ciphertexts. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 325–341. Springer, Heidelberg (2005)
Bürgisser, P., Clausen, M., Shokrollahi, M.A.: Algebraic complexity theory. Springer, Berlin (1997)
Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. In: STOC ’87: Proceedings of the nineteenth annual ACM conference on Theory of computing, pp. 1–6. ACM Press, New York (1987)
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)
Cramer, R., Gennaro, R., Schoenmakers, B.: A secure and optimally efficient multi-authority election scheme. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 103–118. Springer, Heidelberg (1997)
Curtis, M.: Abstract Linear Algebra. Springer, Heidelberg (1990)
Dornstetter, J.L.: On the equivalence between Berlekamp’s and Euclid’s algorithms. IEEE Trans. Inf. Theory it-33(3), 428–431 (1987)
Gamal, T.E.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 10–18. Springer, Heidelberg (1985)
von zur Gathen, J., Gerhard, J.: Modern computer algebra. Cambridge University Press, Cambridge (1999)
Goldreich, O.: Foundations of Cryptography, Volume II Basic Applications. Cambridge University Press, Cambridge (2004)
Goldwasser, S., Micali, S.: Probabilistic encryption & how to play mental poker keeping secret all partial information. In: STOC ’82: Proceedings of the fourteenth annual ACM symposium on Theory of computing, San Francisco, California, United States, pp. 365–377. ACM Press, New York (1982)
Kaltofen, E., Saunders, D.: On Wiedemann’s method of solving sparse linear systems. In: Mattson, H.F., Rao, T.R.N., Mora, T. (eds.) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. LNCS, vol. 539, pp. 29–38. Springer, Heidelberg (1991)
Karchmer, M., Wigderson, A.: On span programs. In: Proc. of the 8th IEEE Structure in Complexity Theory, pp. 102–111. IEEE, Los Alamitos (1993)
Lindell, Y., Pinkas, B.: A proof of yao’s protocol for secure two-party computation. eprint archive (2004)
Massey, J.L.: Shift-register synthesis and BCH decoding. IEEE Trans. Inf. Theory it-15, 122–127 (1969)
Naccache, D., Stern, J.: A new public-key cryptosystem based on higher residues. In: ACM CCS 98, pp. 59–66. ACM Press, New York (1998)
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)
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)
Pedersen, T.P.: A threshold cryptosystem without a trusted party. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 522–526. Springer, Heidelberg (1991)
Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120–126 (1978)
Sander, T., Young, A., Yung, M.: Non-interactive cryptocomputing for NC1. In: FOCS ’99: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, Washington, DC, USA, p. 554. IEEE Computer Society Press, Los Alamitos (1999)
Wiedemann, D.H.: Solving sparse linear equations over finite fields. IEEE Trans. Inf. Theor. 32(1), 54–62 (1986)
Yao, A.C.: How to generate and exchange secrets. In: Proc. of the 27th IEEE Symp. on Foundations of Computer Science, pp. 162–167. IEEE, Los Alamitos (1986)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Kiltz, E., Mohassel, P., Weinreb, E., Franklin, M. (2007). Secure Linear Algebra Using Linearly Recurrent Sequences. In: Vadhan, S.P. (eds) Theory of Cryptography. TCC 2007. Lecture Notes in Computer Science, vol 4392. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70936-7_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-70936-7_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70935-0
Online ISBN: 978-3-540-70936-7
eBook Packages: Computer ScienceComputer Science (R0)