{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:34:24Z","timestamp":1725521664052},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540896401"},{"type":"electronic","value":"9783540896418"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-89641-8_12","type":"book-chapter","created":{"date-parts":[[2008,11,26]],"date-time":"2008-11-26T13:02:53Z","timestamp":1227704573000},"page":"162-177","source":"Crossref","is-referenced-by-count":0,"title":["Counting Method for Multi-party Computation over Non-abelian Groups"],"prefix":"10.1007","author":[{"given":"Youming","family":"Qiao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christophe","family":"Tartary","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","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 non-cryptographic fault-tolerant distributed computation. In: 20th Annual ACM Symposium on Theory of Computing, Chicago, USA, May 1988, pp. 1\u201310. ACM Press, New York (1988)"},{"key":"12_CR2","unstructured":"Bogetoft, P., Christensen, D.L., Damg\u00e5rd, I.B., Geisler, M., Jakobsen, T., Kr\u00f8igaard, M., Nielsen, J.D., Nielsen, J.B., Nielsen, K., Pagter, J., Schwartzbach, M., Toft, T.: Multiparty computation goes lives. Cryptology ePrint Archive, Report 2008\/068 (January 2008), \n                    \n                      http:\/\/eprint.iacr.org\/2008\/068.pdf"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-45539-6_22","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"R. Cramer","year":"2000","unstructured":"Cramer, R., Damg\u00e5rd, I.B., Maurer, U.: General secure multi-party computation from any linear secret-sharing scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 316\u2013334. Springer, Heidelberg (2000)"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/11818175_30","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"I.B. Damg\u00e5rd","year":"2006","unstructured":"Damg\u00e5rd, I.B., Ishai, Y.: Scalable secure multiparty computation. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 501\u2013520. Springer, Heidelberg (2006)"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/978-3-540-74143-5_33","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"Y. Desmedt","year":"2007","unstructured":"Desmedt, Y., Pieprzyk, J., Steinfeld, R., Wang, H.: On secure multi-party computation in black-box groups. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 591\u2013612. Springer, Heidelberg (2007)"},{"key":"12_CR6","series-title":"Basic Applications","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography. Basic Applications, vol.\u00a0II. Cambridge University Press, Cambridge (2004)"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/3-540-48184-2_6","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"O. Goldreich","year":"1988","unstructured":"Goldreich, O., Vainish, R.: How to solve any protocol problem - an efficiency improvement. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 73\u201386. Springer, Heidelberg (1988)"},{"key":"12_CR8","first-page":"1","volume-title":"16th annual ACM symposium on Principles of Distributed Computing","author":"S. Goldwasser","year":"1997","unstructured":"Goldwasser, S.: Multi-party computations: Past and present. In: 16th annual ACM symposium on Principles of Distributed Computing, Santa Barbara, USA, August 1997, pp. 1\u20136. ACM Press, New York (1997)"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1088\/0305-4470\/38\/3\/002","volume":"38","author":"A.J. Guttmann","year":"2004","unstructured":"Guttmann, A.J., Parviainen, R., Rechnitzer, A.: Self-avoiding walks and trails on the 3.12 lattice. Journal of Physics A: Mathematical and General\u00a038, 543\u2013554 (2004)","journal-title":"Journal of Physics A: Mathematical and General"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/3-540-44647-8_6","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"M. Hirt","year":"2001","unstructured":"Hirt, M., Maurer, U.: Robustness for free in unconditional multi-party computation. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 101\u2013118. Springer, Heidelberg (2001)"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-44448-3_12","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"M. Hirt","year":"2000","unstructured":"Hirt, M., Maurer, U., Przydatek, B.: Efficient secure multi-party computation. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 143\u2013161. Springer, Heidelberg (2000)"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/11818175_28","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"M. Hirt","year":"2006","unstructured":"Hirt, M., Nielsen, J.B.: Robust multiparty computation with linear communication complexity. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 463\u2013482. Springer, Heidelberg (2006)"},{"key":"12_CR13","volume-title":"Algebra (Revised Third Edition)","author":"S. Lang","year":"2002","unstructured":"Lang, S.: Algebra (Revised Third Edition). Springer, Heidelberg (2002)"},{"issue":"6-I","key":"12_CR14","first-page":"695","volume":"31","author":"K.-Y. Lin","year":"1993","unstructured":"Lin, K.-Y., Hsaio, Y.C.: Self-avoiding walks and related problems. Chinese Journal of Physics\u00a031(6-I), 695\u2013708 (1993)","journal-title":"Chinese Journal of Physics"},{"key":"12_CR15","series-title":"Probability and Its Applications","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4132-4","volume-title":"The Self-Avoiding Walk","author":"N. Madras","year":"1996","unstructured":"Madras, N., Slade, G.: The Self-Avoiding Walk. Probability and Its Applications. Birkh\u00e4user, Basel (1996)"},{"issue":"5","key":"12_CR16","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P.W. Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing\u00a026(5), 1484\u20131509 (1997)","journal-title":"SIAM Journal on Computing"},{"key":"12_CR17","first-page":"80","volume-title":"23rd Annual IEEE Symposium on Foundations of Computer Science","author":"A.C.-C. Yao","year":"1982","unstructured":"Yao, A.C.-C.: Protocols for secure computations. In: 23rd Annual IEEE Symposium on Foundations of Computer Science, Chicago, USA, November 1982, pp. 80\u201391. IEEE Press, Los Alamitos (1982)"}],"container-title":["Lecture Notes in Computer Science","Cryptology and Network Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89641-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T00:14:10Z","timestamp":1551658450000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89641-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540896401","9783540896418"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89641-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}