{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T03:40:41Z","timestamp":1725680441597},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642300530"},{"type":"electronic","value":"9783642300547"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-30054-7_13","type":"book-chapter","created":{"date-parts":[[2012,5,15]],"date-time":"2012-05-15T06:42:55Z","timestamp":1337064175000},"page":"161-171","source":"Crossref","is-referenced-by-count":0,"title":["Detecting Stealthy Backdoors with Association Rule Mining"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Hommes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Radu","family":"State","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Engel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imieli\u0144ski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, pp. 207\u2013216. ACM (1993)","DOI":"10.1145\/170036.170072"},{"key":"13_CR2","unstructured":"FunOverIP: cd00r knocking backdoor, improved (2011), http:\/\/funoverip.net\/2011\/03\/cd00r-knocking-backdoor-improved\/"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s10618-005-0026-2","volume":"13","author":"M. Hahsler","year":"2006","unstructured":"Hahsler, M.: A model-based frequency constraint for mining associations from transaction data. Data Min. Knowl. Discov.\u00a013, 137\u2013166 (2006)","journal-title":"Data Min. Knowl. Discov."},{"key":"13_CR4","unstructured":"Hay, G.: Extending the packet coded backdoor server to netcat relays on relatively high-bandwidth home networks. Tech. rep., SANS (2001)"},{"key":"13_CR5","unstructured":"Jonathan, Y.: Use port knocking to bypass firewall rules and keep security intact (2005), http:\/\/www.techrepublic.com\/article\/use-port-knocking-to-bypass-firewall-rules-and-keep-security-intact\/5798871"},{"key":"13_CR6","unstructured":"Jung, J., Paxson, V., Berger, A.W., Balakrishnan, H.: Fast portscan detection using sequential hypothesis testing. In: Proceedings of the IEEE Symposium on Security and Privacy (2004)"},{"key":"13_CR7","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/11430919_13","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Y.S. Koh","year":"2005","unstructured":"Koh, Y.S., Rountree, N.: Finding Sporadic Rules Using Apriori-Inverse. In: Ho, T.-B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol.\u00a03518, pp. 97\u2013106. Springer, Heidelberg (2005)"},{"key":"13_CR8","doi-asserted-by":"publisher","DOI":"10.4018\/978-1-60566-754-6","volume-title":"Rare Association Rule Mining and Knowledge Discovery: Technologies for Infrequent and Critical Event Detection","author":"Y.S. Koh","year":"2009","unstructured":"Koh, Y.S., Rountree, N.: Rare Association Rule Mining and Knowledge Discovery: Technologies for Infrequent and Critical Event Detection. Information Science Reference - Imprint of: IGI Publishing, Hershey (2009)"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Liu, B., Hsu, W., Ma, Y.: Mining association rules with multiple minimum supports. In: Knowledge Discovery and Data Mining, pp. 337\u2013341 (1999)","DOI":"10.1145\/312129.312274"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Mahoney, M., Mahoney, M.V., Chan, P.K.: Learning rules for anomaly detection of hostile network traffic. In: Proc. of International Conference on Data Mining (ICDM), pp. 601\u2013604 (2003)","DOI":"10.1109\/ICDM.2003.1250987"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Marchetti, M., Colajanni, M., Manganiello, F.: Identification of correlated network intrusion alerts. In: Proc. of the 3rd IEEE International Workshop on Cyberspace Safety and Security (CSS 2011) (2011)","DOI":"10.1109\/CSS.2011.6058565"},{"key":"13_CR12","unstructured":"Miklosovic, S.: Pa018 - term project - port knocking enhancements (2011), http:\/\/www.portknocking.org\/view\/resources"},{"key":"13_CR13","unstructured":"Nyberg, C.M.: Sadoor, http:\/\/packetstormsecurity.org\/UNIX\/penetration\/rootkits\/index7.html"},{"key":"13_CR14","unstructured":"Phenoelit: cd00r.c - packet coded backdoor (2000), http:\/\/www.phenoelit-us.org\/stuff\/cd00r.c"},{"key":"13_CR15","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-540-30143-1_4","volume-title":"Recent Advances in Intrusion Detection","author":"S.E. Schechter","year":"2004","unstructured":"Schechter, S.E., Jung, J., Berger, A.W.: Fast Detection of Scanning Worm Infections. In: Jonsson, E., Valdes, A., Almgren, M. (eds.) RAID 2004. LNCS, vol.\u00a03224, pp. 59\u201381. Springer, Heidelberg (2004)"},{"key":"13_CR16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/3-540-39945-3_6","volume-title":"Recent Advances in Intrusion Detection","author":"A. Valdes","year":"2000","unstructured":"Valdes, A., Skinner, K.: Adaptive, Model-Based Monitoring for Cyber Attack Detection. In: Debar, H., M\u00e9, L., Wu, S.F. (eds.) RAID 2000. LNCS, vol.\u00a01907, pp. 80\u201392. Springer, Heidelberg (2000)"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1145\/1010614.1010616","volume":"22","author":"X. Wu","year":"2004","unstructured":"Wu, X., Zhang, C., Zhang, S.: Efficient mining of both positive and negative association rules. ACM Trans. Inf. Syst.\u00a022, 381\u2013405 (2004)","journal-title":"ACM Trans. Inf. Syst."}],"container-title":["Lecture Notes in Computer Science","NETWORKING 2012"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30054-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,7]],"date-time":"2020-07-07T14:00:10Z","timestamp":1594130410000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30054-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642300530","9783642300547"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30054-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}