{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:58:38Z","timestamp":1725487118681},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540725398"},{"type":"electronic","value":"9783540725404"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72540-4_24","type":"book-chapter","created":{"date-parts":[[2007,6,22]],"date-time":"2007-06-22T15:59:46Z","timestamp":1182527986000},"page":"412-429","source":"Crossref","is-referenced-by-count":31,"title":["Non-interactive Proofs for Integer Multiplication"],"prefix":"10.1007","author":[{"given":"Ivan","family":"Damg\u00e5rd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rune","family":"Thorbek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/3-540-36178-2_13","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"M. Abe","year":"2002","unstructured":"Abe, M., Cramer, R.J.F., Fehr, S.: Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 206\u2013223. Springer, Heidelberg (2002)"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. In: Proc. ACM STOC \u201988, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"issue":"3","key":"24_CR3","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/S0097539701398521","volume":"32","author":"D. Boneh","year":"2003","unstructured":"Boneh, D., Franklin, M.K.: Identity-Based Encryption from the Weil Pairing. SIAM J. Comput.\u00a032(3), 586\u2013615 (2003)","journal-title":"SIAM J. Comput."},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/11889663_10","volume-title":"Financial Cryptography and Data Security","author":"P. Bogetoft","year":"2006","unstructured":"Bogetoft, P., Damg\u00e5rd, I.B., Jakobsen, T., Nielsen, K., Pagter, J., Toft, T.: A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation. In: Di Crescenzo, G., Rubin, A. (eds.) FC 2006. LNCS, vol.\u00a04107, pp. 142\u2013147. Springer, Heidelberg (2006)"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/3-540-45539-6_31","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"F. Boudot","year":"2000","unstructured":"Boudot, F.: Efficient Proofs that a Committed Number Lies in an Interval. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 431\u2013444. Springer, Heidelberg (2000)"},{"key":"24_CR6","unstructured":"Canetti, R.: Universally Composable Security: A New Paradigm for Cryptographic Protocols. In: Proc. of FOCS 2001, pp. 136\u2013145 (2001), See also updated version on the Eprint archive, http:\/\/www.iacr.org"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-540-24676-3_13","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"R. Canetti","year":"2004","unstructured":"Canetti, R., Halevi, S., Katz, J.: Chosen-Ciphertext Security from Identity-Based Encryption. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 207\u2013222. Springer, Heidelberg (2004)"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multi-Party Unconditionally Secure Protocols. In: Proc. of ACM STOC \u201988, pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"key":"24_CR9","volume-title":"26th Annual Symposium on Foundations of Computer Science","author":"B. Chor","year":"1985","unstructured":"Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults (extended abstract). In: 26th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos (1985)"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-540-30576-7_19","volume-title":"Theory of Cryptography","author":"R. Cramer","year":"2005","unstructured":"Cramer, R., Damg\u00e5rd, I., Ishai, Y.: Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 342\u2013362. Springer, Heidelberg (2005)"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1007\/11535218_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"R.J.F. Cramer","year":"2005","unstructured":"Cramer, R.J.F., Fehr, S., Stam, M.: Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 344\u2013360. Springer, Heidelberg (2005)"},{"key":"24_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/11681878_15","volume-title":"Theory of Cryptography","author":"I. Damg\u00e5rd","year":"2006","unstructured":"Damg\u00e5rd, 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.\u00a03876, pp. 285\u2013304. Springer, Heidelberg (2006)"},{"key":"24_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/11745853_6","volume-title":"Public Key Cryptography - PKC 2006","author":"I.B. Damg\u00e5rd","year":"2006","unstructured":"Damg\u00e5rd, I.B., Thorbek, R.: Linear Integer Secret Sharing and Distributed Exponentiation. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T.G. (eds.) PKC 2006. LNCS, vol.\u00a03958, pp. 75\u201390. Springer, Heidelberg (2006)"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Thorbek, R.: Non-Interactive Proofs for Integer Multiplication (full version). The Eprint archive (eprint.iacr.org\/2007\/086), http:\/\/www.iacr.org","DOI":"10.1007\/978-3-540-72540-4_24"},{"key":"24_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/BFb0054115","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"E. Fujisaki","year":"1998","unstructured":"Fujisaki, E., Okamoto, T.: A Practical and Provably Secure Scheme for Publicly Verifiable Secret Sharing and Its Applications. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 32\u201346. Springer, Heidelberg (1998)"},{"key":"24_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/BFb0052225","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"E. Fujisaki","year":"1997","unstructured":"Fujisaki, E., Okamoto, T.: Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 16\u201330. Springer, Heidelberg (1997)"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Rabin, M., Rabin, T.: Simplified VSS and Fast-Track Multiparty Computations with Applications to Threshold Cryptography. In: Proc. of ACM PODC\u201998 (1998)","DOI":"10.1145\/277697.277716"},{"key":"24_CR18","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: Proc. of ACM STOC \u201987, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"24_CR19","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s001459910003","volume":"13","author":"M. Hirt","year":"2000","unstructured":"Hirt, M., Maurer, U.: Player Simulation and General Adversary Structures in Perfect Multiparty Computation. Journal of Cryptology: the journal of the International Association for Cryptologic Research\u00a013, 31\u201360 (2000)","journal-title":"Journal of Cryptology: the journal of the International Association for Cryptologic Research"},{"key":"24_CR20","unstructured":"Ito, M., Saito, A., Nishizeki, T.: Secret sharing schemes realizing general access structures. In: Proc. IEEE Global Telecommunication Conf., Globecom 87, pp. 99\u2013102 (1987)"},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"Karchmer, M., Wigderson, A.: On Span Programs. In: Proc. of 8th IEEE Structure in Complexity Theory, pp. 102\u2013111 (1993)","DOI":"10.1109\/SCT.1993.336536"},{"key":"24_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"T.P. Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-interactive and Information-Theoretic Secure Verifiable Secret Sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 129\u2013140. Springer, Heidelberg (1992)"},{"key":"24_CR23","doi-asserted-by":"crossref","unstructured":"Shamir, A.: How to share a secret. Communication of the Association for Computing Machinery\u00a022(11) (1979)","DOI":"10.1145\/359168.359176"},{"key":"24_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/11426639_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"B. Waters","year":"2005","unstructured":"Waters, B.: Efficient Identity-Based Encryption Without Random Oracles. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 114\u2013127. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - EUROCRYPT 2007"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72540-4_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:01:49Z","timestamp":1605744109000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72540-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540725398","9783540725404"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72540-4_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}