{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:12:26Z","timestamp":1725570746264},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642173721"},{"type":"electronic","value":"9783642173738"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17373-8_28","type":"book-chapter","created":{"date-parts":[[2010,12,2]],"date-time":"2010-12-02T15:22:55Z","timestamp":1291303375000},"page":"483-500","source":"Crossref","is-referenced-by-count":16,"title":["Multiparty Computation for Modulo Reduction without Bit-Decomposition and a Generalization to Bit-Decomposition"],"prefix":"10.1007","author":[{"given":"Chao","family":"Ning","sequence":"first","affiliation":[]},{"given":"Qiuliang","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-45708-9_27","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J. Algesheimer","year":"2002","unstructured":"Algesheimer, J., Camenisch, J.L., Shoup, V.: Efficient Computation Modulo A Shared Secret with Application to the Generation of Shared Safe-Prime Products. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 417\u2013432. Springer, Heidelberg (2002)"},{"key":"28_CR2","first-page":"1","volume-title":"20th Annual ACM Symposium on Theory of Computing","author":"M. Ben-Or","year":"1988","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness Theorems for Noncryptographic Fault-Tolerant Distributed Computations. In: 20th Annual ACM Symposium on Theory of Computing, pp. 1\u201310. ACM Press, New York (1988)"},{"key":"28_CR3","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.B., Nielsen, J.B.: Multiparty Computation from Threshold Homomorphic Encryption. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 280\u2013300. Springer, Heidelberg (2001)"},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BFb0036901","volume-title":"Automata, Languages and Programming","author":"A.K. Chandra","year":"1983","unstructured":"Chandra, A.K., Fortune, S., Lipton, R.J.: Lower Bounds for Constant Depth Circuits for Prefix Problems. In: D\u00edaz, J. (ed.) ICALP 1983. LNCS, vol.\u00a0154, pp. 109\u2013117. Springer, Heidelberg (1983)"},{"key":"28_CR5","first-page":"52","volume-title":"15th Annual ACM Symposium on Theory of Computing","author":"A.K. Chandra","year":"1983","unstructured":"Chandra, A.K., Fortune, S., Lipton, R.J.: Unbounded Fan-In Circuits and Associative Functions. In: 15th Annual ACM Symposium on Theory of Computing, pp. 52\u201360. ACM Press, New York (1983)"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/978-3-642-14577-3_6","volume-title":"FC 2010","author":"O. Catrina","year":"2010","unstructured":"Catrina, O., Saxena, A.: Secure Computation with Fixed-Point Numbers. In: Sion, R. (ed.) FC 2010. LNCS, vol.\u00a06052, pp. 35\u201350. Springer, Heidelberg (2010)"},{"key":"28_CR7","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.B. Damg\u00e5rd","year":"2006","unstructured":"Damg\u00e5rd, I.B., 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":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-540-45146-4_15","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"I.B. Damg\u00e5rd","year":"2003","unstructured":"Damg\u00e5rd, I.B., Nielsen, J.B.: Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 247\u2013264. Springer, Heidelberg (2003)"},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/978-3-642-14577-3_32","volume-title":"FC 2010","author":"J. Guajardo","year":"2010","unstructured":"Guajardo, J., Mennink, B., Schoenmakers, B.: Modulo Reduction for Paillier Encryptions and Application to Secure Statistical Analysis. In: Sion, R. (ed.) FC 2010. LNCS, vol.\u00a06052, pp. 375\u2013382. Springer, Heidelberg (2010)"},{"key":"28_CR10","first-page":"218","volume-title":"19th Annual ACM Symposium on Theory of Computing","author":"O. Goldreich","year":"1987","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to Play Any Mental Game or A Complete Theorem for Protocols with Honest Majority. In: 19th Annual ACM Symposium on Theory of Computing, pp. 218\u2013229. ACM Press, New York (1987)"},{"key":"28_CR11","first-page":"101","volume-title":"17th ACM Symposium on Principles of Distributed Computing","author":"R. Gennaro","year":"1998","unstructured":"Gennaro, R., Rabin, M.O., Rabin, T.: Simplified Vss and Fast-Track Multiparty Computations with Applications to Threshold Cryptography. In: 17th ACM Symposium on Principles of Distributed Computing, pp. 101\u2013110. ACM Press, New York (1998)"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-540-71677-8_23","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"T. Nishide","year":"2007","unstructured":"Nishide, T., Ohta, K.: Multiparty Computation for Interval, Equality, and Comparison without Bit-Decomposition Protocol. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol.\u00a04450, pp. 343\u2013360. Springer, Heidelberg (2007)"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Ning, C., Xu, Q.: Multiparty Computation for Modulo Reduction without Bit-Decomposition and A Generalization to Bit-Decomposition. Cryptology ePrint Archive, Report 2010\/266, http:\/\/eprint.iacr.org\/2010\/266","DOI":"10.1007\/978-3-642-17373-8_28"},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-642-14423-3_17","volume-title":"Information, Security and Cryptology \u2013 ICISC 2009","author":"T. Reistad","year":"2010","unstructured":"Reistad, T., Toft, T.: Linear, Constant-Rounds Bit-Decomposition. In: Lee, D., Hong, S. (eds.) ICISC 2009. LNCS, vol.\u00a05984, pp. 245\u2013257. Springer, Heidelberg (2010)"},{"issue":"11","key":"28_CR15","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to Share A Secret. Communications of the ACM\u00a022(11), 612\u2013613 (1979)","journal-title":"Communications of the ACM"},{"key":"28_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1007\/11761679_31","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"B. Schoenmakers","year":"2006","unstructured":"Schoenmakers, B., Tuyls, P.: Efficient Binary Conversion for Paillier Encrypted Values. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 522\u2013537. Springer, Heidelberg (2006)"},{"key":"28_CR17","unstructured":"Toft, T.: Primitives and Applications for Multi-party Computation. PhD thesis, University of Aarhus (2007), http:\/\/www.daimi.au.dk\/~ttoft\/publications\/dissertation.pdf"},{"key":"28_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-642-00862-7_24","volume-title":"Topics in Cryptology \u2013 CT-RSA 2009","author":"T. Toft","year":"2009","unstructured":"Toft, T.: Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values. In: Fischlin, M. (ed.) CT-RSA 2009. LNCS, vol.\u00a05473, pp. 357\u2013371. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17373-8_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:52:52Z","timestamp":1606186372000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17373-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642173721","9783642173738"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17373-8_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}