{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:23:52Z","timestamp":1725560632131},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642144776"},{"type":"electronic","value":"9783642144783"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14478-3_58","type":"book-chapter","created":{"date-parts":[[2010,7,23]],"date-time":"2010-07-23T16:56:16Z","timestamp":1279904176000},"page":"576-582","source":"Crossref","is-referenced-by-count":0,"title":["Privacy Preserving Data Mining by Cyptography"],"prefix":"10.1007","author":[{"given":"Anand","family":"Sharma","sequence":"first","affiliation":[]},{"given":"Vibha","family":"Ojha","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"58_CR1","doi-asserted-by":"crossref","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols. In: Proc. of 22nd ACM Symposium on Theory of Computing (STOC), pp. 503\u2013513 (1990)","DOI":"10.1145\/100216.100287"},{"key":"58_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1007\/0-387-34805-0_48","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"M. Bellare","year":"1990","unstructured":"Bellare, M., Micali, S.: Non-Interactive Oblivious Transfer and Applications. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 547\u2013557. Springer, Heidelberg (1990)"},{"key":"58_CR3","first-page":"1","volume-title":"Proceedings of the 20th Annual Symposium on the Theory of Computing (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: Proceedings of the 20th Annual Symposium on the Theory of Computing (STOC), pp. 1\u20139. ACM, New York (1988)"},{"key":"58_CR4","first-page":"11","volume-title":"Proceedings of the 20th Annual Symposium on the Theory of Computing (STOC)","author":"D. Chaum","year":"1988","unstructured":"Chaum, D., Crepeau, C., Damgard, I.: Multiparty unconditionally secure protocols. In: Proceedings of the 20th Annual Symposium on the Theory of Computing (STOC), pp. 11\u201319. ACM, New York (1988)"},{"key":"58_CR5","doi-asserted-by":"crossref","unstructured":"Cramer, R.: Introduction to Secure Computation (2000), http:\/\/www.brics.dk\/~cramer\/papers\/CRAMER_revised.ps","DOI":"10.1007\/3-540-48969-X_2"},{"key":"58_CR6","unstructured":"Dai, W.: The Crypto++ library, benchmark (November 3, 2002), http:\/\/www.eskimo.com\/weidai\/cryptlib.html"},{"key":"58_CR7","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S. Even","year":"1985","unstructured":"Even, S., Goldreich, O., Lempel, A.: A Randomized Protocol for Signing Contracts. Communications of the ACM\u00a028, 637\u2013647 (1985)","journal-title":"Communications of the ACM"},{"issue":"5","key":"58_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/229459.229469","volume":"39","author":"R. Fagin","year":"1996","unstructured":"Fagin, R., Naor, M., Winkler, P.: Comparing Information Without Leaking It. Communications of the ACM\u00a039(5), 77\u201385 (1996)","journal-title":"Communications of the ACM"},{"key":"58_CR9","unstructured":"Goldreich, O.: Secure Multi-Party Computation (2002) (manuscript), http:\/\/www.wisdom.weizmann.ac.il\/oded\/pp.html"},{"key":"58_CR10","first-page":"218","volume-title":"Proceedings of the 19th Annual Symposium on the Theory of Computing (STOC)","author":"O. Goldreich","year":"1987","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to Play any Mental Game - A Completeness Theorem for Protocols with Honest Majority. In: Proceedings of the 19th Annual Symposium on the Theory of Computing (STOC), pp. 218\u2013229. ACM, New York (1987)"},{"key":"58_CR11","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: ACM STOC 1988, pp. 20\u201331 (1988)","DOI":"10.1145\/62212.62215"},{"issue":"3","key":"58_CR12","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s00145-001-0019-2","volume":"15","author":"Y. Lindell","year":"2002","unstructured":"Lindell, Y., Pinkas, B.: Privacy Preserving Data Mining. Journal of Cryptology\u00a015(3), 177\u2013206 (2002)","journal-title":"Journal of Cryptology"},{"key":"58_CR13","doi-asserted-by":"crossref","unstructured":"Luby, M.: Pseudorandomness and Cryptographic Applications. Princeton Computer Science Notes (1996)","DOI":"10.1515\/9780691206844"},{"key":"58_CR14","first-page":"245","volume-title":"Proceedings of the 31th Annual Symposium on the Theory of Computing (STOC)","author":"M. Naor","year":"1999","unstructured":"Naor, M., Pinkas, B.: Oblivious Transfer and Polynomial Evaluation. In: Proceedings of the 31th Annual Symposium on the Theory of Computing (STOC), pp. 245\u2013254. ACM, New York (1999)"},{"key":"58_CR15","unstructured":"Naor, M., Pinkas, B.: Efficient Oblivious Transfer Protocols. In: Proceedings of 12th SIAM Symposium on Discrete Algorithms (SODA), Washington DC, January 7-9, pp. 448\u2013457 (2001)"},{"key":"58_CR16","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B., Sumner, R.: Privacy Preserving Auctions and Mechanism Design. In: Proc. of the 1st ACM Conference on Electronic Commerce (November 1999)","DOI":"10.1145\/336992.337028"},{"key":"58_CR17","unstructured":"Rabin, M.O.: How to exchange secrets by oblivious transfer, Technical Memo TR-81, Aiken Computation Laboratory (1981)"},{"issue":"4","key":"58_CR18","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1145\/321724.321731","volume":"19","author":"J.E. Savage","year":"1972","unstructured":"Savage, J.E.: Computational work and time on finite machines. Journal of the ACM\u00a019(4), 660\u2013674 (1972)","journal-title":"Journal of the ACM"},{"key":"58_CR19","first-page":"162","volume-title":"Proceedings 27th Symposium on Foundations of Computer Science (FOCS)","author":"C. Yao","year":"1986","unstructured":"Yao, C.: How to generate and exchange secrets. In: Proceedings 27th Symposium on Foundations of Computer Science (FOCS), pp. 162\u2013167. IEEE, Los Alamitos (1986)"}],"container-title":["Communications in Computer and Information Science","Recent Trends in Network Security and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14478-3_58.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:53:35Z","timestamp":1606186415000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14478-3_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642144776","9783642144783"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14478-3_58","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2010]]}}}