{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:33Z","timestamp":1725488973598},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540741428"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74143-5_33","type":"book-chapter","created":{"date-parts":[[2007,8,9]],"date-time":"2007-08-09T09:51:33Z","timestamp":1186653093000},"page":"591-612","source":"Crossref","is-referenced-by-count":8,"title":["On Secure Multi-party Computation in Black-Box Groups"],"prefix":"10.1007","author":[{"given":"Yvo","family":"Desmedt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Josef","family":"Pieprzyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ron","family":"Steinfeld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huaxiong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"crossref","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"N. Alon","year":"2000","unstructured":"Alon, N., Spencer, J.: The Probabilistic Method. Wiley-Interscience, New York (2000)"},{"key":"33_CR2","first-page":"201","volume-title":"Symposium on Principles Of Distributed Computing (PODC)","author":"J. Bar-Ilan","year":"1989","unstructured":"Bar-Ilan, J., Beaver, D.: Non-Cryptographic Fault-Tolerant Computing in a Constant Number of Rounds of Interaction. In: Symposium on Principles Of Distributed Computing (PODC), pp. 201\u2013209. ACM Press, New York (1989)"},{"key":"33_CR3","first-page":"1","volume-title":"Proc. 20-th STOC","author":"M. Ben-Or","year":"1988","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. In: Proc. 20-th STOC, pp. 1\u201310. ACM Press, New York (1988)"},{"key":"33_CR4","first-page":"11","volume-title":"STOC","author":"D. Chaum","year":"1988","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols. In: STOC. Proceedings of the twentieth annual ACM Symp. Theory of Computing, May 2\u20134, 1988, pp. 11\u201319. ACM Press, New York (1988)"},{"key":"33_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1007\/3-540-39200-9_37","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"R. Cramer","year":"2003","unstructured":"Cramer, R., Fehr, S., Ishai, Y., Kushilevitz, E.: Efficient Multi-Party Computation Over Rings. In: Biham, E. (ed.) Advances in Cryptology \u2013 EUROCRPYT 2003. LNCS, vol.\u00a02656, pp. 596\u2013613. Springer, Heidelberg (2003)"},{"key":"33_CR6","unstructured":"Desmedt, Y., Pieprzyk, J., Steinfeld, R., Wang, H.: On Secure Multi-Party Computation in Black-Box Groups. Full version of this paper(2007), Available at http:\/\/www.comp.mq.edu.au\/~rons\/"},{"key":"33_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/11602613_29","volume-title":"Algorithms and Computation","author":"Y. Desmedt","year":"2005","unstructured":"Desmedt, Y., Wang, Y., Burmester, M.: A Complete Characterization of Tolerable Adversary Structures for Secure Point-to-Point Transmissions. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 277\u2013287. Springer, Heidelberg (2005)"},{"key":"33_CR8","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.: New Directions in Cryptography. IEEE Trans. on Information Theory\u00a022, 644\u2013654 (1976)","journal-title":"IEEE Trans. on Information Theory"},{"issue":"4","key":"33_CR9","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. ElGamal","year":"1985","unstructured":"ElGamal, T.: A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. IEEE Tran. Info. Theory, IT\u00a031(4), 469\u2013472 (1985)","journal-title":"IEEE Tran. Info. Theory, IT"},{"key":"33_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography, Volume II","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography, Volume II. Cambridge University Press, Cambridge (2004)"},{"key":"33_CR11","first-page":"25","volume-title":"Symposium on Principles Of Distributed Computing (PODC)","author":"M. Hirt","year":"1997","unstructured":"Hirt, M., Maurer, U.: Complete Characterization of Adversaries Tolerable in Secure Multi-Party Computation (Extended Abstract). In: Symposium on Principles Of Distributed Computing (PODC), pp. 25\u201334. ACM Press, New York (1997)"},{"issue":"2","key":"33_CR12","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1137\/0405021","volume":"5","author":"E. Kushilevitz","year":"1992","unstructured":"Kushilevitz, E.: Privacy and Communication Complexity. SIAM J. on Discrete Mathematics\u00a05(2), 273\u2013284 (1992)","journal-title":"SIAM J. on Discrete Mathematics"},{"key":"33_CR13","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s00145-001-0018-3","volume":"15","author":"S. Magliveras","year":"2002","unstructured":"Magliveras, S., Stinson, D., van Trung, T.: New approaches to Designing Public Key Cryptosystems using One-Way Functions and Trapdoors in Finite Groups. Journal of Cryptology\u00a015, 285\u2013297 (2002)","journal-title":"Journal of Cryptology"},{"issue":"5\/6","key":"33_CR14","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1023\/A:1023023831510","volume":"91","author":"J. Noonan","year":"1998","unstructured":"Noonan, J.: New Upper Bounds for the Connective Constants of Self-Avoiding Walks. Journal of Statistical Physics\u00a091(5\/6), 871\u2013888 (1998)","journal-title":"Journal of Statistical Physics"},{"key":"33_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1007\/3-540-44647-8_28","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"S. Paeng","year":"2001","unstructured":"Paeng, S., Ha, K., Kim, J., 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)"},{"key":"33_CR16","doi-asserted-by":"crossref","unstructured":"P\u00f6nitz, A., Tittmann, P.: Improved Upper Bounds for Self-Avoiding Walks in \u2124 d . The Electronic Journal of Combinatorics\u00a07 (2000)","DOI":"10.37236\/1499"},{"issue":"2","key":"33_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.: A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM\u00a021(2), 120\u2013128 (1978)","journal-title":"Communications of the ACM"},{"key":"33_CR18","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, 612\u2013613 (1979)","journal-title":"Communications of the ACM"},{"issue":"5","key":"33_CR19","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P. Shor","year":"1997","unstructured":"Shor, P.: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM J. Comp.\u00a026(5), 1484\u20131509 (1997)","journal-title":"SIAM J. Comp."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - CRYPTO 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74143-5_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:18:11Z","timestamp":1605745091000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74143-5_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540741428"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74143-5_33","relation":{},"subject":[]}}