{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:09:33Z","timestamp":1725534573371},"publisher-location":"Boston, MA","reference-count":27,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387334059"},{"type":"electronic","value":"9780387334066"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/0-387-33406-8_43","type":"book-chapter","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T04:55:55Z","timestamp":1153716955000},"page":"461-470","source":"Crossref","is-referenced-by-count":4,"title":["Practical Private Regular Expression Matching"],"prefix":"10.1007","author":[{"given":"Florian","family":"Kerschbaum","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"43_CR1","doi-asserted-by":"crossref","unstructured":"R. Agrawal, A. Evfimievski, and R. Srikant. Information sharing across private databases. Proceedings of the ACM SIGMOD international conference on Management of data, 2003.","DOI":"10.1145\/872769.872771"},{"key":"43_CR2","doi-asserted-by":"crossref","unstructured":"M. Atallah, F. Kerschbaum, and W. Du. Secure and Private Sequence Comparisons. Proceedings of the 2nd Workshop on Privacy in the Electronic Society, 2003.","DOI":"10.1145\/1005140.1005147"},{"key":"43_CR3","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. Proceedings of the 20th ACM symposium on Theory of computing, 1988.","DOI":"10.1145\/62212.62213"},{"key":"43_CR4","doi-asserted-by":"crossref","unstructured":"D. Betel, and C. Hogue. Kangaroo \u2014 A pattern-matching program for biological sequences. Bioinformatics 3(20), 2002.","DOI":"10.1186\/1471-2105-3-20"},{"key":"43_CR5","doi-asserted-by":"crossref","unstructured":"M. Bykova, M. Atallah, J. Li, K. Frikken, and M. Topkara. Private Collaborative Forecasting and Benchmarking. Proceedings of the 3rd Workshop on Privacy in the Electronic Society, 2004.","DOI":"10.1145\/1029179.1029204"},{"key":"43_CR6","doi-asserted-by":"crossref","unstructured":"C. Cachin, S. Micali, and M. Stadler. Computationally private information retrieval with poly-logarithmic communication. Proceedings of EUROCRYPT, 1999.","DOI":"10.1007\/3-540-48910-X_28"},{"key":"43_CR7","doi-asserted-by":"crossref","unstructured":"R. Canetti. Security and composition of multiparty cryptographic protocols. Journal of Cryptology 13(1), 2000.","DOI":"10.1007\/s001459910006"},{"key":"43_CR8","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Crepeau, and I. Damgard. Multiparty unconditionally secure protocols. Proceedings of the 20th ACM symposium on Theory of computing, 1988.","DOI":"10.1145\/62212.62214"},{"key":"43_CR9","unstructured":"B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan. Private Information Retrieval. Proceedings of the 36th Symposium on Foundations of Computer Science, 1995."},{"key":"43_CR10","doi-asserted-by":"crossref","unstructured":"J. DeLaurentis. A further weakness in the common modulus protocol for the RSA cryptoalgorithm. Cryptologia 8(3), 1984.","DOI":"10.1080\/0161-118491859060"},{"key":"43_CR11","unstructured":"W. Du, and M. Atallah. Privacy-Preserving Cooperative Scientific Computations. Proceedings of the 14th IEEE Computer Security Foundations Workshop, 2001."},{"key":"43_CR12","doi-asserted-by":"crossref","unstructured":"B. Eckman, A. Kosky, L. Laroco. Extending traditional query-based integration approaches for functional characterization of post-genomic data. Bioinformatics 17(7), 2001.","DOI":"10.1093\/bioinformatics\/17.7.587"},{"key":"43_CR13","doi-asserted-by":"crossref","unstructured":"K. Frikken, and M. Atallah. Privacy Preserving Electronic Surveillance. Proceedings of the 2nd Workshop on Privacy in the Electronic Society, 2003.","DOI":"10.1145\/1005140.1005148"},{"key":"43_CR14","doi-asserted-by":"crossref","unstructured":"Y. Gertner, Y. Ishai, and E. Kushilevitz. Protecting data privacy in private information retrieval schemes. Proceedings of the 30th ACM Symposium on Theory of Computing, 1998.","DOI":"10.1145\/276698.276723"},{"key":"43_CR15","doi-asserted-by":"crossref","unstructured":"S. Goldwasser. Multi party computations: past and present. Proceedings of the 16th ACM symposium on Principles of distributed computing, 1997.","DOI":"10.1145\/259380.259405"},{"key":"43_CR16","unstructured":"O. Goldreich. Secure Multi-party Computation. Available at http:\/\/www. wisdom.weizmann.ac.il\/~oded\/pp.html, 2002."},{"key":"43_CR17","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. Proceedings of the 19th ACM conference on Theory of computing, 1987.","DOI":"10.1145\/28395.28420"},{"key":"43_CR18","unstructured":"J. Hopcroft, R. Motwani, and J. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison Wesley, 2000."},{"key":"43_CR19","unstructured":"F. Kerschbaum. Practical Private Regular Expression Matching. Technical Report, University of Dortmund, available at http:\/\/www4.cs.uni-dortmund.de\/RVS\/FK\/, 2005."},{"key":"43_CR20","unstructured":"E. Kushilevitz, and R. Ostrovsky. Replication is not needed: single database, computationally-private information retrieval. Proceedings of the 38th Symposium on Foundations of Computer Science, 1997."},{"key":"43_CR21","doi-asserted-by":"crossref","unstructured":"S. Pohlig, and M. Hellman. An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Transactions on Information Theory 24, 1978.","DOI":"10.1109\/TIT.1978.1055817"},{"key":"43_CR22","doi-asserted-by":"crossref","unstructured":"R. Rivest, A. Shamir, and L. Adleman. A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM 21(2), 1978.","DOI":"10.1145\/359340.359342"},{"key":"43_CR23","unstructured":"B. Schneier. Applied Cryptography, 2nd Edition. John Wiley & Sons, 1996."},{"key":"43_CR24","unstructured":"D. X. Song, D. Wagner, and A. Perrig. Practical Techniques for Searches on Encrypted Data. Proceedings of IEEE Symposium on Security and Privacy, 2000."},{"key":"43_CR25","doi-asserted-by":"crossref","unstructured":"J. Vaidya, and C. Clifton. Privacy Preserving Association Rule Mining in Vertically Partitioned Data. Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2002.","DOI":"10.1145\/775047.775142"},{"key":"43_CR26","unstructured":"L. Wall, T. Christiansen, J. Orwant. Programming Perl, 3rd Edition. O\u2019Reilly, 2000."},{"key":"43_CR27","doi-asserted-by":"crossref","unstructured":"A. Yao. Protocols for Secure Computations. Proceedings of the IEEE Symposium on Foundations of Computer Science 23, 1982.","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["IFIP International Federation for Information Processing","Security and Privacy in Dynamic Environments"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/0-387-33406-8_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T13:53:29Z","timestamp":1558360409000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/0-387-33406-8_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9780387334059","9780387334066"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/0-387-33406-8_43","relation":{},"ISSN":["1571-5736"],"issn-type":[{"type":"print","value":"1571-5736"}],"subject":[],"published":{"date-parts":[[2006]]}}}