{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:45:18Z","timestamp":1743011118909,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540367963"},{"type":"electronic","value":"9783540367994"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11805588_22","type":"book-chapter","created":{"date-parts":[[2006,7,18]],"date-time":"2006-07-18T06:53:12Z","timestamp":1153205592000},"page":"310-317","source":"Crossref","is-referenced-by-count":8,"title":["Information Theoretical Analysis of Two-Party Secret Computation"],"prefix":"10.1007","author":[{"given":"Da-Wei","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Churn-Jung","family":"Liau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi-Ting","family":"Chiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsan-sheng","family":"Hsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/3-540-44634-6_16","volume-title":"Algorithms and Data Structures","author":"M.J. Atallah","year":"2001","unstructured":"Atallah, M.J., Du, W.: Secure multi-party computational geometry. In: Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 2001. LNCS, vol.\u00a02125, pp. 165\u2013179. Springer, Heidelberg (2001)"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/11535706_9","volume-title":"Data and Applications Security XIX","author":"Y.-T. Chiang","year":"2005","unstructured":"Chiang, Y.-T., Wang, D.-W., Liau, C.-J., Hsu, T.-s.: Secrecy of two-party secure computation. In: Jajodia, S., Wijesekera, D. (eds.) Data and Applications Security 2005. LNCS, vol.\u00a03654, pp. 114\u2013123. Springer, Heidelberg (2005)"},{"key":"22_CR3","unstructured":"Du, W., Atallah, M.J.: Privacy-preserving cooperative statistical analysis. In: Proceedings of the 17th Annual Computer Security Applications Conference, New Orleans, Louisiana, USA, pp. 102\u2013110 (December 2001)"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Du, W., Atallah, M.J.: Secure multi-party computation problems and their applications: A review and open problems. In: New Security Paradigms Workshop, Cloudcroft, New, Mexico, USA, pp. 11\u201320 (September 2001)","DOI":"10.1145\/508171.508174"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Du, W., Zhan, Z.: A practical approach to solve secure multi-party computation problems. In: Proceedings of New Security Paradigms Workshop, Virginia Beach, Virginia, USA (September 2002)","DOI":"10.1145\/844102.844125"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Foundations of Cryptography. Basic Aplications, vol.\u00a0II. Cambridge (2004)","DOI":"10.1017\/CBO9780511721656"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game, or: A completeness theorem for protocols with honest majority. In: Proc. 19th ACM Symposium on Theory of Computing, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"issue":"9","key":"22_CR8","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1109\/TKDE.2004.45","volume":"16","author":"M. Kantarcoglu","year":"2004","unstructured":"Kantarcoglu, M., Clifton, C.: Privacy-preserving distributed mining of association rules on horizontally partitioned data. IEEE Transactions on Knowledge and Data Engineering\u00a016(9), 1026\u20131037 (2004)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"22_CR9","unstructured":"Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay \u2013 a secure two-party computation system. In: Proceedings of the 13th Symposium on Security, Usenix, pp. 287\u2013302 (2004)"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Vaidya, J., Clifton, C.: Privacy preserving association rule mining in vertically partitioned data. In: The Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 639\u2013644 (July 2002)","DOI":"10.1145\/775047.775142"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: How to generate and exchange secrets. In: Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science, pp. 162\u2013167 (November 1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Data and Applications Security XX"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11805588_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T23:15:26Z","timestamp":1555715726000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11805588_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540367963","9783540367994"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11805588_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}