{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T06:31:35Z","timestamp":1772346695050,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540338512","type":"print"},{"value":"9783540338529","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11745853_4","type":"book-chapter","created":{"date-parts":[[2006,4,13]],"date-time":"2006-04-13T09:18:58Z","timestamp":1144919938000},"page":"44-57","source":"Crossref","is-referenced-by-count":11,"title":["Efficient Polynomial Operations in the Shared-Coefficients Setting"],"prefix":"10.1007","author":[{"given":"Payman","family":"Mohassel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew","family":"Franklin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Bar-Ilan, J., Beaver, D.: Non-cryptographic fault-tolerant computing in constant number of rounds of interaction. In: Proceedings of ACM PODC, pp. 201\u2013209 (1989)","DOI":"10.1145\/72981.72995"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Widgerson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proceedings of ACM STOC, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The Round Complexity of Secure Protocols. In: Proceedings of 22nd ACM STOC, pp. 503\u2013513 (1990)","DOI":"10.1145\/100216.100287"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Chaum, D., Crepeau, C., Damgard, I.: Multi-party unconditionally secure protocols. In: Proceedings of ACM STOC, pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"key":"4_CR5","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., Damg\u00e5rd, 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":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/3-540-44987-6_18","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"R. Cramer","year":"2001","unstructured":"Cramer, R., Damg\u00e5rd, I., Nielsen, J.: Multiparty computation from threshold homomorphic encryption. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 280\u2013300. Springer, Heidelberg (2001)"},{"key":"4_CR7","unstructured":"Damg\u00e5rd, I., Fitzi, M., Buus Nielsen, J., Toft, T.: How to split a shared secret into shared bits in constant-round. Cryptology ePrint Archive, Report 2005\/140 (2005), http:\/\/eprint.iacr.org\/"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-540-30576-7_17","volume-title":"Theory of Cryptography","author":"M. Freedman","year":"2005","unstructured":"Freedman, M., Ishai, Y., Pinkas, B., Reingold, O.: Keyword search and oblivious pseudorandom functions. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 303\u2013324. Springer, Heidelberg (2005)"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Feige, U., Kilian, J., Naor, M.: A Minimal Model for Secure Computation. In: Proceedings of ACM STOC 1994, pp. 554\u2013563 (1994)","DOI":"10.1145\/195058.195408"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24676-3_1","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"M. Freedman","year":"2004","unstructured":"Freedman, M., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 1\u201319. Springer, Heidelberg (2004)"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Fouque, P., Pointcheval, D.: Threshold cryptosystems secure against chosen-ciphertext attacks. In: Proceedings of Asiacrypt, pp. 573\u2013584 (2000)","DOI":"10.1007\/3-540-45682-1_21"},{"key":"4_CR12","volume-title":"Modern Computer Algebra","author":"J. Zur Gathen Von","year":"2003","unstructured":"Von Zur Gathen, J., Gerhard, J.: Modern Computer Algebra, 2nd edn. University Press, Cambridge (2003)","edition":"2"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: Proceedings of the 19th Annual ACM symposium on Theory of Computing, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Rabin, M., Rabin, T.: Simplified vss and fast-track multiparty computations with applications to threshold cryptography. In: Proceedings of ACM PODC, pp. 101\u2013111 (1998)","DOI":"10.1145\/277697.277716"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E.: Private Simultaneous Messages Protocols with Applications. In: Proceedings of 5th Israel Symposium on Theoretical Comp. Sc., pp. 174\u2013183 (1997)","DOI":"10.1109\/ISTCS.1997.595170"},{"key":"4_CR16","unstructured":"Ishai, Y., Kushilevitz, E.: Randomizing polynomials: A New Paradigm for Round-efficient Secure Computation. In: Proceedings of FOCS (2000)"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/11535218_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"L. Kissner","year":"2005","unstructured":"Kissner, L., Song, D.: Privacy preserving set operations. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 241\u2013257. Springer, Heidelberg (2005)"},{"key":"4_CR18","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Proceedings of Asiacrypt, pp. 573\u2013584 (2000)"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Shamir, A.: How to share a secret. In: CACM, pp. 612\u2013613 (1979)","DOI":"10.1145\/359168.359176"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computation. In: Proceedings of Focs, pp. 160-164 (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: How to generate and exchange secrets. In: Proceedings of 27th FOCS, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography - PKC 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11745853_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,7]],"date-time":"2023-05-07T02:04:04Z","timestamp":1683425044000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11745853_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540338512","9783540338529"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11745853_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}