{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T08:36:49Z","timestamp":1765960609584},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642007293"},{"type":"electronic","value":"9783642007309"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-00730-9_21","type":"book-chapter","created":{"date-parts":[[2009,3,17]],"date-time":"2009-03-17T07:22:23Z","timestamp":1237274543000},"page":"336-353","source":"Crossref","is-referenced-by-count":21,"title":["Generalized Universal Circuits for Secure Evaluation of Private Functions with Application to Data Classification"],"prefix":"10.1007","author":[{"given":"Ahmad-Reza","family":"Sadeghi","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Schneider","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44987-6_8","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"W. Aiello","year":"2001","unstructured":"Aiello, W., Ishai, Y., Reingold, O.: Priced oblivious transfer: How to sell digital goods. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 119\u2013135. Springer, Heidelberg (2001)"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/3-540-45682-1_22","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"Y.-C. Chang","year":"2001","unstructured":"Chang, Y.-C., Lu, C.-J.: Oblivious polynomial evaluation and oblivious neural learning. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 369\u2013384. Springer, Heidelberg (2001)"},{"key":"21_CR3","unstructured":"Drewes, R.: An artifical neural network spam classifier (August 2002), \n                    \n                      http:\/\/www.interstice.com\/drewes\/cs676\/spam-nn\/"},{"issue":"1","key":"21_CR4","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0893-6080(88)90023-8","volume":"1","author":"R.P. Gorman","year":"1988","unstructured":"Gorman, R.P., Sejnowski, T.J.: Analysis of hidden units in a layered network trained to classify sonar targets. Neural Networks\u00a01(1), 75\u201389 (1988)","journal-title":"Neural Networks"},{"key":"21_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-540-78967-3_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"V. Goyal","year":"2008","unstructured":"Goyal, V., Mohassel, P., Smith, A.: Efficient two party and multi party computation against covert adversaries. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 289\u2013306. Springer, Heidelberg (2008)"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-540-85230-8_8","volume-title":"Financial Cryptography and Data Security","author":"V. Gunupudi","year":"2008","unstructured":"Gunupudi, V., Tate, S.R.: Generalized non-interactive oblivious transfer using count-limited objects with applications to secure mobile agents. In: Tsudik, G. (ed.) FC 2008. LNCS, vol.\u00a05143, pp. 98\u2013112. Springer, Heidelberg (2008)"},{"issue":"5","key":"21_CR7","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/0893-6080(89)90020-8","volume":"2","author":"K. Hornik","year":"1989","unstructured":"Hornik, K., Stinchcombe, M., White, H.: Multilayer feedforward networks are universal approximators. Neural Networks\u00a02(5), 359\u2013366 (1989)","journal-title":"Neural Networks"},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-540-45146-4_9","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"Y. Ishai","year":"2003","unstructured":"Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending Oblivious Transfers Efficiently. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 145\u2013161. Springer, Heidelberg (2003)"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/978-3-540-70583-3_40","volume-title":"Automata, Languages and Programming","author":"V. Kolesnikov","year":"2008","unstructured":"Kolesnikov, V., Schneider, T.: Improved garbled circuit: Free XOR gates and applications. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 486\u2013498. Springer, Heidelberg (2008)"},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-540-85230-8_7","volume-title":"Financial Cryptography and Data Security","author":"V. Kolesnikov","year":"2008","unstructured":"Kolesnikov, V., Schneider, T.: A practical universal circuit construction and secure evaluation of private functions. In: Tsudik, G. (ed.) FC 2008. LNCS, vol.\u00a05143, pp. 83\u201397. Springer, Heidelberg (2008), \n                    \n                      http:\/\/thomaschneider.de\/FairplayPF"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-540-85855-3_2","volume-title":"Security and Cryptography for Networks","author":"Y. Lindell","year":"2008","unstructured":"Lindell, Y., Pinkas, B., Smart, N.: Implementing two-party computation efficiently with security against malicious adversaries. In: Ostrovsky, R., De Prisco, R., Visconti, I. (eds.) SCN 2008. LNCS, vol.\u00a05229, pp. 2\u201320. Springer, Heidelberg (2008)"},{"key":"21_CR12","unstructured":"Lindell, Y., Pinkas, B.: A proof of Yao\u2019s protocol for secure two-party computation. Cryptology ePrint Archive, Report 2004\/175 (2004)"},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-72540-4_4","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"Y. Lindell","year":"2007","unstructured":"Lindell, Y., Pinkas, B.: An efficient protocol for secure two-party computation in the presence of malicious adversaries. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 52\u201378. Springer, Heidelberg (2007)"},{"key":"21_CR14","unstructured":"Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay \u2014 a secure two-party computation system. In: USENIX (2004), \n                    \n                      http:\/\/www.cs.huji.ac.il\/project\/Fairplay\/fairplay.html"},{"issue":"1","key":"21_CR15","first-page":"1","volume":"2007","author":"C. Orlandi","year":"2007","unstructured":"Orlandi, C., Piva, A., Barni, M.: Oblivious neural network computing via homomorphic encryption. European Journal of Information Systems (EURASIP)\u00a02007(1), 1\u201310 (2007)","journal-title":"European Journal of Information Systems (EURASIP)"},{"issue":"2","key":"21_CR16","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/772862.772865","volume":"4","author":"B. Pinkas","year":"2002","unstructured":"Pinkas, B.: Cryptographic techniques for privacy-preserving data mining. SIGKDD Explor. Newsl.\u00a04(2), 12\u201319 (2002)","journal-title":"SIGKDD Explor. Newsl."},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Piva, A., Caini, M., Bianchi, T., Orlandi, C., Barni, M.: Enhancing privacy in remote data classification. In: New Approaches for Security, Privacy and Trust in Complex Environments (SEC 2008) (2008)","DOI":"10.1007\/978-0-387-09699-5_3"},{"issue":"2-3","key":"21_CR18","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1023\/A:1016545907026","volume":"1","author":"V.P. Plagianakos","year":"2002","unstructured":"Plagianakos, V.P., Vrahatis, M.N.: Parallel evolutionary training algorithms for hardware-friendly neural networks. Natural Computing\u00a01(2-3), 307\u2013322 (2002)","journal-title":"Natural Computing"},{"key":"21_CR19","unstructured":"Rabin, M.O.: How to exchange secrets with oblivious transfer. Technical report, Harward University, Available at Cryptology ePrint Archive, Report 2005\/187 (1981)"},{"key":"21_CR20","first-page":"554","volume-title":"Proc. 40th IEEE Symp. on Foundations of Comp. Science, FOCS 1999","author":"T. Sander","year":"1999","unstructured":"Sander, T., Young, A., Yung, M.: Non-interactive cryptocomputing for NC\n                  1. In: Proc. 40th IEEE Symp. on Foundations of Comp. Science, FOCS 1999, New York, pp. 554\u2013566. IEEE, Los Alamitos (1999)"},{"issue":"3","key":"21_CR21","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/BF02481135","volume":"3","author":"K. Sato","year":"1999","unstructured":"Sato, K., Hikawa, H.: Implementation of multilayer neural network with threshold neurons and its analysis. Artificial Life and Robotics\u00a03(3), 170\u2013175 (1999)","journal-title":"Artificial Life and Robotics"},{"key":"21_CR22","unstructured":"Schneider, T.: Practical secure function evaluation. Master\u2019s thesis, University of Erlangen-Nuremberg (2008), \n                    \n                      http:\/\/thomaschneider.de\/theses\/da\/"},{"key":"21_CR23","unstructured":"StatSoft, Inc. STATISTICA Automated Neural Networks (2008), \n                    \n                      http:\/\/www.statsoft.com\/products\/stat_nn.html"},{"key":"21_CR24","unstructured":"Tebelskis, J.: Speech Recognition using Neural Networks. PhD thesis, School of Computer Science, Pittsburgh (1995)"},{"key":"21_CR25","first-page":"196","volume-title":"STOC 1976","author":"L.G. Valiant","year":"1976","unstructured":"Valiant, L.G.: Universal circuits (preliminary report). In: STOC 1976, pp. 196\u2013203. ACM Press, New York (1976)"},{"issue":"1","key":"21_CR26","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1145\/321439.321449","volume":"15","author":"A. Waksman","year":"1968","unstructured":"Waksman, A.: A permutation network. J. ACM\u00a015(1), 159\u2013163 (1968)","journal-title":"J. ACM"},{"key":"21_CR27","first-page":"162","volume-title":"FOCS 1986","author":"A.C. Yao","year":"1986","unstructured":"Yao, A.C.: How to generate and exchange secrets. In: FOCS 1986, Toronto, pp. 162\u2013167. IEEE, Los Alamitos (1986)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology \u2013 ICISC 2008"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00730-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,6]],"date-time":"2019-03-06T22:28:19Z","timestamp":1551911299000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00730-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642007293","9783642007309"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00730-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}