{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:30:43Z","timestamp":1743003043783,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540892540"},{"type":"electronic","value":"9783540892557"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-89255-7_14","type":"book-chapter","created":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T07:27:00Z","timestamp":1228116420000},"page":"216-233","source":"Crossref","is-referenced-by-count":3,"title":["Towards Robust Computation on Encrypted Data"],"prefix":"10.1007","author":[{"given":"Manoj","family":"Prabhakaran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mike","family":"Rosulek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"14_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02252866","volume":"2","author":"M. Abadi","year":"1990","unstructured":"Abadi, M., Feigenbaum, J.: Secure circuit evaluation. J. Cryptology\u00a02(1), 1\u201312 (1990)","journal-title":"J. Cryptology"},{"issue":"1","key":"14_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0022-0000(89)90018-4","volume":"39","author":"M. Abadi","year":"1989","unstructured":"Abadi, M., Feigenbaum, J., Kilian, J.: On hiding information from an oracle. J. Comput. Syst. Sci.\u00a039(1), 21\u201350 (1989)","journal-title":"J. Comput. Syst. Sci."},{"key":"14_CR3","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":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/978-3-540-24676-3_30","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Crescenzo, G.D., Ostrovsky, R., Persiano, G.: Public key encryption with keyword search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 506\u2013522. Springer, Heidelberg (2004)"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-540-30576-7_18","volume-title":"Theory of Cryptography","author":"D. Boneh","year":"2005","unstructured":"Boneh, D., Goh, E.-J., Nissim, K.: Evaluating 2-DNF formulas on ciphertexts. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 325\u2013341. Springer, Heidelberg (2005)"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-540-76900-2_25","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"A. Broadbent","year":"2007","unstructured":"Broadbent, A., Tapp, A.: Information-theoretic security without an honest majority. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol.\u00a04833, pp. 410\u2013426. Springer, Heidelberg (2007)"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. Cryptology ePrint Archive, Report 2000\/067 (2005)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/11496137_30","volume-title":"Applied Cryptography and Network Security","author":"Y.-C. Chang","year":"2005","unstructured":"Chang, Y.-C., Mitzenmacher, M.: Privacy preserving keyword searches on remote encrypted data. In: Ioannidis, J., Keromytis, A.D., Yung, M. (eds.) ACNS 2005. LNCS, vol.\u00a03531, pp. 442\u2013455. Springer, Heidelberg (2005)"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM\u00a04(2) (February 1981)","DOI":"10.1145\/358549.358563"},{"key":"14_CR10","unstructured":"Chor, B., Gilboa, N., Naor, M.: Private information retrieval by keywords. TR CS0917, Department of Computer Science, Technion (1997)"},{"key":"14_CR11","first-page":"160","volume-title":"NSPW 1992-1993: Proceedings on the 1992-1993 workshop on New security paradigms","author":"Y. Desmedt","year":"1993","unstructured":"Desmedt, Y.: Computer security by redefining what a computer is. In: NSPW 1992-1993: Proceedings on the 1992-1993 workshop on New security paradigms, pp. 160\u2013166. ACM Press, New York (1993)"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1007\/3-540-39799-X_38","volume-title":"Advances in Cryptology","author":"J. Feigenbaum","year":"1986","unstructured":"Feigenbaum, J.: Encrypting problem instances: Or.., can you take advantage of someone without having to trust him? In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol.\u00a0218, pp. 477\u2013488. Springer, Heidelberg (1986)"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-540-30576-7_17","volume-title":"Theory of Cryptography","author":"M.J. Freedman","year":"2005","unstructured":"Freedman, M.J., Ishai, Y., Pinkas, B., Reingold, O.: Keyword search and oblivious pseudorandom functions. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 303\u2013324. Springer, Heidelberg (2005)"},{"key":"14_CR14","unstructured":"Goh, E.-J.: Secure indexes. Cryptology ePrint Archive, Report 2003\/216 (2003), http:\/\/eprint.iacr.org\/2003\/216\/"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-24852-1_3","volume-title":"Applied Cryptography and Network Security","author":"P. Golle","year":"2004","unstructured":"Golle, P., Staddon, J., Waters, B.R.: Secure conjunctive keyword search over encrypted data. In: Jakobsson, M., Yung, M., Zhou, J. (eds.) ACNS 2004. LNCS, vol.\u00a03089, pp. 31\u201345. Springer, Heidelberg (2004)"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-36288-6_11","volume-title":"Public Key Cryptography - PKC 2003","author":"J. Groth","year":"2002","unstructured":"Groth, J.: A verifiable secret shuffle of homomorphic encryptions. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol.\u00a02567, pp. 145\u2013160. Springer, Heidelberg (2002)"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/978-3-540-70936-7_31","volume-title":"Theory of Cryptography","author":"Y. Ishai","year":"2007","unstructured":"Ishai, Y., Paskin, A.: Evaluating branching programs on encrypted data. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 575\u2013594. Springer, Heidelberg (2007)"},{"issue":"2-3","key":"14_CR18","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1016\/j.jco.2003.08.023","volume":"20","author":"W. Ogata","year":"2004","unstructured":"Ogata, W., Kurosawa, K.: Oblivious keyword search. J. Complexity\u00a020(2-3), 356\u2013371 (2004)","journal-title":"J. Complexity"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-540-31815-6_7","volume-title":"Information Security Applications","author":"D.J. Park","year":"2005","unstructured":"Park, D.J., Kim, K., Lee, P.J.: Public key encryption with conjunctive field keyword search. In: Lim, C.H., Yung, M. (eds.) WISA 2004. LNCS, vol.\u00a03325, pp. 73\u201386. Springer, Heidelberg (2005)"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/978-3-540-70583-3_54","volume-title":"Automata, Languages and Programming","author":"M. Prabhakaran","year":"2008","unstructured":"Prabhakaran, M., Rosulek, M.: Homomorphic encryption with CCA security. 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. 667\u2013678. Springer, Heidelberg (2008), http:\/\/eprint.iacr.org\/2008\/079"},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/978-3-540-70583-3_54","volume-title":"Automata, Languages and Programming","author":"M. Prabhakaran","year":"2008","unstructured":"Prabhakaran, M., Rosulek, M.: Homomorphic encryption with CCA security. 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. 667\u2013678. Springer, Heidelberg (2008), http:\/\/eprint.iacr.org\/2008\/079"},{"key":"14_CR22","first-page":"169","volume-title":"Foundations of secure computation (Workshop","author":"R.L. Rivest","year":"1978","unstructured":"Rivest, R.L., Adleman, L., Dertouzos, M.L.: On data banks and privacy homomorphisms. In: Foundations of secure computation (Workshop, Georgia Inst. Tech., Atlanta, Ga, pp. 169\u2013179. Academic, New York (1978)"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Sander, T., Young, A., Yung, M.: Non-interactive cryptocomputing for NC1. In: FOCS, pp. 554\u2013567 (1999)","DOI":"10.1109\/SFFCS.1999.814630"},{"key":"14_CR24","unstructured":"Song, D.X., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: IEEE Symposium on Security and Privacy, pp. 44\u201355 (2000)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89255-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,5]],"date-time":"2025-02-05T01:36:28Z","timestamp":1738719388000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89255-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540892540","9783540892557"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89255-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}