{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T13:42:14Z","timestamp":1762004534663,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642402029"},{"type":"electronic","value":"9783642402036"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40203-6_9","type":"book-chapter","created":{"date-parts":[[2013,8,14]],"date-time":"2013-08-14T02:48:53Z","timestamp":1376448533000},"page":"147-163","source":"Crossref","is-referenced-by-count":2,"title":["Ensuring File Authenticity in Private DFA Evaluation on Encrypted Files in the Cloud"],"prefix":"10.1007","author":[{"given":"Lei","family":"Wei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael K.","family":"Reiter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"GenBank, \n                    \n                      http:\/\/www.ncbi.nlm.nih.gov\/genbank\/"},{"key":"9_CR2","unstructured":"United Kingdom National DNA Database, \n                    \n                      http:\/\/www.npia.police.uk\/en\/8934.htm"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/BFb0055718","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"M. Bellare","year":"1998","unstructured":"Bellare, M., Desai, A., Pointcheval, D., Rogaway, P.: Relations among notions of security for public-key encryption schemes. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 26\u201345. Springer, Heidelberg (1998)"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-642-13739-6_4","volume-title":"Data and Applications Security and Privacy XXIV","author":"M. Blanton","year":"2010","unstructured":"Blanton, M., Aliasgari, M.: Secure outsourcing of DNA searching via finite automata. In: Foresti, S., Jajodia, S. (eds.) Data and Applications Security and Privacy XXIV. LNCS, vol.\u00a06166, pp. 49\u201364. Springer, Heidelberg (2010)"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/BFb0054851","volume-title":"Algorithmic Number Theory","author":"D. Boneh","year":"1998","unstructured":"Boneh, D.: The decision Diffie-Hellman problem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol.\u00a01423, pp. 48\u201363. Springer, Heidelberg (1998)"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"D. Boneh","year":"2001","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 514\u2013532. Springer, Heidelberg (2001)"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-642-03549-4_7","volume-title":"Financial Cryptography and Data Security","author":"J. Camenisch","year":"2009","unstructured":"Camenisch, J., Zaverucha, G.M.: Private intersection of certified sets. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol.\u00a05628, pp. 108\u2013127. Springer, Heidelberg (2009)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-540-76900-2_18","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"S.G. Choi","year":"2007","unstructured":"Choi, S.G., Elbaz, A., Juels, A., Malkin, T., Yung, M.: Two-party computing with encrypted data. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol.\u00a04833, pp. 298\u2013314. Springer, Heidelberg (2007)"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-642-17373-8_13","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"E. Cristofaro De","year":"2010","unstructured":"De Cristofaro, E., Kim, J., Tsudik, G.: Linear-complexity private set intersection protocols secure in malicious model. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol.\u00a06477, pp. 213\u2013231. Springer, Heidelberg (2010)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-642-14577-3_13","volume-title":"Financial Cryptography and Data Security","author":"E. Cristofaro De","year":"2010","unstructured":"De Cristofaro, E., Tsudik, G.: Practical private set intersection protocols with linear complexity. In: Sion, R. (ed.) FC 2010. LNCS, vol.\u00a06052, pp. 143\u2013159. Springer, Heidelberg (2010)"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Curtmola, R., Garay, J., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: Improved definitions and efficient constructions. In: 13th ACM Conference on Computer and Communications Security, pp. 79\u201388 (2006)","DOI":"10.1145\/1180405.1180417"},{"issue":"4","key":"9_CR12","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. ElGamal","year":"1985","unstructured":"ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory\u00a031(4), 469\u2013472 (1985)","journal-title":"IEEE Transactions on Information Theory"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-03007-9_6","volume-title":"Data and Applications Security XXIII","author":"K.B. Frikken","year":"2009","unstructured":"Frikken, K.B.: Practical private DNA string searching and matching through efficient oblivious automata evaluation. In: Gudes, E., Vaidya, J. (eds.) Data and Applications Security XXIII. LNCS, vol.\u00a05645, pp. 81\u201394. Springer, Heidelberg (2009)"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-642-13013-7_20","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"R. Gennaro","year":"2010","unstructured":"Gennaro, R., Hazay, C., Sorensen, J.S.: Text search protocols with simulation based security. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol.\u00a06056, pp. 332\u2013350. Springer, Heidelberg (2010)"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: 19th ACM Symposium on Theory of Computing, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"issue":"3","key":"9_CR16","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/s00145-008-9034-x","volume":"23","author":"C. Hazay","year":"2010","unstructured":"Hazay, C., Lindell, Y.: Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. Journal of Cryptology\u00a023(3), 422\u2013456 (2010)","journal-title":"Journal of Cryptology"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-642-17373-8_12","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"C. Hazay","year":"2010","unstructured":"Hazay, C., Toft, T.: Computationally secure pattern matching in the presence of malicious adversaries. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol.\u00a06477, pp. 195\u2013212. Springer, Heidelberg (2010)"},{"key":"9_CR18","unstructured":"Higgins, K.J.: Black hat: How to hack IPS signatures (2007), \n                    \n                      http:\/\/www.darkreading.com\/security\/perimeter-security\/208804656\/black-hat-how-to-hack-ips-signatures.html"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Katz, J., Malka, L.: Secure text processing with applications to private DNA matching. In: 17th ACM Conference on Computer and Communications Security, pp. 485\u2013492 (2010)","DOI":"10.1145\/1866307.1866361"},{"issue":"4","key":"9_CR20","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s00145-001-0009-4","volume":"14","author":"A.K. Lenstra","year":"2001","unstructured":"Lenstra, A.K., Verheul, E.R.: Selecting cryptographic key sizes. Journal of Cryptology\u00a014(4), 255\u2013293 (2001)","journal-title":"Journal of Cryptology"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Li, F., Hadjieleftheriou, M., Kollios, G., Reyzin, L.: Authenticated index structures for aggregation queries. ACM Transactions on Information and System Security 13(4) (December 2010)","DOI":"10.1145\/1880022.1880026"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Mazi\u00e8res, D., Shasha, D.: Building secure file systems out of Byzantine storage. In: 21st Symposium on Principles of Distributed Computing, pp. 108\u2013117 (July 2002)","DOI":"10.1145\/571825.571840"},{"key":"9_CR23","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.\u00a07178, pp. 398\u2013415. Springer, Heidelberg (2012)"},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","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":"9_CR25","doi-asserted-by":"crossref","unstructured":"Pang, H., Zhang, J., Mouratidis, K.: Scalable verification for outsourced dynamic databases. In: 35th International Conference on Very Large Databases, pp. 802\u2013813 (2009)","DOI":"10.14778\/1687627.1687718"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Papamanthou, C., Tamassia, R., Triandopoulos, R.: Authenticated hash tables. In: 15th ACM Conference on Computer and Communications Security, pp. 437\u2013448 (2008)","DOI":"10.1145\/1455770.1455826"},{"key":"9_CR27","unstructured":"Song, D.X., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: 2000 IEEE Symposium on Security and Privacy (2000)"},{"key":"9_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-642-30057-8_25","volume-title":"Public Key Cryptography \u2013 PKC 2012","author":"E. Stefanov","year":"2012","unstructured":"Stefanov, E., Shi, E., Song, D.: Policy-enhanced private set intersection: sharing information while enforcing privacy policies. In: Fischlin, M., Buchmann, J., Manulis, M. (eds.) PKC 2012. LNCS, vol.\u00a07293, pp. 413\u2013430. Springer, Heidelberg (2012)"},{"key":"9_CR29","doi-asserted-by":"crossref","unstructured":"Troncoso-Pastoriza, J.R., Katzenbeisser, S., Celik, M.: Privacy preserving error resilient DNA searching through oblivious automata. In: 14th ACM Conference on Computer and Communications Security, pp. 519\u2013528 (2007)","DOI":"10.1145\/1315245.1315309"},{"key":"9_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-642-33167-1_30","volume-title":"Computer Security \u2013 ESORICS 2012","author":"L. Wei","year":"2012","unstructured":"Wei, L., Reiter, M.K.: Third-party private DFA evaluation on encrypted files in the cloud. In: Foresti, S., Yung, M., Martinelli, F. (eds.) ESORICS 2012. LNCS, vol.\u00a07459, pp. 523\u2013540. Springer, Heidelberg (2012)"},{"key":"9_CR31","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: 23rd IEEE Symposium on Foundations of Computer Science, pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"9_CR32","doi-asserted-by":"crossref","unstructured":"Zhuge, J., Holz, T., Song, C., Guo, J., Han, X., Zou, W.: Studying malicious websites and the underground economy on the Chinese web. In: Workshop on the Economics of Information Security (June 2008)","DOI":"10.1007\/978-0-387-09762-6_11"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2013"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40203-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T20:46:02Z","timestamp":1559508362000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40203-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642402029","9783642402036"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40203-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}