{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:32:09Z","timestamp":1742963529827,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319678153"},{"type":"electronic","value":"9783319678160"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-67816-0_16","type":"book-chapter","created":{"date-parts":[[2017,9,12]],"date-time":"2017-09-12T06:43:16Z","timestamp":1505198596000},"page":"275-294","source":"Crossref","is-referenced-by-count":1,"title":["Privacy-Preserving Deterministic Automata Evaluation with Encrypted Data Blocks"],"prefix":"10.1007","author":[{"given":"Giovanni","family":"Di Crescenzo","sequence":"first","affiliation":[]},{"given":"Brian","family":"Coan","sequence":"additional","affiliation":[]},{"given":"Jonathan","family":"Kirsch","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,13]]},"reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-642-03549-4_20","volume-title":"Financial Cryptography and Data Security","author":"P Bogetoft","year":"2009","unstructured":"Bogetoft, P., Christensen, D.L., Damg\u00e5rd, I., Geisler, M., Jakobsen, T., Kr\u00f8igaard, M., Nielsen, J.D., Nielsen, J.B., Nielsen, K., Pagter, J., Schwartzbach, M., Toft, T.: Secure multiparty computation goes live. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol. 5628, pp. 325\u2013343. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-03549-4_20"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-24676-3_4","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X.: Short signatures without random oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 56\u201373. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-24676-3_4"},{"doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. In: IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, pp. 97\u2013106, 22\u201325 October 2011","key":"16_CR3","DOI":"10.1109\/FOCS.2011.12"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/3-540-45472-1_6","volume-title":"Financial Cryptography","author":"G Crescenzo","year":"2001","unstructured":"Crescenzo, G.: Private selective payment protocols. In: Frankel, Y. (ed.) FC 2000. LNCS, vol. 1962, pp. 72\u201389. Springer, Heidelberg (2001). doi: 10.1007\/3-540-45472-1_6"},{"doi-asserted-by":"crossref","unstructured":"Di Crescenzo, G., Coan, B.A., Kirsch, J.: Efficient computations over encrypted data blocks. In: Proceedings of the 40th International Symposium on Mathematical Foundations of Computer Science, Part II, MFCS 2015, Milan, Italy, pp. 274\u2013286, 24\u201328 August 2015","key":"16_CR5","DOI":"10.1007\/978-3-662-48054-0_23"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/3-540-48910-X_6","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1999","author":"G Crescenzo Di","year":"1999","unstructured":"Di Crescenzo, G., Ostrovsky, R., Rajagopalan, S.: Conditional oblivious transfer and timed-release encryption. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 74\u201389. Springer, Heidelberg (1999). doi: 10.1007\/3-540-48910-X_6"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-540-30580-4_28","volume-title":"Public Key Cryptography - PKC 2005","author":"Y Dodis","year":"2005","unstructured":"Dodis, Y., Yampolskiy, A.: A verifiable random function with short proofs and keys. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol. 3386, pp. 416\u2013431. Springer, Heidelberg (2005). doi: 10.1007\/978-3-540-30580-4_28"},{"key":"16_CR8","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":"MJ 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. 3378, pp. 303\u2013324. Springer, Heidelberg (2005). doi: 10.1007\/978-3-540-30576-7_17"},{"issue":"2","key":"16_CR9","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s00145-014-9193-x","volume":"29","author":"R Gennaro","year":"2016","unstructured":"Gennaro, R., Hazay, C., Sorensen, J.S.: Automata evaluation and text search protocols with simulation-based security. J. Crypt. 29(2), 243\u2013282 (2016)","journal-title":"J. Crypt."},{"doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the of 41st ACM STOC, pp. 169\u2013178 (2009)","key":"16_CR10","DOI":"10.1145\/1536414.1536440"},{"key":"16_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"The Foundations of Cryptography - Basic Applications","author":"O Goldreich","year":"2004","unstructured":"Goldreich, O.: The Foundations of Cryptography - Basic Applications, vol. 2. Cambridge University Press, New York (2004)"},{"issue":"4","key":"16_CR12","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM 33(4), 792\u2013807 (1986)","journal-title":"J. ACM"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-642-13013-7_19","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"C Hazay","year":"2010","unstructured":"Hazay, C., Nissim, K.: Efficient set operations in the presence of malicious adversaries. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 312\u2013331. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-13013-7_19"},{"doi-asserted-by":"crossref","unstructured":"Huang, Y., Evans, D., Katz, J., Malka, L.: Faster secure two-party computation using garbled circuits. In: Proceedings of 20th USENIX Security Symposium (2011)","key":"16_CR14","DOI":"10.1007\/978-3-642-25560-1_2"},{"key":"16_CR15","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. 4392, pp. 575\u2013594. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-70936-7_31"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/978-3-642-00457-5_34","volume-title":"Theory of Cryptography","author":"S Jarecki","year":"2009","unstructured":"Jarecki, S., Liu, X.: Efficient oblivious pseudorandom function with applications to adaptive OT and secure computation of set intersection. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 577\u2013594. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-00457-5_34"},{"unstructured":"Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay - secure two-party computation system. In: Proceedings of 13th USENIX Security Symposium, pp. 287\u2013302 (2004)","key":"16_CR17"},{"key":"16_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-642-27954-6_25","volume-title":"Topics in Cryptology \u2013 CT-RSA 2012","author":"P Mohassel","year":"2012","unstructured":"Mohassel, P., Niksefat, S., Sadeghian, S., Sadeghiyan, B.: An efficient protocol for oblivious DFA evaluation and applications. In: Dunkelman, O. (ed.) CT-RSA 2012. LNCS, vol. 7178, pp. 398\u2013415. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-27954-6_25"},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/3-540-48405-1_36","volume-title":"Advances in Cryptology \u2014 CRYPTO 1999","author":"M Naor","year":"1999","unstructured":"Naor, M., Pinkas, B.: Oblivious transfer with adaptive queries. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 573\u2013590. Springer, Heidelberg (1999). doi: 10.1007\/3-540-48405-1_36"},{"unstructured":"Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In: Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, Washington, DC, USA, pp. 448\u2013457, 7\u20139 January 2001","key":"16_CR20"},{"unstructured":"Rabin, M.O.: How to exchange secrets with oblivious transfer. IACR Cryptology ePrint Archive, 2005:187 (2005)","key":"16_CR21"},{"doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: How to generate and exchange secrets (extended abstract). In: Proceedings of 27th IEEE FOCS, pp. 162\u2013167 (1986)","key":"16_CR22","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Data Privacy Management, Cryptocurrencies and Blockchain Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-67816-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,3]],"date-time":"2019-10-03T06:45:58Z","timestamp":1570085158000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-67816-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319678153","9783319678160"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67816-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}