{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:37:11Z","timestamp":1725521831175},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540892540"},{"type":"electronic","value":"9783540892557"}],"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-89255-7_3","type":"book-chapter","created":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T02:27:00Z","timestamp":1228098420000},"page":"37-53","source":"Crossref","is-referenced-by-count":3,"title":["Graph Design for Secure Multiparty Computation over Non-Abelian Groups"],"prefix":"10.1007","author":[{"given":"Xiaoming","family":"Sun","sequence":"first","affiliation":[]},{"given":"Andrew Chi-Chih","family":"Yao","sequence":"additional","affiliation":[]},{"given":"Christophe","family":"Tartary","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_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, pp. 1\u201310. ACM Press, New York (1988)"},{"key":"3_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139167383","volume-title":"Percolation","author":"B. Bollob\u00e0s","year":"2006","unstructured":"Bollob\u00e0s, B., Riordan, O.: Percolation. Cambridge University Press, Cambridge (September 2006)"},{"key":"3_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":"3_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":"3_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)"},{"issue":"6","key":"3_CR6","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Transactions on Information Theory\u00a022(6), 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"3_CR7","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. Gamal El","year":"1985","unstructured":"El Gamal, T.: A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory\u00a031(4), 469\u2013472 (1985)","journal-title":"IEEE Transactions on Information Theory"},{"key":"3_CR8","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)"},{"issue":"3","key":"3_CR9","doi-asserted-by":"publisher","first-page":"790","DOI":"10.1214\/aoms\/1177706894","volume":"28","author":"J.M. Hammersley","year":"1957","unstructured":"Hammersley, J.M.: Percolation processes: Lower bounds for the critical probability. The Annals of Mathematical Statistics\u00a028(3), 790\u2013795 (1957)","journal-title":"The Annals of Mathematical Statistics"},{"key":"3_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":"3_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":"3_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":"3_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-2730-9","volume-title":"Percolation Theory for Mathematicians","author":"H. Kesten","year":"1982","unstructured":"Kesten, H.: Percolation Theory for Mathematicians. Birkh\u00e4user, Basel (November 1982)"},{"key":"3_CR14","volume-title":"Algebra (Revised Third Edition)","author":"S. Lang","year":"2002","unstructured":"Lang, S.: Algebra (Revised Third Edition). Springer, Heidelberg (November 2002)"},{"issue":"4","key":"3_CR15","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s00145-001-0018-3","volume":"15","author":"S.S. Magliveras","year":"2002","unstructured":"Magliveras, S.S., Stinson, D.R., van Trung, T.: New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups. Journal of Cryptology\u00a015(4), 285\u2013297 (2002)","journal-title":"Journal of Cryptology"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/3-540-44647-8_28","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"S.-H. Paeng","year":"2001","unstructured":"Paeng, S.-H., Ha, K.-C., Kim, J.H., Chee, S., Park, C.: New public key cryptosystem using finite non Abelian groups. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 470\u2013485. Springer, Heidelberg (2001)"},{"issue":"2","key":"3_CR17","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.M.: A method for obtaining digital signatures and public key cryptosystems. Communication of the ACM\u00a021(2), 120\u2013126 (1978)","journal-title":"Communication of the ACM"},{"issue":"5","key":"3_CR18","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":"3_CR19","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","Advances in Cryptology - ASIACRYPT 2008"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89255-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T02:02:40Z","timestamp":1551664960000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89255-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540892540","9783540892557"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89255-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}