{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T12:10:03Z","timestamp":1738325403823,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540850922"},{"type":"electronic","value":"9783540850939"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85093-9_8","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T10:24:37Z","timestamp":1218536677000},"page":"71-85","source":"Crossref","is-referenced-by-count":2,"title":["A Single Initialization Server for Multi-party Cryptography"],"prefix":"10.1007","author":[{"given":"Hugue","family":"Blier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alain","family":"Tapp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Beaver, D.: Commodity-based cryptography (extended abstract). In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pp. 446\u2013455 (1997)","DOI":"10.1145\/258533.258637"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Beaver, D.: Server-assisted cryptography. In: Proceedings of the New Security Paradigms Workshop, pp. 92\u2013106 (1998)","DOI":"10.1145\/310889.310923"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computation (extended abstract). In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Cachin, C., Cr\u00e9peau, C., Marcil, S.: Oblivious transfer with a memory bounded receiver. In: Proceedings of IEEE Symposium on Foundations of Computer Science, pp. 493\u2013502 (1998)","DOI":"10.1109\/SFCS.1998.743500"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/BFb0052243","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"C. Cachin","year":"1997","unstructured":"Cachin, C., Maurer, U.: Unconditional security against memory-bounded adversaries. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 292\u2013306. Springer, Heidelberg (1997)"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1007\/0-387-34805-0_50","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"R. Cleve","year":"1990","unstructured":"Cleve, R.: Controlled gradual disclosure schemes for random bits and their applications. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 573\u2013588. Springer, Heidelberg (1990)"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/3-540-48910-X_22","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"R. Cramer","year":"1999","unstructured":"Cramer, R., Damgaard, I., Dziembowski, S., Hirt, M., Rabin, T.: Efficient multi-party computations with dishonest majority. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 311\u2013326. Springer, Heidelberg (1999)"},{"key":"8_CR9","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., Maurer, U.: Efficient 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":"8_CR10","doi-asserted-by":"crossref","unstructured":"Crescenzo, G.D., Ishai, Y., Ostrovsky, R.: Universal service-providers for database private information retrieval. In: Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing, pp. 91\u2013100 (1998)","DOI":"10.1145\/277697.277713"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1007\/3-540-69053-0_21","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"C. Cr\u00e9peau","year":"1997","unstructured":"Cr\u00e9peau, C.: Efficient cryptographic protocols based on noisy channels. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 306\u2013317. Springer, Heidelberg (1997)"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Cr\u00e9peau, C.: Commitment. In: van Tilborg, H.C. (ed.) Encyclopedia of Cryptography and Security, vol.\u00a012, pp. 83\u201386 (2005)","DOI":"10.1007\/0-387-23483-7_71"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1007\/3-540-44750-4_9","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"C. Cr\u00e9peau","year":"1995","unstructured":"Cr\u00e9peau, C., Graaf, J., Tapp, A.: Committed oblivious transfer and private multi-party computation. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 110\u2013123. Springer, Heidelberg (1995)"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Cr\u00e9peau, C., Kilian, J.: Achieving oblivious transfer using weakened security assumptions. In: Proceedings of IEEE Symposium on Foundations of Computer Science, pp. 42\u201352 (1988)","DOI":"10.1109\/SFCS.1988.21920"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Cr\u00e9peau, C., Morozov, K., Wolf, S.: Efficient unconditional oblivious transfer from almost any noisy channel. In: Proceedings of Fourth Conference on Security in Communication Networks, pp. 47\u201359 (2004)","DOI":"10.1007\/978-3-540-30598-9_4"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Du, W., Han, Y.S., Chen, S.: Privacy-preserving multivariate statistical analysis: Linear regression and classification. In: Proceedings of the 4th SIAM International Conference on Data Mining, pp. 222\u2013233 (2004)","DOI":"10.1137\/1.9781611972740.21"},{"key":"8_CR17","unstructured":"Du, W., Zhan, Z.: Building decision tree classifier on private data. In: Proceedings of the IEEE ICDM Workshop on Privacy, Security and Data Mining, pp. 1\u20138 (2002)"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pp. 20\u201331 (1988)","DOI":"10.1145\/62212.62215"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments. In: Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pp. 723\u2013732 (1992)","DOI":"10.1145\/129712.129782"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","volume-title":"Applied Cryptography and Network Security","author":"A.C.A. Nascimento","year":"2004","unstructured":"Nascimento, A.C.A., M\u00fcller-Quade, J., Otsuka, A., Hanaoka, G., Imai, H.: Unconditionally non-interactive verifiable secret sharing secure against faulty majorities in the commodity based model. In: Jakobsson, M., Yung, M., Zhou, J. (eds.) ACNS 2004. LNCS, vol.\u00a03089, Springer, Heidelberg (2004)"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: Proceedings of the 21th Annual ACM Symposium on Theory of Computing, pp. 73\u201385 (1989)","DOI":"10.1145\/73007.73014"},{"key":"8_CR23","unstructured":"Rivest, R.: Unconditionally secure commitment and oblivious transfer schemes using private channels and a trusted initializer (unpublished manuscript) (1999)"},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"Yao, A.: Protocols for secure computations. In: Proceedings of IEEE Symposium on Foundations of Computer Science, pp.\u00a0160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Yao, A.: How to generate and exchange secrets. In: Proceedings of IEEE Symposium on Foundations of Computer Science, pp.\u00a0162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Information Theoretic Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85093-9_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T11:51:09Z","timestamp":1738324269000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85093-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540850922","9783540850939"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85093-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}