{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T02:49:44Z","timestamp":1768445384010,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642144226","type":"print"},{"value":"9783642144233","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14423-3_14","type":"book-chapter","created":{"date-parts":[[2010,6,18]],"date-time":"2010-06-18T12:13:34Z","timestamp":1276863214000},"page":"193-210","source":"Crossref","is-referenced-by-count":38,"title":["First CPIR Protocol with Data-Dependent Computation"],"prefix":"10.1007","author":[{"given":"Helger","family":"Lipmaa","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Srikant, R.: Privacy-Preserving Data Mining. In: Proceedings of the 2000 ACM SIGMOD Conference on Management of Data, Dallas, TX, USA, May 2000, pp. 439\u2013450 (2000)","DOI":"10.1145\/342009.335438"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","first-page":"50","volume-title":"Research in Cryptology","author":"C. Aguilar-Melchor","year":"2008","unstructured":"Aguilar-Melchor, C., Gaborit, P.: A Lattice-Based Computationally-Efficient Private Information Retrieval Protocol. In: Lucks, S., Sadeghi, A.-R., Wolf, C. (eds.) WEWORC 2007. LNCS, vol.\u00a04945, pp. 50\u201354. Springer, Heidelberg (2008), \n                      http:\/\/eprint.iacr.org\/2007\/446"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-44598-6_4","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"A. Beimel","year":"2000","unstructured":"Beimel, A., Ishai, Y., Malkin, T.: Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 55\u201373. Springer, Heidelberg (2000)"},{"issue":"1&2","key":"14_CR4","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0304-3975(94)00181-H","volume":"145","author":"Y. Breitbart","year":"1995","unstructured":"Breitbart, Y., Hunt III, H.B., Rosenkrantz, D.J.: On The Size of Binary Decision Diagrams Representing Boolean Functions. Theoretical Computer Science\u00a0145(1&2), 45\u201369 (1995)","journal-title":"Theoretical Computer Science"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1145\/383962.384047","volume-title":"PODC 2001","author":"R. Canetti","year":"2001","unstructured":"Canetti, R., Ishai, Y., Kumar, R., Reiter, M.K., Rubinfeld, R., Wright, R.N.: Selective Private Function Evaluation with Applications to Private Statistics. In: PODC 2001, Rhode Island, USA, August 26\u201329, pp. 293\u2013304. ACM Press, Newport (2001)"},{"key":"14_CR6","unstructured":"Carbunar, B., Sion, R.: On the Computational Practicality of Private Information Retrieval. In: NDSS 2007, San Diego, California, USA, February 27\u2013March 2 (2007)"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44586-2_9","volume-title":"Public Key Cryptography","author":"I. Damg\u00e5rd","year":"2001","unstructured":"Damg\u00e5rd, I., Jurik, M.: A Generalisation, a Simplification and Some Applications of Paillier\u2019s Probabilistic Public-Key System. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol.\u00a01992, pp. 119\u2013136. Springer, Heidelberg (2001)"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/3-540-45067-X_30","volume-title":"Information Security and Privacy","author":"I. Damg\u00e5rd","year":"2003","unstructured":"Damg\u00e5rd, I., Jurik, M.: A Length-Flexible Threshold Cryptosystem with Applications. In: Safavi-Naini, R., Seberry, J. (eds.) ACISP 2003. LNCS, vol.\u00a02727, pp. 350\u2013364. Springer, Heidelberg (2003)"},{"issue":"2\/3","key":"14_CR9","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1023\/A:1008647823331","volume":"10","author":"M. Fujita","year":"1997","unstructured":"Fujita, M., McGeer, P.C., Yang, J.C.Y.: Multi-Terminal Binary Decision Diagrams: An Efficient Data Structure for Matrix Representation. Formal Methods in System Design\u00a010(2\/3), 149\u2013169 (1997)","journal-title":"Formal Methods in System Design"},{"key":"14_CR10","unstructured":"Gasarch, W., Yerukhimovich, A.: Computationally Inexpensive cPIR (2007), Work in progress (January 2009), \n                      http:\/\/www.cs.umd.edu\/~arkady\/"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1145\/1536414.1536440","volume-title":"STOC 2009","author":"C. Gentry","year":"2009","unstructured":"Gentry, C.: Fully Homomorphic Encryption Using Ideal Lattices. In: Mitzenmacher, M. (ed.) STOC 2009, May 31\u2013Jun 2, 2009, pp. 169\u2013178. ACM Press, Bethesda (2009)"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1007\/11523468_65","volume-title":"Automata, Languages and Programming","author":"C. Gentry","year":"2005","unstructured":"Gentry, C., Ramzan, Z.: Single-Database Private Information Retrieval with Constant Communication Rate. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 803\u2013815. Springer, Heidelberg (2005)"},{"issue":"6","key":"14_CR13","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1109\/12.286311","volume":"43","author":"M.A. Heap","year":"1994","unstructured":"Heap, M.A., Mercer, M.R.: Least Upper Bounds on OBDD Sizes. IEEE Transactions on Computers\u00a043(6), 764\u2013767 (1994)","journal-title":"IEEE Transactions on Computers"},{"key":"14_CR14","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)"},{"key":"14_CR15","first-page":"364","volume-title":"FOCS 1997","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is Not Needed: Single Database, Computationally-Private Information Retrieval. In: FOCS 1997, October 20\u201322, pp. 364\u2013373. IEEE Computer Society, Los Alamitos (1997)"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-540-72738-5_14","volume-title":"Applied Cryptography and Network Security","author":"S. Laur","year":"2007","unstructured":"Laur, S., Lipmaa, H.: A New Protocol for Conditional Disclosure of Secrets And Its Applications. In: Katz, J., Yung, M. (eds.) ACNS 2007. LNCS, vol.\u00a04521, pp. 207\u2013225. Springer, Heidelberg (2007)"},{"issue":"6","key":"14_CR17","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1109\/12.144618","volume":"41","author":"H.T. Liaw","year":"1992","unstructured":"Liaw, H.T., Lin, C.S.: On the OBDD-Representation of General Boolean Functions. IEEE Transactions on Computers\u00a041(6), 661\u2013664 (1992)","journal-title":"IEEE Transactions on Computers"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1007\/11556992_23","volume-title":"Information Security","author":"H. Lipmaa","year":"2005","unstructured":"Lipmaa, H.: An Oblivious Transfer Protocol with Log-Squared Communication. In: Zhou, J., L\u00f3pez, J., Deng, R.H., Bao, F. (eds.) ISC 2005. LNCS, vol.\u00a03650, pp. 314\u2013328. Springer, Heidelberg (2005)"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-540-85886-7_30","volume-title":"Information Security","author":"H. Lipmaa","year":"2008","unstructured":"Lipmaa, H.: New Communication-Efficient Oblivious Transfer Protocols Based on Pairings. In: Wu, T.-C., Lei, C.-L., Rijmen, V., Lee, D.-T. (eds.) ISC 2008. LNCS, vol.\u00a05222, pp. 441\u2013454. Springer, Heidelberg (2008)"},{"key":"14_CR20","unstructured":"Lipmaa, H.: Private Branching Programs: On Communication-Efficient Cryptocomputing. Tech. Rep. 2008\/107, International Association for Cryptologic Research (2008), \n                      http:\/\/eprint.iacr.org\/2008\/107"},{"key":"14_CR21","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1145\/301250.301312","volume-title":"STOC 1999","author":"M. Naor","year":"1999","unstructured":"Naor, M., Pinkas, B.: Oblivious Transfer And Polynomial Evaluation. In: STOC 1999, May 1-4, 1999, pp. 245\u2013254. ACM Press, Atlanta (1999)"},{"key":"14_CR22","series-title":"Lecture Notes in Computer Science","first-page":"223","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"14_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/3-540-49649-1_28","volume-title":"Advances in Cryptology - ASIACRYPT\u201998","author":"J.P. Stern","year":"1998","unstructured":"Stern, J.P.: A New And Efficient All Or Nothing Disclosure of Secrets Protocol. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol.\u00a01514, pp. 357\u2013371. Springer, Heidelberg (1998)"},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Wegener, I.: Branching Programs and Binary Decision Diagrams: Theory and Applications. Monographs on Discrete Mathematics and Applications, Society for Industrial Mathematics (2000)","DOI":"10.1137\/1.9780898719789"}],"container-title":["Lecture Notes in Computer Science","Information, Security and Cryptology \u2013 ICISC 2009"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14423-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T19:46:50Z","timestamp":1675194410000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-14423-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642144226","9783642144233"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14423-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}