{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T13:15:49Z","timestamp":1742390149862},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709350"},{"type":"electronic","value":"9783540709367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70936-7_16","type":"book-chapter","created":{"date-parts":[[2007,5,16]],"date-time":"2007-05-16T07:43:44Z","timestamp":1179301424000},"page":"291-310","source":"Crossref","is-referenced-by-count":20,"title":["Secure Linear Algebra Using Linearly Recurrent Sequences"],"prefix":"10.1007","author":[{"given":"Eike","family":"Kiltz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Payman","family":"Mohassel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enav","family":"Weinreb","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew","family":"Franklin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/72981.72995","volume-title":"PODC \u201989: Proceedings of the eighth annual ACM Symposium on Principles of distributed computing","author":"J. Bar-Ilan","year":"1989","unstructured":"Bar-Ilan, J., Beaver, D.: Non-cryptographic fault-tolerant computing in constant number of rounds of interaction. In: PODC \u201989: Proceedings of the eighth annual ACM Symposium on Principles of distributed computing, Edmonton, Alberta, Canada, pp. 201\u2013209. ACM Press, New York (1989), doi:10.1145\/72981.72995"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Beimel, A., Weinreb, E.: Separating the power of monotone span programs over different fields. In: FOCS03, pp. 428\u2013437 (2003)","DOI":"10.1109\/SFCS.2003.1238216"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/978-3-540-30576-7_18","volume-title":"Theory of Cryptography","author":"D. Boneh","year":"2005","unstructured":"Boneh, D., Goh, E., Nissim, K.: Evaluating 2-DNF formulas on ciphertexts. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 325\u2013341. Springer, Heidelberg (2005)"},{"key":"16_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03338-8","volume-title":"Algebraic complexity theory","author":"P. B\u00fcrgisser","year":"1997","unstructured":"B\u00fcrgisser, P., Clausen, M., Shokrollahi, M.A.: Algebraic complexity theory. Springer, Berlin (1997)"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/28395.28396","volume-title":"STOC \u201987: Proceedings of the nineteenth annual ACM conference on Theory of computing","author":"D. Coppersmith","year":"1987","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. In: STOC \u201987: Proceedings of the nineteenth annual ACM conference on Theory of computing, pp. 1\u20136. ACM Press, New York (1987)"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44647-8_7","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"R. Cramer","year":"2001","unstructured":"Cramer, R., Damgaard, I.: Secure distributed linear algebra in a constant number of rounds. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 119\u2013136. Springer, Heidelberg (2001)"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/3-540-69053-0_9","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"R. Cramer","year":"1997","unstructured":"Cramer, R., Gennaro, R., Schoenmakers, B.: A secure and optimally efficient multi-authority election scheme. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 103\u2013118. Springer, Heidelberg (1997)"},{"key":"16_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8764-8","volume-title":"Abstract Linear Algebra","author":"M. Curtis","year":"1990","unstructured":"Curtis, M.: Abstract Linear Algebra. Springer, Heidelberg (1990)"},{"issue":"3","key":"16_CR9","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1109\/TIT.1987.1057299","volume":"it-33","author":"J.L. Dornstetter","year":"1987","unstructured":"Dornstetter, J.L.: On the equivalence between Berlekamp\u2019s and Euclid\u2019s algorithms. IEEE Trans. Inf. Theory\u00a0it-33(3), 428\u2013431 (1987)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/3-540-39568-7_2","volume-title":"Advances in Cryptology","author":"T.E. Gamal","year":"1985","unstructured":"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.\u00a0196, pp. 10\u201318. Springer, Heidelberg (1985)"},{"key":"16_CR11","volume-title":"Modern computer algebra","author":"J. Gathen von zur","year":"1999","unstructured":"von zur Gathen, J., Gerhard, J.: Modern computer algebra. Cambridge University Press, Cambridge (1999)"},{"key":"16_CR12","volume-title":"Foundations of Cryptography, Volume II Basic Applications","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography, Volume II Basic Applications. Cambridge University Press, Cambridge (2004)"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1145\/800070.802212","volume-title":"STOC \u201982: Proceedings of the fourteenth annual ACM symposium on Theory of computing","author":"S. Goldwasser","year":"1982","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption & how to play mental poker keeping secret all partial information. In: STOC \u201982: Proceedings of the fourteenth annual ACM symposium on Theory of computing, San Francisco, California, United States, pp. 365\u2013377. ACM Press, New York (1982)"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/3-540-54522-0_93","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"E. Kaltofen","year":"1991","unstructured":"Kaltofen, E., Saunders, D.: On Wiedemann\u2019s 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.\u00a0539, pp. 29\u201338. Springer, Heidelberg (1991)"},{"key":"16_CR15","first-page":"102","volume-title":"Proc. of the 8th IEEE Structure in Complexity Theory","author":"M. Karchmer","year":"1993","unstructured":"Karchmer, M., Wigderson, A.: On span programs. In: Proc. of the 8th IEEE Structure in Complexity Theory, pp. 102\u2013111. IEEE, Los Alamitos (1993)"},{"key":"16_CR16","unstructured":"Lindell, Y., Pinkas, B.: A proof of yao\u2019s protocol for secure two-party computation. eprint archive (2004)"},{"key":"16_CR17","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1109\/TIT.1969.1054260","volume":"it-15","author":"J.L. Massey","year":"1969","unstructured":"Massey, J.L.: Shift-register synthesis and BCH decoding. IEEE Trans. Inf. Theory\u00a0it-15, 122\u2013127 (1969)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"16_CR18","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1145\/288090.288106","volume-title":"ACM CCS 98","author":"D. Naccache","year":"1998","unstructured":"Naccache, D., Stern, J.: A new public-key cryptosystem based on higher residues. In: ACM CCS 98, pp. 59\u201366. ACM Press, New York (1998)"},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1007\/11681878_27","volume-title":"Theory of Cryptography","author":"K. Nissim","year":"2006","unstructured":"Nissim, K., Weinreb, E.: Communication efficient secure linear algebra. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 522\u2013541. Springer, Heidelberg (2006)"},{"key":"16_CR20","series-title":"Lecture Notes in Computer Science","first-page":"223","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Pallier","year":"1999","unstructured":"Pallier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1007\/3-540-46416-6_47","volume-title":"Advances in Cryptology - EUROCRYPT \u201991","author":"T.P. Pedersen","year":"1991","unstructured":"Pedersen, T.P.: A threshold cryptosystem without a trusted party. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 522\u2013526. Springer, Heidelberg (1991)"},{"issue":"2","key":"16_CR22","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM\u00a021(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"key":"16_CR23","first-page":"554","volume-title":"FOCS \u201999: Proceedings of the 40th Annual Symposium on Foundations of Computer Science","author":"T. Sander","year":"1999","unstructured":"Sander, T., Young, A., Yung, M.: Non-interactive cryptocomputing for NC1. In: FOCS \u201999: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, Washington, DC, USA, p. 554. IEEE Computer Society Press, Los Alamitos (1999)"},{"issue":"1","key":"16_CR24","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/TIT.1986.1057137","volume":"32","author":"D.H. Wiedemann","year":"1986","unstructured":"Wiedemann, D.H.: Solving sparse linear equations over finite fields. IEEE Trans. Inf. Theor.\u00a032(1), 54\u201362 (1986)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"16_CR25","first-page":"162","volume-title":"Proc. of the 27th IEEE Symp. on Foundations of Computer Science","author":"A.C. Yao","year":"1986","unstructured":"Yao, A.C.: How to generate and exchange secrets. In: Proc. of the 27th IEEE Symp. on Foundations of Computer Science, pp. 162\u2013167. IEEE, Los Alamitos (1986)"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70936-7_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:12:52Z","timestamp":1605744772000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70936-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540709350","9783540709367"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70936-7_16","relation":{},"subject":[]}}